Robert Harper and Robert Pollack. Type checking, universe polymorphism, and typical ambiguity in the Calculus of Constructions. In TAPSOFT '89, Proceedings of the International Joint Conference on Theory and Practice in Software Development, Barcelona, Spain, pages 241--256. Springer-Verlag LNCS 352, March 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Semi-Functional Implementation of a Higher-Order Logic.. - Elliott, Pfenning (1990) (30 citations) (Correct)
....of varbind term ( Abstractions ) and varbind = Varbind of string term ( Variable binders , Type ) 30 In the implementation of the term language and the type checker, we have two constants type and pi. And, yes, type is a type, though this could be avoided by introducing universes (see [16]) without any changes to the code of the uni er. As is customary, we use A B as an abbreviation for x : A: B if x does not occur free in B. Also, however, x : A: B is an abbreviation for the application pi A ( x : A: B) In our formulation, then, the constant pi has type A : type: A type) ....
Robert Harper and Robert Pollack. Type checking, universe polymorphism, and typical ambiguity in the Calculus of Constructions. In TAPSOFT '89, Proceedings of the International Joint Conference on Theory and Practice in Software Development, Barcelona, Spain, pages 241-256. Springer-Verlag LNCS 352, March 1989.
A Semi-Functional Implementation of a Higher-Order Logic.. - Elliott (1991) (30 citations) (Correct)
....Abst of varbind term ( Abstractions ) and varbind = Varbind of string term ( Variable binders , Type ) In the implementation of the term language and the type checker, we have two constants type and pi. And, yes, type is a type, though this could be avoided by introducing universes (see [16]) without any changes to the code of the unifier. As is customary, we use A B as an abbreviation for Pix : A: B if x does not occur free in B. Also, however, Pix : A: B is an abbreviation for the application pi A (x : A: B) In our formulation, then, the constant pi has type PiA : type: A ....
Robert Harper and Robert Pollack. Type checking, universe polymorphism, and typical ambiguity in the Calculus of Constructions. In TAPSOFT '89, Proceedings of the International Joint Conference on Theory and Practice in Software Development, Barcelona, Spain, pages 241--256. Springer-Verlag LNCS 352, March 1989.
Unification and Anti-Unification in the Calculus of Constructions - Pfenning (1991) (31 citations) (Correct)
....for the presentation of the ideas. There are currently a number of closely related formulations of the Calculus of Constructions. The choice of formalization is mainly a matter of economy of presentation of the inference rules and the various algorithms. The formulation we use here is taken from [11], but closely related formulations appear throughout the literature. We use M;N for terms in general and u; v and x; y; z for variables, where the occurrences of u in [u:M ] N and fu:MgN are binding occurrences. We also assume an fixed signature Sigma assigning types to constants, which are ....
Robert Harper and Robert Pollack. Type checking, universe polymorphism, and typical ambiguity in the Calculus of Constructions. In TAPSOFT '89, Proceedings of the International Joint Conference on Theory and Practice in Software Development, Barcelona, Spain, pages 241--256. Springer-Verlag LNCS 352, March 1989.
Unification and Anti-Unification in the Calculus of.. - Frank Pfenning School (1991) (31 citations) (Correct)
No context found.
Robert Harper and Robert Pollack. Type checking, universe polymorphism, and typical ambiguity in the Calculus of Constructions. In TAPSOFT '89, Proceedings of the International Joint Conference on Theory and Practice in Software Development, Barcelona, Spain, pages 241--256. Springer-Verlag LNCS 352, March 1989.
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