ion is written as [x: oe]M instead of x: oe:M and application is written M(N) instead of App [x:oe] (M; N ). 1 Iterated abstractions and applications are written [x 1 : oe 1 ; : : : ; x n : oe n ]M and M(N 1 ; : : : ; N n ), respectively. The lacking type information can be inferred. The universe is written Set instead of U . The El-operator is omitted. For example the \Pi-type is described by the following constant and equality declarations (understood in every valid context): ` \Pi : (oe: Set; : (oe)Set)Set ` App : (oe: Set; : (oe)Set; m: \Pi(oe; ); n: oe) (m) ` : (oe: Set; : (oe)Set; m: (x: oe) (x))\Pi(oe; ) oe: Set; : (oe)Set; m: (x: oe) (x); n: oe ` App(oe; ; (oe; ; m); n) = m(n) Notice, how terms with free variables are represented as framework abstractions (in the type of ) and how substitution is represented as framework application (in the type of App and in the equation). In this way the burden of dealing correctly with variables, substitution, and binding is s...
|
544
|
A framework for defining logics
– Harper, Honsell, et al.
- 1993
|
|
371
|
The calculus of constructions
– COQUAND, HUET
- 1988
|
|
334
|
Category theory for computing science
– Barr, Wells
- 1990
|
|
208
|
Programming in Martin-Lof 's Type Theory: An Introduction
– Nordstrom, Petersson, et al.
- 1990
|
|
204
|
Constructive Mathematics and Computer Programming
– Martin-Löf
- 1983
|
|
200
|
Foundations of Constructive Mathematics
– Beeson
- 1985
|
|
127
|
Higher-order modules and the phase distinction
– Harper, Mitchell, et al.
- 1990
|
|
108
|
An intuitionistic theory of types: predicative part
– Martin-Löf
- 1975
|
|
103
|
Introduction to Higher-Order Categorical Logic
– Lambek, Scott
- 1986
|
|
102
|
On the type structure of Standard ML
– Harper, Mitchell
- 1992
|
|
94
|
The ALF proof editor and its proof engine
– Magnusson, Nordström
- 1994
|
|
94
|
Intuitionistic Type Theory (Bibliopolis
– Martin-Lof
- 1984
|
|
90
|
Inductively defined types
– Coquand, Paulin
- 1990
|
|
77
|
Categorical logic
– Pitts
- 2000
|
|
67
|
Categories for types
– Crole
- 1994
|
|
58
|
Implementing Mathematics with the Nuprl Development System
– Constable, Allen, et al.
- 1986
|
|
54
|
Metamathematical investigations of a calculus of constructions
– Coquand
- 1990
|
|
45
|
Extracting F ! 's programs from proofs in the calculus of constructions
– Paulin-Mohring
- 1989
|
|
40
|
The theory of constructions : Categorical semantics and topos-theoretic models
– Hyland, Pitts
- 1988
|
|
39
|
Categorical type theory
– Jacobs
- 1991
|
|
37
|
Extensional concepts in intensional type theory
– Hofmann
- 1995
|
|
36
|
Locally cartesian closed categories and type
– Seely
- 1984
|
|
26
|
Internal type theory
– Dybjer
- 1995
|
|
25
|
On the interpretation of type theory in locally cartesian closed categories
– Hofmann
- 1994
|
|
24
|
A category-theoretic account of program modules
– Moggi
- 1989
|
|
24
|
Semantics of Type Theory
– Streicher
- 1991
|
|
22
|
Typed operational semantics
– Goguen
- 1995
|
|
19
|
A groupoid model refutes uniqueness of identity proofs
– Hofmann, Streicher
- 1994
|
|
18
|
Categorical Abstract Machines for Higher-Order Lambda Calculi
– Ritter
- 1992
|
|
16
|
Semantical Investigations into Intensional Type Theory
– Streicher
- 1993
|
|
15
|
Computation and Reasoning
– Luo
- 1994
|
|
15
|
On functors expressible in the polymorphic typed lambda calculus
– Reynolds, Plotkin
- 1990
|
|
15
|
The Independence of Peano’s Fourth Axiom from MartinLöf’s Type Theory without Universes
– Smith
- 1988
|
|
13
|
Program Verification in Synthetic Domain Theory
– Reus
- 1995
|
|
12
|
Recursive Domains, Indexed Category Theory, and Polymorphism
– Taylor
- 1986
|
|
11
|
Domain interpretations of Martin-Lof's partial type theory
– Palmgren, Stoltenberg-Hansen
- 1990
|
|
10
|
Substitution up to isomorphism
– Curien
- 1993
|
|
10
|
A uniform approach to type theory
– Huet
- 1988
|
|
9
|
Categorical Models of Polymorphism
– Asperti, Martini
- 1992
|
|
8
|
Proving strong normalization of CC by modifying realizability semantics
– Altenkirch
- 1993
|
|
6
|
Une s'emantique cat'egorique des types d'ependants. Application au calcul des constructions. Th`ese de doctorat, Universit'e de Paris VII
– Ehrhard
- 1988
|
|
5
|
Conservativity of equality reflection over intensional type theory
– Hofmann
- 1995
|
|
4
|
Comprehension categories and the semantics of type theory
– Jacobs
- 1993
|
|
3
|
Deliverables: An approach to program semantics in constructions
– Burstall, McKinna
- 1990
|
|
3
|
A simple model for the theory of constructions
– Lamarche
- 1989
|
|
3
|
Dependence and independence results for (impredicative) calculi of dependent types
– Streicher
- 1992
|
|
2
|
Categorical and algebraic aspects of Martin-Lof type theory
– Obtulowicz
- 1989
|
|
1
|
A non-type-theoretic account of Martin-Lof's types
– Allen
- 1987
|
|
1
|
Semantics of Dependent Types 51
– Syntax
- 1996
|
|
1
|
Generalized Algebraic Theories and Contextual
– Cartmell
- 1978
|
