J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination de coupures dans l'analyse et la theorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63--92. North-Holland Publishing Co., 1971. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Constructive Logics. Part I: A Tutorial on Proof Systems and.. - Gallier (2003) (26 citations) (Correct)
....has already been imposed. This (usual) presentation facilitates the comparison with natural deduction, but makes it impossible to describe general cutelimination rules. For the sake of historical accuracy, note that essentially the same system appears in section 2 of Girard s classic paper [10]. With our system, it is possible to write reduction rules that correspond to cut elimination steps (see section 12) For example, let x: A: M 1 be z: A B) in (let zM 2 be y: B in N) let (let M 2 be x: A in M 1 ) be y: B in N; let hM;Ni be hx: A; y: Bi in P let M be x: A in (let N be y: ....
Jean-Yves Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In J.E. Fenstad, editor, Proc. 2nd Scand. Log. Symp., pages 63-92. North-Holland, 1971.
Semantic and Syntactic Approaches to Simulation Relations - Hannay, Katsumata, Sannella (2003) (Correct)
....for establishing observational equivalence that is not just sound, as with logical relations, but is also complete. The use of pre logical relations in data refinement is studied in [HLST00] The situation is more complicated when we consider polymorphically typed lambda calculi such as System F [Gir71,Rey74]. Pre logical relations can be extended to this context, see [Lei01] but then they do not compose in general although they remain sound and complete for observational equivalence. At the same time, the power of System F opens the possibility of taking a syntactic approach, placing the concept of ....
....considered in the last section is a very simple language. Extending it with other type constructors, for example sum and product types, is unproblematic, see [HS02] Much more challenging is the addition of parametric polymorphism as found in functional programming languages, which yields System F [Gir71,Rey74]. A hint of the power this adds, apart from the obvious ability to define functions that work uniformly over a family of types, is the fact that it is possible to encode inductive types, including the natural numbers, booleans, lists and products, in pure System F [BB85] Our interest is in data ....
J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. Proc. 2nd Scandinavian Logic Symp., Oslo. Studies in Logic and the Foundations of Mathematics, Vol. 63, 63--92. North-Holland (1971).
Process Migration and Transactions Using a Novel.. - Hickey, Smith.. (2002) (1 citation) (Correct)
....light) and Pascal. Programs in these languages are compiled to a typed Functional Intermediate Representation (FIR) Types are maintained throughout the compilation process, which ensures that component interactions respect type and memory safety. The core FIR language is a variant of System F [8] in continuation passing style (CPS) 1] In many respects, the FIR language is similar to the typed intermediate language used in the TILT compiler [22, 18] However, the FIR is much more limited syntactically; the precise language is speci ed in Section 2. The FIR language has been quite ....
J-Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et sonapplication a l'elimination des coupures dans l'analyse et la theorie des types. In 2nd Scandinavian Logic Symp., pages 63-69. Springer-Verlag, NY, 1971.
Intensional Polymorphism in Type-Erasure Semantics - Karl Crary Stephanie (1998) (54 citations) (Correct)
....begin by summarizing Harper and Morrisett s # [10] The # i calculus provides these tools in a form that is relatively simple, but already quite powerful. The syntax of # i appears below (modified slightly for presentation) The backbone of # i is a predicative variant of Girard s F# [8, 7] in which the quantified type ##:#.# ranges only over type constructors and small types (i.e. monotypes) which do not include the quantified types. The type analysis operators are Typerec and typecase at the constructor and term levels. kinds) # : Type (con # s) c : # ....
J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination de coupures dans l'analyse et la theorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63--92. North-Holland Publishing Co., 1971.
Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002) (Correct)
....sets, which is referred to as the reducibility method. The reducibility method is a generally accepted way for proving the strong normalisation property of various type systems such as the simply typed lambda calculus in Tait [23] and the polymorphic lambda calculus in Tait [24] and Girard [13]. All the above mentioned papers characterising evaluation properties of terms and of terms in x by means of intersection types apply variants of this method. 1 The Calculus and the Type Assignment Following [10] we consider the set of terms x which uses names rather than De Bruijn indices. ....
J.-Y. Girard. Une extension de l'interpr etation de G odel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la th eorie des types. In 2nd Scandinavian Logic Symposium, pages 63--92. North-Holland, 1971.
Proof Interpretations and the Computational Content of Proofs - Kohlenbach (2002) (1 citation) (Correct)
....to functional interpretation in this context see [8] CHAPTER 7. NEGATIVE AND FUNCTIONAL INTERPRETATION 62 extended to still stronger systems using bar recursive functionals of infinite types. A di#erent extension of functional interpretation to classical analysis was achieved by J. Y. Girard in [39] using his well known system F of polymorphic functionals. Many important applications of functional interpretation to classical systems using certain ine#ective functionals (representing strong forms of comprehension) are carried out in [34] In [108] fragments of Peano arithmetic are ....
Girard, J.-Y., Une extension de l'interpretation de Godel a l'analyse, et son application a l' elimination des coupures dans l'analyse et dans la theorie des types. In: Fenstad, J.E. (ed.), Proc. of the Second Scandinavian Logic Symposium, North-Holland, Amsterdam, pp. 63-92 (1971).
Types in Programming Languages - Camarão, Figueiredo, Pimentel (Correct)
....this type system. In this work, we present some examples of type systems that support the definition of constructs used in modern programming languages. Some recent research topics, like dependent types [ML78, ML84, Mac86, C 86, CH88] intersection types [Jim96] impredicative polymorphism [Gir71, Gir89, Rey74] and works related with module systems [HL94, Mac85, MTH90, Mac86, MMM91] will not be treated here. It should be noted that formal systems can be used to define not only types, but also other properties of programming language constructs. 2.1 Types and meanings Well typed ....
J.-Y. Girard. Une extension de l'interpretation de Godel `a l'analyse, et son application `a l'elimination des coupures dans l'analyse et la th'eorie des types. In Proc. of the 2nd Scandinavian logic symposium, pages 63--92. North-Holland, Amsterdam, 1971. 23
Appendix 1: Product Types in F ! - In This Section Self-citation (Girard) (Correct)
No context found.
Girard, J.Y., Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types, Proc. 2nd Scand. Log. Symp., 1970.
From System F to Typed Assembly Language - Greg Morrisett David (1998) (6 citations) (Correct)
No context found.
J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination de coupures dans l'analyse et la theorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63--92. North-Holland Publishing Co., 1971.
Type Theory and Rewriting - BLANQUI (2001) (1 citation) (Correct)
No context found.
J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse et son application a l'elimination des coupures dans l'analyse et la theorie des types. In J. Fenstad, editor, Proc. of the 2nd Scandinavian Logic Symposium, volume 63 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1971. See [64].
Reducibility: a ubiquitous method in lambda calculus with.. - Ghilezan, al. (2002) (Correct)
No context found.
Girard, J.-Y., Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types, in: J. Fenstad, editor, 2nd Scandinavian Logic Symposium, North-Holland, Amsterdam (1971), pp. 63--92.
New Notions of Reduction and Non-Semantic Proofs of Strong.. - Kfoury, Wells (1995) (20 citations) (Correct)
No context found.
J.-Y. Girard. Une extension de l'interpr'etation de Godel `a l'analyse, et son application `a l'elimination des coupures dans l'analyse et la th'eorie des types. In J. E. Fenstad, ed., Proceedings of 2nd Scandinavian Logic Symposium, pp. 63--92, Amsterdam, 1971. North Holland.
A Lambda Model Characterizing Computational Behaviours of.. - Dezani-Ciancaglini.. (Correct)
No context found.
Jean-Yves Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In 2nd Scandinavian Logic Symposium, pages 63--92. North-Holland, 1971.
From System F to Typed Assembly Language - Greg Morrisett David (1998) (6 citations) (Correct)
No context found.
J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination de coupures dans l'analyse et la theorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63--92. North-Holland Publishing Co., 1971.
Subset Types and Partial Functions - Stump (2003) (Correct)
No context found.
J.Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In 2nd Scandinavian Logic Symposium, pages 63--92, 1971.
Intensional Polymorphism in Type-Erasure Semantics - Crary, Weirich, Morrisett (1998) (54 citations) (Correct)
No context found.
Jean-Yves Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination de coupures dans l'analyse et la theorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63--92. North-Holland Publishing Co., 1971.
Behavioural Inverse Limit λ-Models - Dezani-Ciancaglini, Ghilezan.. (2003) (Correct)
No context found.
J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In J.E.Fenstadt, editor, 2nd Scandinavian Logic Symposium, pages 63--92, Amsterdam, 1971. North-Holland.
Higher-Order Intensional Type Analysis in Type-Erasure Semantics - Weirich (2003) (3 citations) (Correct)
No context found.
Jean-Yves Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination de coupures dans l'analyse et la theorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63--92. North-Holland Publishing Co., 1971.
Two Behavioural Lambda Models - Dezani-Ciancaglini, Ghilezan (Correct)
No context found.
Jean-Yves Girard. Une extension de l'interpr etation de G odel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la th eorie des types. In J.E. Fenstadt, editor, 2nd Scandinavian Logic Symposium, pages 63--92. North-Holland, 1971.
Dependent Choice, `quote' and the Clock - Krivine (2002) (Correct)
No context found.
J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse. In: Proc. 2nd Scand. Logic Symp. p. 63-92. North Holland Pub. Co. (1971).
Lambda Models Characterizing Computational Behaviours of.. - Dezani-Ciancaglini.. (2001) (Correct)
No context found.
Jean-Yves Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In 2nd Scandinavian Logic Symposium, pages 63--92. North-Holland, 1971.
On Strong Normalization in the Intersection Type Discipline.. - Boudol (2 citations) (Correct)
No context found.
J.-Y. Girard, Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types, Second Scandinavian Logic Symposium (Ed. J.E. Fenstad), NorthHolland (1971) 63-92.
An Introduction to Polymorphic Lambda Calculus - Reynolds (1994) (4 citations) (Correct)
No context found.
Girard, J.-Y. Une Extension de l'Interpr'etation de Godel `a l'Analyse, et son Application `a l' ' Elimination des Coupures dans l'Analyse et la Th'eorie des Types. in: Proceedings of the Second Scandinavian Logic Symposium, University of Oslo, June 18-- 20,
An Elementary Fragment of Second-Order Lambda Calculus - Aehlig, Johannsen (Correct)
No context found.
J.-Y. Girard. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In J. Fenstad, editor, Proceedings of the 2nd Scandinavian Logic Symposium, pages 63-92. North-Holland, 1971.
Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002) (Correct)
No context found.
J.-Y. Girard. Une extension de l'interpr etation de G odel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la th eorie des types. In 2nd Scandinavian Logic Symposium, pages 63--92. North-Holland, 1971.
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