| Luca Cardelli. A polymorphic lambda calculus with type:type. Technical Report SRC Research Report 10, Digital Equipment Corporation, Palo Alto, California, 1986. |
.... of all types is itself a type (cf. e.g. 3] In the recent systems by Martin Lof, in Girard s systems F and F , and Coquand Huet s Calculus of Construction this assumption is carefully avoided, whereas in programming languages like those studied by Burstall and Lampson [5] or by Cardelli [6], it is explicitly used. Models of such calculi with the axiom Type: Type have been constructed using finitary retractions and or projections over certain domains [2, 11] In the present paper we present a model based on rank ordered sets for a very simple type system, the simply typed calculus, ....
L. Cardelli, "A polymorphic lambda-calculus with Type: Type", Technical Report, Syst, Res. Center, Dig. Equip. Corp., Palo Alto, CA, 1986.
....2 jAj (8U 2 jAj:X U implies a 2 U) The easy details are omitted. 2 132 = Logical System Our goal is to define a logic in which we are able to solve recursive domain equations with the aid of the fixpoint type. The approach we adopt is to set up a logic in which there is a universal type [Car86]. The elements of this type act as codes for the external or observable types. Thus a recursive type can be realised by considering the corresponding fixpoint of the universal type. In order to make things precise, we shall define a dependently typed equational logic called FIX = This is ....
....claim is immediate from the FIX = rules. 2 139 140 Categorical Semantics of the FIX 9.1 Categories for Modelling Dependent Type Theories We review a categorical structure which can be used to model dependent type theories. Some of the earliest work in this area was undertaken by Cartmell [Car86] with additional work by Taylor [Tay86] Here we shall give a presentation of categories with attributes which is based on on Pitts account in [Pit95] Further useful information can be found in [Str89] HP89] CGW89] and [Ben85] Categories with Attributes Definition 9.1.1 A category with ....
L. Cardelli. A polymorphic lambda calculus with type:type. Technical Report 10, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA, 1986.
....theory, seems related to the approach used by the NuPRL system [Con86] A main difference is that here an untyped semantics based on realisability is considered whereas we use a domain theoretic semantics. Another inspiration is Cardelli s early work on a partial type theory based on Type:Type [Car86]. The way the matching operator is used in the latest version of the COQ system seems to be closely related to our general case construct see [Gim95] 2 The partial theory See the appendix for a formal definition of the syntax and the rules for equality and type checking. 2.1 Basic concepts ....
Luca Cardelli. A polymorphic lambda-calculus with type:type. Dec technical report, DEC, 1986.
No context found.
Luca Cardelli. A polymorphic lambda calculus with type:type. Technical Report SRC Research Report 10, Digital Equipment Corporation, Palo Alto, California, 1986.
No context found.
Cardelli, Luca. A polymorphic lambda-calculus with Type:Type. SRC Research Report 10, Digital Equipment Corporation Systems Research Center, May 1, 1986.
No context found.
Cardelli L. [1986] "A polymorphic lambda-calculus with Type:Type", Preprint, Syst. Res.
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