Jean-Yves Girard, Yves Lafont, and Paul Taylor, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, UK, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Strong Normalization Proofs for Cut Elimination in Gentzen's.. - Bittar (Correct)
....on F follows the rewriting system RLKsp and hence its interpretation in the algebra of terms on F follows the rewriting system R LKsp . This mix elimination system ELKsp is based on a mix elimination system proposed in [Pab90] and is in the tradition of those studied in [Gen38] Gir87] [GLT89], Tah92] Gal93] and [CRS96] We show in a later section that the set of transformations given in this section is exhaustive, which means that each mix inference with non mix inference premises occurring in a proof matches at least one left hand side of a mix elimination rule. We point out also ....
J.Y. Girard, Y. Lafont and P. Taylor, Proofs and types, Vol. 7 of Cambridge Tracts in Theoretical Computer Science, Cambridge university press, (1989).
Programming Metalogics with a Fixpoint Type - Crole (1992) (9 citations) (Correct)
....to ML T . The most basic of these was the addition of function types, resulting in the computational calculus ML T . Adding a fixpoint type fix , coproduct types ff fi and a natural number type nat to the computational calculus ML T , we arrive at a system FIX= which extends Godel s system T [Gir89]. FIX= admits sound translations of Plotkin s PCF [Plo77] and we shall return to the topic of PCF translations in Chapter 6. We now formally define FIX= Signatures for FIX= Definition 2.5.1 A FIX= signature, denoted by Sg; is specified by: ffl A collection of types. The types are built up in ....
J.-Y. Girard. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989. Translated and with appendices by P. Taylor and Y. Lafont.
Cut-Elimination in the Strict Intersection Type Assignment.. - van Bakel (Correct)
....and perhaps more surprising, result of this paper is then that all normal characterisations of (strong head) normalisation are consequences of the strong normalisation of cut elimination. Many strong normalisation results in the context of types use the technique of Computability Predicates [24, 18], which provides a means for proving termination of typeable terms using a predicate defined by induction on the structure of types. This technique has been widely used to study normalisation properties (or similar results) as for example in [20, 12, 15, 22, 19, 1, 2, 17, 7, 4, 16, 5] this list ....
....are straightforward by Definition 15. 4. STRONG NORMALISATION OF DERIVATION REDUCTION In this subsection, we will prove a strong normalisation result for derivation reduction. In order to prove that each derivation in is strongly normalisable with respect to D , a notion of computable [24, 18] derivations will be introduced. We will show that all computable derivations are strongly normalisable with respect to derivation reduction, and then that all derivations in are computable. Definition 19 (Computability Predicate) Comp (D) is defined recursively on types by: Comp (D : B M ....
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
Strongly Normalising Cut-Elimination with Strict Intersection.. - van Bakel (2003) Self-citation (Types) (Correct)
No context found.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
Soft Linear Logic and Polynomial Time - Yves Lafont Federation (3 citations) Self-citation (Lafont) (Correct)
No context found.
J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, Cambridge University Press (1989).
A judgmental analysis of linear logic - Bor-Yuh Evan Chang (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, UK, 1989.
A Judgmental Analysis of Linear Logic - Bor-Yuh Evan Chang (2003) (1 citation) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, UK, 1989.
A Judgmental Analysis Of Linear Logic - Bor-Yuh Evan Chang (2003) (1 citation) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, UK, 1989.
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types.Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
Naming Proofs in Classical Propositional Logic - Lamarche, Straßburger (2005) (3 citations) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
The Virtues of Eta-expansion - Barry Jay School (1995) (30 citations) (Correct)
No context found.
J-Y. Girard, P. Taylor and Y. Lafont, Proofs and Types, Cambridge Tracts in Theoretical Computer Science (Cambridge University Press, 1989).
Naming Proofs in Classical Propositional Logic - Lamarche, Straßburger (2005) (3 citations) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003) (1 citation) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, UK, 1989.
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (21 citations) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types.Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
Decision Problems for Second-Order Linear Logic - Lincoln, Scedrov, Shankar (1995) (6 citations) (Correct)
No context found.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1989.
Specifying Interaction Categories - Pavlovi'c And Abramsky (Correct)
No context found.
J.-Y. Girard et al., Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7 (Cambridge Univ. Press 1989)
Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (2001) (Correct)
No context found.
J.-Y. Girard. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989. Translated and with appendices by P. Taylor and Y. Lafont.
Predicate Transformers and Linear Logic: Second-Order - Pierre Hyvernat Institut (Correct)
No context found.
Jean-Yves Girard, Paul Taylor, and Yves Lafont, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, 1989.
Names and Higher-Order Functions - Stark (1995) (29 citations) (Correct)
No context found.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press, 1989. (p. 5)
Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (Correct)
No context found.
J.-Y. Girard. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989. Translated and with appendices by P. Taylor and Y. Lafont.
A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003) (1 citation) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, UK, 1989.
Normalization by Evaluation for Typed Lambda.. - Altenkirch, Dybjer, .. (2001) (2 citations) (Correct)
No context found.
J.-Y. Girard, Y. Lafont, P. Taylor. Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, 1989.
Towards a Semantic Web for Formal Mathematics - Schena (2002) (Correct)
No context found.
Girard J. Y., Lafont Y., and Taylor P. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
On Strong Normalization in the Intersection Type Discipline.. - Boudol (2 citations) (Correct)
No context found.
J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, Cambridge University Press (1989).
A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003) (1 citation) (Correct)
No context found.
Jean-Yves Girard, Yves Lafont, and Paul Taylor, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, UK, 1989.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC