Results 241 to 250 of about 7,269,595 (295)

Program extraction by type erasing

Proceedings Eighteenth Annual International Computer Software and Applications Conference (COMPSAC 94), 2002
PowerEpsilon is a proof development system based on Martin-Lof's type theory and the calculus of constructions. It contains a logic, a specification language and a programming language, so it is a powerful tool with different uses, However, the constructive type theory is an integrated logic in which the logical and computational parts are associated ...
Ming-Yuan Zhu, Yi-Qiang Ding
openaire   +1 more source

Program extraction for mutable arrays

Science of Computer Programming, 2018
Abstract We present a lightweight method to represent, verify, and extract efficient programs involving mutable arrays in the Coq proof assistant. Our method mainly consists of a library for handling mutable arrays and an improved extraction plugin.
openaire   +1 more source

Provably recursive programs and program extraction

1991
There is, clearly, more to a program than the function it computes. Nevertheless, the relationship between notions of computation and deduction is commonly made precise over a formal theory by isolating that theory's class of provably recursive functions — i.e., the recursive functions the theory proves total.
openaire   +2 more sources

Program Extraction from Nested Definitions

2013
Minlog is a proof assistant which automatically extracts computational content in an extension of Godel's T from formalized proofs. We report on extending Minlog to deal with predicates defined using a particular combination of induction and coinduction, via so-called nested definitions. In order to increase the efficiency of the extracted programs, we
Miyamoto, Kenji, Nordvall Forsberg, Fredrik, Schwichtenberg, Helmut   +2 more
openaire   +4 more sources

* Extraction and Imperative Programming

2004
We can use the Coq system to model programs, by describing them as functions in a purely functional programming language. However, the Coq system does not provide an efficient environment to execute them. It is better to rely on the usual programming tools (compilers, abstract machines, and so on) to provide this environment.
Yves Bertot, Pierre Castéran
openaire   +1 more source

Extracting grammar from programs

ACM SIGPLAN Notices, 2005
The paper discusses context-free grammar (CFG) inference using genetic-programming with application to inducing grammars from programs written in simple domain-specific languages. Grammar-specific heuristic operators and non-random construction of the initial population are proposed to achieve this task.
Matej Crepinsek, Marjan Mernik, Faizan Javed, Barrett R. Bryant, Alan P. Sprague   +4 more
openaire   +2 more sources

Stick diagram extraction program SKELETON

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers, 2003
A stick diagram extraction program SKELETON has been developed to make use of an existing handcrafted layout in a symbolic circuit layout system. It transforms a physical layout into an equivalent stick diagram. The concepts of centralized terminals and dispersed terminals are used for technology change and scaling.
Masayuki Sato, Noriaki Ohba, Hiromi Watanabe, Shozo Saito   +3 more
openaire   +2 more sources

Design Patterns as Program Extracts

1998
We present a view on software systems, which emphasizes that a software system shapes the user's conceptual model. Regarding a software developer as a user, we point out the existence of a gap between the model of programs represented by a software development system and the software developer's conceptual model of programs.
openaire   +2 more sources

Program extraction from classical proofs

1995
Different methods for extracting a program from a classical proof are investigated. A direct method based on normalization and the wellknown negative translation combined with a realizability interpretation are compared and shown to yield equal results. Furthermore, the translation method is refined in order to obtain optimized programs. An analysis of
Ulrich Berger 0001, Helmut Schwichtenberg   +1 more
openaire   +1 more source

Classes extraction from procedural programs

Information Sciences, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henda Bélaïd Ajroud, Ali Jaoua, S. Kaabi   +2 more
openaire   +2 more sources