Thorsten Altenkirch  Home/Search
Context
Related
| tcs.informatik.unimuenchen....PHD.ps.Z cs.chalmers.se/pub/users/al...diss.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tcs.informatik.unimuench...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This thesis contains an investigation of Coquand's Calculus of Constructions, a basic impredicative Type Theory. We review syntactic properties of the calculus, in particular decidability of equality and type-checking, based on the equalityas -judgement presentation. We present a set-theoretic notion of model, CCstructures, and use this to give a new strong normalization proof based on a modification of the realizability interpretation. An extension of the core calculus by inductive types is... (Update)
Similar documents (at the sentence level):
8.1%: A Formalization of the Strong Normalization Proof for System F.. - Altenkirch (1993) (Correct)
Active bibliography (related documents): More All
0.6: Impredicative Representations of Categorical Datatypes - Altenkirch (1994) (Correct)
0.5: Consistency in ALF - Altenkirch (1994) (Correct)
0.5: Specifications, Algorithms, Axiomatisations and Proofs - Commented .. - Huet (1995) (Correct)
Similar documents based on text: More All
0.2: A realizability interpretation of Martin-Löf's type theory - Coquand (Correct)
0.1: A General Notion of Realizability - Birkedal (2000) (Correct)
0.1: Proving Strong Normalization of CC by Modifying.. - Thorsten Altenkirch.. (1994) (Correct)
BibTeX entry: (Update)
@misc{ altenkirch-constructions,
author = "Thorsten Altenkirch",
title = "Constructions, Inductive Types and Strong Normalization",
url = "citeseer.ist.psu.edu/altenkirch93construction.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1984
729 The Lambda Calculus - Its Syntax and Semantics (context) - Barendregt - 1984
382 Lambda calculi with types - Barendregt - 1992
268 Proofs and Types (context) - Girard, Lafont et al. - 1989
266 Information and Computation (context) - Coquand, Huet et al. - 1988
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
191 The LEGO proof development system: A user's manual (context) - Luo, Pollack - 1992
143 The Coq Proof Assistant User's Guide (context) - Dowek - 1991
139 Type systems for programming languages (context) - Mitchell - 1990
101 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
96 A survey of the project AUTOMATH (context) - de Bruijn - 1980
95 An Extended Calculus of Constructions - Luo - 1990
79 Pattern matching with dependent types (context) - Coquand - 1992
73 Is there a use for linear logic (context) - Wadler - 1991
73 Inductively defined types (context) - Coquand, Paulin - 1989
64 Metamathematical investigations of a calculus of constructio.. (context) - Coquand - 1990
50 Polymorphism is not set-theoretic (context) - Reynolds - 1984
50 A Categorical Programming Language (context) - Hagino - 1987
45 Synthesis of ML programs in the system Coq (context) - Paulin-Mohring, Werner - 1993
43 An inverse of the evaluation functional for typed -calculus (context) - Berger, Schwichtenberg - 1991
41 Inductive sets and families in Martin-Lof's type theory and .. - Dybjer - 1991
39 Do-it-yourself type theory (context) - Backhouse, Chisholm et al. - 1989
39 Fixed point theorems and semantics: A folk tale (context) - Lassez, Nguyen et al. - 1982
33 Une th'eorie des constructions (context) - Coquand - 1985
32 Pure type systems formalized - McKinna, Pollack - 1993
30 The theory of constructions: categorical semantics and topos.. (context) - Hyland, Pitts - 1989
29 Correctness and Completeness of a Categorical Semantics of t.. (context) - Streicher - 1989
25 and Jean-Jacques L'evy (context) - Abadi, Cardelli et al. - 1990
23 The new implementation of ALF (context) - Magnusson - 1992
21 Inductive Definition in Type Theory (context) - Mendler - 1988
21 A formalization of the strong normalization proof for System.. - Altenkirch - 1993
18 the undecidability of partial polymorphic type reconstructio.. - Pfenning - 1992
16 Programming in Martin-Lof Type Theory (context) - Nordstrom, Petersson et al. - 1990
14 A proof of strong normalization for the theory of constructi.. - Coquand, Gallier - 1990
13 Inductive definitions in the system Coq; rules and propertie.. (context) - Paulin-Mohring - 1993
12 Semantics of Type Theory (context) - Streicher - 1991
12 Modified realizability toposes and strong normalization proo.. - Hyland, Ong - 1993
11 A unifying theory of dependent types: the schematic approach (context) - Luo - 1992
10 Categorical Abstract Machines for Higher-Order Typed Lambda .. (context) - Ritter - 1992
10 University of Stockholm (context) - Martin-Lof, of et al. - 1971
9 Elimination of extensionality and quotient types in Martin-L.. (context) - Hofmann - 1993
8 the syntax of Martin-Lof's type theories (context) - Troelstra - 1987
7 Residual theory in -calculus: A complete Gallina development (context) - Huet - 1993
7 A proof of normalization for simply typed lambda calculus wr.. (context) - Coquand - 1992
4 A normalization proof for an impredicative type system with .. (context) - Werner - 1992
4 Girard's normalisation proof in LEGO (context) - Berardi - 1991
4 Katholieke Universiteit Nijmegen (context) - Geuvers, Type et al. - 1993
3 Typechecking in pure type systems - Pollack - 1992
3 Yet another strong normalization proof for the Calculus of C.. (context) - Altenkirch - 1993
3 Formal development of functional programs in type theory ---.. (context) - Hofmann - 1992
3 Katholieke Universiteit Nijmegen (context) - Jacobs, Theory - 1991
2 Impredicative representations of categorical datatypes - Altenkirch - 1990
2 Confluent reductions (context) - Huet - 1980
2 The extended calculus of constructions with inductive types (context) - Ore - 1992
2 mechanical normalization and intuitionistic model constructi.. (context) - Coquand, Dybjer - 1993
1 to appear in FACS (context) - Dybjer, Draft - 1992
1 Universes and a general notion of simultanous inductiverecur.. (context) - Dybjer - 1992
1 Strong Normalization for a Type Theory with Inductive Data T.. (context) - Goguen - 1993
1 Extension of the lego implementation by a tactic for inducti.. (context) - Jones, LEGO - 1993
1 Talk given at the BRA Types workshop in Nijmegen (context) - Dowek - 1993
1 Theory of constructions is not conservative over higher orde.. (context) - Geuvers - 1989
1 An algorithm for deciding conversion in type theory (context) - Coquand - 1991
1 Experiment on the implementation of a breadth-first-search a.. (context) - Hofmann, in - 1993
1 Revised version of PhD thesis (context) - Fu, type et al. - 1992
Documents on the same site (http://www.tcs.informatik.uni-muenchen.de/publikationen/index.html): More
A note on the monotone complexity of 2-REF - Clote (1995) (Correct)
Cutting Planes, Connectivity, and Threshold Logic - Buss, Clote (1996) (Correct)
Monotone (Co)Inductive Types and Positive Fixed-Point Types - Matthes (1998) (Correct)
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