We present here a new extraction mechanism for the Coq proof assistant [17]. By extraction,
we mean automatic generation of functional code from Coq proofs, in order to produce …

Nous nous intéressons ici à la génération de programmes certifiés corrects par construction.
Ces programmes sont obtenus en extrayant l'information pertinente de preuves …

Based on a representation of primitive proof objects as λ-terms, which has been built into the
theorem prover Isabelle recently, we propose a generic framework for program extraction …

This thesis presents several extensions to the generic theorem prover Isabelle, a logical
framework based on higher order logic. The central contribution of this thesis is the …

Dependent type theory is a proven technology for verified functional programming in which
programs and their correctness proofs may be developed using the same rules in a single …

Explaining Simulated Phenomena Page 1 Explaining Simulated Phenomena A defense of
the epistemic power of computer simulations Von der Philosophisch-Historischen Fakultät …

This paper presents a step in the development of an operational approach to program
extraction in type theory. In order to get a program from a lambda term, the logical parts need …

We prove that system ST (introduced in a previous work) enjoys subject reduction and is
complete for realizability semantics. As far as the author knows, this is the only type system …

Abstract The Theory of Specifications is an extension of the Calculus of Constructions where
the specification of a problem, the derivation of a program, and its correctness proof, can all …

We introduce a new type system called “System ST”(ST stands for subtyping), based on
subtyping, and prove the basic property of the system. We show the extraordinary …