T.Coquand, G.Huet: Constructions: a higher order proof system for mechanizing mathematics, Technical report 401, INRIA, May 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Typeful Programming - Cardelli (1989) (77 citations) (Correct)
....interfaces) they can be used as units of compilation. The conceptual framework for typeful programming is to be found in various theories of typed ) calculi [Reynolds 74] Martin LOf 80] in particular, we were inspired by Girard s system Fro [Girard 71] and by the theory of Constructions [Coquand Huet 85] Hyland Pitts 87] This collection of theories, generically referred to as type theory, studies very expressive type structures in the framework of constructive logic. More often than not, these theoretical structures have direct correspondence in programming constructs; this is not accidental, ....
T.Coquand, G.Huet: Constructions: a higher order proof system for mechanizing mathematics, Technical report 401, INRIA, May 1985.
Typeful Programming - Cardelli (1993) (77 citations) (Correct)
....can be used as units of compilation. 2.2. Theory and practice The conceptual framework for typeful programming is to be found in various theories of typed l calculi [Reynolds 74] Martin Lf 80] in particular, we were inspired by Girard s system Fw [Girard 71] and by the theory of Constructions [Coquand Huet 85] Hyland Pitts 87] This collection of theories, generically referred to as type theory, studies very expressive type structures in the framework of constructive logic. More often than not, these theoretical structures have direct correspondence in programming constructs; this is not accidental, ....
T.Coquand, G.Huet: Constructions: a higher order proof system for mechanizing mathematics, Technical report 401, INRIA, May 1985.
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (90 citations) (Correct)
....much further than most existing languages. We have been careful to maintain the ability to type check these features easily. However, this is not the whole picture. Many interesting type systems lie well above our diagram [Reynolds 85] These include the Coquand and Huet theory of constructions [Coquand 85] Martin L f s dependent types [MartinL f 80] Burstall and Lampson s language Pebble [Burstall 84] and MacQueen s language DL [MacQueen 84b] There are benefits in going even higher up: Pebble and DL have a more general treatment of parametric modules; dependent types have an almost unlimited ....
T.Coquand, G.Huet: Constructions: a higher order proof system for mechanizing mathematics, Technical report 401, INRIA, May 1985.
Typeful Programming - Luca Cardelli Digital (1989) (77 citations) (Correct)
No context found.
T.Coquand, G.Huet: Constructions: a higher order proof system for mechanizing mathematics, Technical report 401, INRIA, May 1985.
The Quest Language and System - Cardelli (1994) (3 citations) (Correct)
No context found.
T.Coquand, G.Huet: Constructions: a higher order proof system for mechanizing mathematics, Technical report 401, INRIA, May 1985.
A Polymorphic lambda-calculus with Type:Type - Cardelli (1986) (4 citations) (Correct)
No context found.
T.Coquand, G.Huet: Constructions: a higher order proof system for mechanizing mathematics, Technical Report 401, INRIA, May 1985.
Rapport de Post-Doc - Vers La Certication (Correct)
No context found.
T. Coquand , G. Huet: Constructions: A higher order proof system for mechanizing mathematics. EUROCAL'85, 1985. 19
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