Pure Type Systems with Definitions

In this paper, an extension of Pure Type Systems (PTS's) with definitions is presented. We prove this extension preserves many of the properties of PTS's. The main result is a proof that for many PTS's, including the Calculus of Constructions, this extension preserves strong normalisation.

[1]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[2]  Jan A. Bergstra,et al.  Degrees, reductions and representability in the lambda calculus , 1976 .

[3]  F. Dick.  A survey of the project Automath , 1980 .

[4]  de Ng Dick Bruijn,et al.  A survey of the project Automath , 1980 .

[5]  Roel C. de Vrijer.  A Direct Proof of the Finite Developments Theorem , 1985, J. Symb. Log..

[6]  T. Coquand.  Une théorie des constructions , 1985 .

[7]  Thierry Coquand,et al.  An Analysis of Girard's Paradox , 1986, LICS.

[8]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[9]  Zhaohui Luo,et al.  ECC, an extended calculus of constructions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[10]  D. de Reus,et al.  An implementation model for GOOD , 1991 .

[11]  van de E Edwin Sluis,et al.  Performance analysis of VLSI programs , 1991 .

[12]  Leen Helmink,et al.  Goal directed proof construction in type theory , 1991 .

[13]  J. Zwiers,et al.  Assertional Data Reification Proofs: Survey and Perspective , 1991 .

[14]  Erik Poll,et al.  Some categorical properties for a model for second order lambda calculus with subtyping , 1991 .

[15]  Dick Alstein,et al.  Dynamic reconfiguration in distributed hard real-time systems , 1991 .

[16]  Mark-Jan Nederhof,et al.  Modular proof of strong normalization for the calculus of constructions , 1991, Journal of Functional Programming.

[17]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[18]  Gerard Zwaan,et al.  A taxonomy of keyword pattern matching algorithms , 1992 .

[19]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[20]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[21]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part I. System concepts , 1993 .

[22]  L. S. van Benthem Jutting.  Typing in Pure Type Systems , 1993, Inf. Comput..

[23]  P. D. Moerland,et al.  Exercises in multiprogramming , 1993 .

[24]  van Dt Diederik Daalen.  The Language Theory of Automath: Chapter I, Sections 1–5 (Introduction) , 1994 .

[25]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..