Results 1  10
of
16
Intersection types for explicit substitutions
, 2003
"... We present a new system of intersection types for a compositionfree calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical inte ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
We present a new system of intersection types for a compositionfree calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical intersection types system, which characterized head normalization and weak normalization, but was not complete for strong normalization. An important role is played by the notion of available variable in a term, which is a generalization of the classical notion of free variable.
Cut Rules and Explicit Substitutions
, 2000
"... this paper deals exclusively with intuitionistic logic (in fact, only the implicative fragment), we require succedents to be a single consequent formula. Natural deduction systems, which we choose to call Nsystems, are symbolic logics generally given via introduction and elimination rules for the l ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
this paper deals exclusively with intuitionistic logic (in fact, only the implicative fragment), we require succedents to be a single consequent formula. Natural deduction systems, which we choose to call Nsystems, are symbolic logics generally given via introduction and elimination rules for the logical connectives which operate on the right, i.e., they manipulate the succedent formula. Examples are Gentzen's NJ and NK (Gentzen 1935). Logical deduction systems are given via leftintroduction and rightintroduction rules for the logical connectives. Although others have called these systems "sequent calculi", we call them Lsystems to avoid confusion with other systems given in sequent style. Examples are Gentzen's LK and LJ (Gentzen 1935). In this paper we are primarily interested in Lsystems. The advantage of Nsystems is that they seem closer to actual reasoning, while Lsystems on the other hand seem to have an easier proof theory. Lsystems are often extended with a "cut" rule as part of showing that for a given Lsystem and Nsystem, the derivations of each system can be encoded in the other. For example, NK proves the same as LK + cut (Gentzen 1935). Proof Normalization. A system is consistent when it is impossible to prove false, i.e., derive absurdity from zero assumptions. A system is analytic (has the analycity property) when there is an e#ective method to decompose any conclusion sequent into simpler premise sequents from which the conclusion can be obtained by some rule in the system such that the conclusion is derivable i# the premises are derivable (Maenpaa 1993). To achieve the goals of consistency and analycity, it has been customary to consider
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.
Proof Nets and Explicit Substitutions
 Mathematical Structures in Computer Science
, 2000
"... We refine the simulation technique introduced in [10] to show strong normalization of calculi with explicit substitutions via termination of cut elimination in proof nets [12]. We first propose a notion of equivalence relation for proof nets that extends the one in [9], and we show that cut elimina ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We refine the simulation technique introduced in [10] to show strong normalization of calculi with explicit substitutions via termination of cut elimination in proof nets [12]. We first propose a notion of equivalence relation for proof nets that extends the one in [9], and we show that cut elimination modulo this equivalence relation is terminating. We then show strong normalization of the typed version of the l  calculus with de Bruijn indices (a calculus with full composition defined in [8]) using a translation from typed l to proof nets. Finally, we propose a version of typed l with named variables which helps to better understand the complex mechanism of the explicit weakening notation introduced in the l calculus with de Bruijn indices [8]. 1
From Proof Normalization to Compiler Generation and TypeDirected ChangeofRepresentation
, 1997
"... The main part of this thesis is a synthesis of considerations from Type Theory, Mathematical Logic/Proof Theory, and (Denotational) Semantics to perform various automatic program transformations ranging from normalization over currying and coercioninsertion to compiler derivation. At the core of o ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The main part of this thesis is a synthesis of considerations from Type Theory, Mathematical Logic/Proof Theory, and (Denotational) Semantics to perform various automatic program transformations ranging from normalization over currying and coercioninsertion to compiler derivation. At the core of our technique we have what has been described as "An Inverse of the Evaluation Functional for Typed calculus" [7]. It is essentially typedirected jexpansion followed by fireduction on certain terms. Quite independently of [7], jexpansion has been studied for its use in Partial Evaluation, where among other things it has been used to obtain a onepass CPStransformer [20]. It is some of the consequences of this coincidence [19] that are described in the following. Our approach will be purely syntactical and it is hoped that it marks a simplification on earlier treatments of the materiel. We have tried presenting the materiel based purely on the standard reduction properties for the simpl...
Explicit Substitutions and Reducibility
 Journal of Logic and Computation
, 2001
"... . We consider reducibility sets dened not by induction on types but by induction on sequents as a tool to prove strong normalization of systems with explicit substitution. To illustrate this point, we give a proof of strong normalization (SN) for simplytyped callbyname ~calculus enriched with op ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
. We consider reducibility sets dened not by induction on types but by induction on sequents as a tool to prove strong normalization of systems with explicit substitution. To illustrate this point, we give a proof of strong normalization (SN) for simplytyped callbyname ~calculus enriched with operators of explicit unary substitutions. The ~calculus, dened by Curien & Herbelin, is a variant of calculus with a let operator that exhibits symmetries such as terms/contexts and callbyname /callbyvalue reduction. The ~calculus embeds various standard calculi (and Gentzen's style sequent calculi too) and as an application we derive the strong normalization of Parigot's simplytyped calculus with explicit substitution. Introduction Explicit substitution in calculus The traditional theory of calculus relies on reduction, that is the capture by a function of its argument followed by the process of substituting this argument to the places where it is used. The ...
Pure Type Systems with Explicit Substitution
, 2000
"... We define an extension of pure type systems with explicit substitution. It is shown that the type systems with explicit substitution are strongly normalizing iff their ordinary counterparts are. Subject reduction is shown to fail in general but a weaker  still useful  subject reduction property is ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We define an extension of pure type systems with explicit substitution. It is shown that the type systems with explicit substitution are strongly normalizing iff their ordinary counterparts are. Subject reduction is shown to fail in general but a weaker  still useful  subject reduction property is established. A more complicated extension is proposed for which subject reduction does hold in general.
Explicit Substitutions and Programming Languages
 In 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS
, 1999
"... Abstract. The λcalculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get finer properties with respect to gradual implementations of substitutions as effectively done in runtimes of progr ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. The λcalculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get finer properties with respect to gradual implementations of substitutions as effectively done in runtimes of programming languages. But the theory of explicit substitutions has some defects such as nonconfluence or the nontermination of the typed case. In this paper, we stress on the subtheory of weak substitutions, which is sufficient to analyze most of the properties of programming languages, and which preserves many of the nice theorems of the λcalculus. 1
Characterising Explicit Substitutions which Preserve Termination (Extended Abstract)
 In Typed Lambda Calculi and Applications
, 1999
"... Contrary to all expectations, the lambdasigmacalculus, the canonical simplytyped lambdacalculus with explicit substitutions, is not strongly normalising. This result has led to a proliferation of calculi with explicit substitutions. This paper shows that the reducibility method provides a genera ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Contrary to all expectations, the lambdasigmacalculus, the canonical simplytyped lambdacalculus with explicit substitutions, is not strongly normalising. This result has led to a proliferation of calculi with explicit substitutions. This paper shows that the reducibility method provides a general criterion when a calculus of explicit substitution is strongly normalising for all untyped lambdaterms that are strongly normalising. This result is general enough to imply preservation of strong normalisation of the calculi considered in the literature. We also propose a version of the lambdasigmacalculus with explicit substitutions which is strongly normalising for strongly normalising lambdaterms.
Strong Normalization of Proof Nets Modulo Structural Congruences
 Proc of RTA, volume 1631 of LNCS
, 1999
"... . This paper proposes a notion of reduction for the proof nets of Linear Logic modulo an equivalence relation on the contraction links, that essentially amounts to consider the contraction as an associative commutative binary operator that can float freely in and out of proof net boxes. The need for ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. This paper proposes a notion of reduction for the proof nets of Linear Logic modulo an equivalence relation on the contraction links, that essentially amounts to consider the contraction as an associative commutative binary operator that can float freely in and out of proof net boxes. The need for such a system comes, on one side, from the desire to make proof nets an even more parallel syntax for Linear Logic, and on the other side from the application of proof nets to lcalculus with or without explicit substitutions, which needs a notion of reduction more flexible than those present in the literature. The main result of the paper is that this relaxed notion of rewriting is still strongly normalizing. Keywords: Proof Nets. Linear Logic. Strong Normalization. 1 Introduction In his seminal paper [6], Girard proposed proof nets as a parallel syntax for Linear Logic, where uninteresting permutations in the order of application of logical rules are desequentialised and collapsed. Neve...