Results 1 
9 of
9
Comparing and Implementing Calculi of Explicit Substitutions with Eta Reduction
 Annals of Pure and Applied Logic
, 2005
"... The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and higher order proof assistants. It has also been shown that e ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and higher order proof assistants. It has also been shown that eta reduction is useful for adapting substitution calculi for practical problems like higher order uni cation. This paper concentrates on rewrite rules for eta reduction in three dierent styles of explicit substitution calculi: , se and the suspension calculus. Both and se when extended with eta reduction, have proved useful for solving higher order uni cation. We enlarge the suspension calculus with an adequate etareduction which we show to preserve termination and conuence of the associated substitution calculus and to correspond to the etareductions of the other two calculi. We prove that and se as well as and the suspension calculus are non comparable while se is more adequate than the suspension calculus in simulating one step of betacontraction.
Pattern Matching as Cut Elimination
 In Logic in Computer Science
, 1999
"... We present typed pattern calculus with explicit pattern matching and explicit substitutions, where both the typing rules and the reduction rules are modeled on the same logical proof system, namely Gentzen sequent calculus for minimal logic. Our calculus is inspired by the CurryHoward Isomorphism, ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We present typed pattern calculus with explicit pattern matching and explicit substitutions, where both the typing rules and the reduction rules are modeled on the same logical proof system, namely Gentzen sequent calculus for minimal logic. Our calculus is inspired by the CurryHoward Isomorphism, in the sense that types, both for patterns and terms, correspond to propositions, terms correspond to proofs, and term reduction corresponds to sequent proof normalization performed by cut elimination. The calculus enjoys subject reduction, confluence, preservation of strong normalization w.r.t a system with metalevel substitutions, and strong normalization for welltyped terms, and, as a consequence, can be seen as an implementation calculus for functional formalisms using metalevel operations for pattern matching and substitutions.
Lectures on the curryhoward isomorphism
, 1998
"... The CurryHoward isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed λcalculus, firstorder logic corresponds to dependent ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The CurryHoward isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed λcalculus, firstorder logic corresponds to dependent types, secondorder logic corresponds to polymorphic types, etc. The isomorphism has many aspects, even at the syntactic level: formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to term reduction, etc. But there is much more to the isomorphism than this. For instance, it is an old idea—due to Brouwer, Kolmogorov, and Heyting, and later formalized by Kleene’s realizability interpretation—that a constructive proof of an implication is a procedure that transforms proofs of the antecedent into proofs of the succedent; the CurryHoward isomorphism gives syntactic representations of such procedures. These notes give an introduction to parts of proof theory and related
Resource operators for λcalculus
 INFORM. AND COMPUT
, 2007
"... We present a simple term calculus with an explicit control of erasure and duplication of substitutions, enjoying a sound and complete correspondence with the intuitionistic fragment of Linear Logic’s proofnets. We show the operational behaviour of the calculus and some of its fundamental properties ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We present a simple term calculus with an explicit control of erasure and duplication of substitutions, enjoying a sound and complete correspondence with the intuitionistic fragment of Linear Logic’s proofnets. We show the operational behaviour of the calculus and some of its fundamental properties such as confluence, preservation of strong normalisation, strong normalisation of simplytyped terms, step by step simulation of βreduction and full composition.
Unification via the ...Style of Explicit Substitutions
, 2001
"... A unication method based on the se style of explicit substitution is proposed. This method together with appropriate translations, provide a Higher Order Unication (HOU) procedure for the pure calculus. Our method is inuenced by the treatment introduced by Dowek, Hardin and Kirchner using the sty ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A unication method based on the se style of explicit substitution is proposed. This method together with appropriate translations, provide a Higher Order Unication (HOU) procedure for the pure calculus. Our method is inuenced by the treatment introduced by Dowek, Hardin and Kirchner using the style of explicit substitution. Correctness and completeness properties of the proposed seunication method are shown and its advantages, inherited from the qualities of the se calculus, are pointed out. Our method needs only one sort of objects: terms. And in contrast to the HOU approach based on the calculus, it avoids the use of substitution objects. This makes our method closer to the syntax of the calculus. Furthermore, detection of redices depends on the search for solutions of simple arithmetic constraints which makes our method more operational than the one based on the style of explicit substitution. Keywords: Higher order unication, explicit substitution, lambdacalculi. 1
On Zucker's isomorphism for LJ and its extension to Pure Type Systems
, 2003
"... It is shown how the sequent calculus LJ can be embedded into a simple extension of the calculus by generalized applications, called J. The reduction rules of cut elimination and normalization can be precisely correlated, if explicit substitutions are added to J. The resulting system J2 is prove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is shown how the sequent calculus LJ can be embedded into a simple extension of the calculus by generalized applications, called J. The reduction rules of cut elimination and normalization can be precisely correlated, if explicit substitutions are added to J. The resulting system J2 is proved strongly normalizing, thus showing strong normalization for Gentzen's cut elimination steps. This re nes previous results by Zucker, Pottinger and Herbelin on the isomorphism between natural deduction and sequent calculus.
Higher Order Unification via ...Style of Explicit Substitution
"... A higher order unification (HOU) method based on the ...style of explicit substitution is proposed. The method is based on the treatment introduced by Dowek, Hardin and Kirchner in [DHK95] using the ...style of explicit substitution. Correctness and completeness properties of the proposed approach ..."
Abstract
 Add to MetaCart
A higher order unification (HOU) method based on the ...style of explicit substitution is proposed. The method is based on the treatment introduced by Dowek, Hardin and Kirchner in [DHK95] using the ...style of explicit substitution. Correctness and completeness properties of the proposed approach are shown and advantages of the method, inherited from the qualities of the ... calculus, are pointed out.
A Formal Calculus for Categories
, 2003
"... This dissertation studies the logic underlying category theory. In particular we present a formal calculus for reasoning about universal properties. The aim is to systematise judgements about functoriality and naturality central to categorical reasoning. The calculus is based on a language which ext ..."
Abstract
 Add to MetaCart
This dissertation studies the logic underlying category theory. In particular we present a formal calculus for reasoning about universal properties. The aim is to systematise judgements about functoriality and naturality central to categorical reasoning. The calculus is based on a language which extends the typed lambda calculus with new binders to represent universal constructions. The types of the languages are interpreted as locally small categories and the expressions represent functors. The logic supports a syntactic treatment of universality and duality. Contravariance requires a definition of universality generous enough to deal with functors of mixed variance. Ends generalise limits to cover these kinds of functors and moreover provide the basis for a very convenient algebraic manipulation of expressions. The equational theory of the lambda calculus is extended with new rules for the definitions of universal properties. These judgements express the existence of natural isomorphisms between functors. The isomorphisms allow us to formalise in the calculus results like the Yoneda lemma and Fubini theorem for ends. The definitions of limits and ends are given as representations for special Setvalued functors where Set is the category of sets and functions. This establishes the basis for a more calculational presentation of category theory rather than the traditional diagrammatic one. The presence of structural rules as primitive in the calculus together with the rule for duality give rise to issues concerning the coherence of the system. As for every welltyped expressionincontext there are several possible derivations it is sensible to ask whether they result in the same interpretation. For the functoriality judgements the system is coherent up to natural isomo...
Comparing Calculi of Explicit . . .
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 67 (2002)
, 2002
"... The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and higher order proof assistants. Three styles of explicit substi ..."
Abstract
 Add to MetaCart
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and higher order proof assistants. Three styles of explicit substitutions are treated in this paper: the and the s e which have proved useful for solving practical problems like higher order uni cation, and the suspension calculus related to the implementation of the language Prolog. We enlarge the suspension calculus with an adequate etareduction which we show to preserve termination and conuence of the associated substitution calculus and to correspond to the etareductions of the other two calculi. Additionally, we prove that and s e as well as and the suspension calculus are non comparable while s e is more adequate than the suspension calculus.