Results 1  10
of
17
A callbyname lambdacalculus machine
 Higher Order and Symbolic Computation
"... We present, in this paper, a particularly simple lazy machine which runs programs written in λcalculus. It was introduced by the present writer more than twenty years ago. It has been, since, used and implemented ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
We present, in this paper, a particularly simple lazy machine which runs programs written in λcalculus. It was introduced by the present writer more than twenty years ago. It has been, since, used and implemented
Proof Interpretations and the Computational Content of Proofs. Draft of book in preparation
, 2007
"... This survey reports on some recent developments in the project of applying proof theory to proofs in core mathematics. The historical roots, however, go back to Hilbert’s central theme in the foundations of mathematics which can be paraphrased by the following question ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This survey reports on some recent developments in the project of applying proof theory to proofs in core mathematics. The historical roots, however, go back to Hilbert’s central theme in the foundations of mathematics which can be paraphrased by the following question
Realizability algebras: a program to well order R
, 2010
"... When transforming mathematical proofs into programs, the main problem is naturally due to the axioms: indeed, it has been a long time since we know how to transform a proof in pure (i.e. without axioms) intuitionistic logic, even at second order [2, 7, 4]. ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
When transforming mathematical proofs into programs, the main problem is naturally due to the axioms: indeed, it has been a long time since we know how to transform a proof in pure (i.e. without axioms) intuitionistic logic, even at second order [2, 7, 4].
Realizability : a machine for analysis and set theory
, 2006
"... In this tutorial, we introduce the CurryHoward (proofprogram) correspondence which is usually restricted to intuitionistic logic. We explain how to extend this correspondence to the whole of mathematics and we build a simple suitable machine for this. ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
In this tutorial, we introduce the CurryHoward (proofprogram) correspondence which is usually restricted to intuitionistic logic. We explain how to extend this correspondence to the whole of mathematics and we build a simple suitable machine for this.
Disjunctive Normal Forms and Local Exceptions
, 2003
"... All classical λterms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a specializ ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
All classical λterms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a specialized sequent calculus and shown to be correct.
Proofs, programs, processes
"... Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this interpretation is that realisers are given by terms that correspond directly to programs in a lazy functional programming la ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this interpretation is that realisers are given by terms that correspond directly to programs in a lazy functional programming language such as Haskell. Programs extracted from proofs using coinduction can be understood as perpetual processes producing infinite streams of data. Typical applications of such processes are computations in exact real arithmetic. As an example we show how to extract a program computing the average of two real numbers w.r.t. to the binary signed digit representation. 1
Getting results from programs extracted from classical proofs.
, 2002
"... We present a new method to extract from a classical proof of ∀x(I[x] → ∃y(O[y] ∧ S[x, y])) a program computing y from x. This method applies when O is a data type and S is a decidable predicate. Algorithms extracted this way are often far better than a stupid enumeration of all the possible outputs ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a new method to extract from a classical proof of ∀x(I[x] → ∃y(O[y] ∧ S[x, y])) a program computing y from x. This method applies when O is a data type and S is a decidable predicate. Algorithms extracted this way are often far better than a stupid enumeration of all the possible outputs and this is verified on a non trivial example: a proof of Dickson’s lemma. 1 Introduction. Since Griffin and Felleisen [7, 8], we know a relation between classical proofs and programs. However, it is not true that from a classical proof of the existence of an object you can compute this object. This would clearly be a contradiction with the existence of provably total but non computable functions (such as a function saying
A program for the Continuum Hypothesis
"... Classical realizability is a method to obtain programs from mathematical proofs in Analysis and set theory. In this talk, we limit ourselves to Analysis, a theory stated in second order logic. Since the discovery, by T. Griffin in 1990, that a control instruction was typed ..."
Abstract
 Add to MetaCart
Classical realizability is a method to obtain programs from mathematical proofs in Analysis and set theory. In this talk, we limit ourselves to Analysis, a theory stated in second order logic. Since the discovery, by T. Griffin in 1990, that a control instruction was typed
Realizability for programming languages.
"... We present a toy functional programming language inspired by our work on the PML language [22] together with a criterion ensuring safety and the fact that non termination can only occur via recursive programs. To prove this theorem, we use realizability techniques and a semantical notion of types. I ..."
Abstract
 Add to MetaCart
We present a toy functional programming language inspired by our work on the PML language [22] together with a criterion ensuring safety and the fact that non termination can only occur via recursive programs. To prove this theorem, we use realizability techniques and a semantical notion of types. Important features of PML like polymorphism, proofchecking, termination criterion for recursive function,... will be covered by forthcoming articles reusing the formalism introduced here. The paper contains the source of the algorithm (some boring parts like the parser are omitted) and the complete source are available from the author webpage.