by Mark-oliver Stehr
In Proc. of LFM’99: Workshop on Logical Frameworks and Meta-Languages
http://www.cs.bell-labs.com/~felty/LFM99/StehrMeseguer.ps.gz
Add To MetaCart
Abstract:
Abstract. The logical and operational aspects of rewriting logic as a logical framework are illustrated in detail by representing pure type systems as object logics. More precisely, we apply membership equational logic, the equational sublogic of rewriting logic, to specify pure type systems as they can be found in the literature and also a new variant of pure type systems with explicit names that solves the problems with closure under -conversion in a very satisfactory way. Furthermore, we use rewriting logic itself to give a formal operational description of type checking, that directly serves as an ecient type checking algorithm. The work reported here is part of a more ambitious project concerned with the development in Maude [7] of a proof assistant for OCC, the open calculus of constructions, an equational extension of the calculus of constructions.
Citations
|
604
|
A formulation of the simple theory of types
– Church
- 1940
|
|
444
|
Lambda calculi with types
– Barendregt
- 1991
|
|
372
|
The Calculus of Constructions
– Coquand, Huet
- 1988
|
|
318
|
Towards a theory of type structure
– Reynolds
|
|
227
|
Interpretation Fonctionelle et Elimination des Coupures dans l'Arithmetique d'Ordre Superieure
– Girard
- 1972
|
|
153
|
General logics
– Meseguer
- 1989
|
|
149
|
LEGO Proof Development System: User’s Manual
– Luo, Pollack
- 1992
|
|
134
|
Rewriting logic as a logical and semantic framework
– Oliet, Meseguer
- 1993
|
|
88
|
AE, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming
– Benaissa, Briaud, et al.
- 1996
|
|
84
|
Specification and proof in membership equational logic
– Bouhoula, Jouannaud, et al.
|
|
71
|
Logics and Type Systems
– Geuvers
- 1993
|
|
64
|
A framework for de logics
– Harper, Honsell, et al.
- 1993
|
|
54
|
Conditional rewriting logic as a uni model of concurrency
– Meseguer
- 1992
|
|
28
|
General Logics and Logical Frameworks
– Mart'i-Oliet, Meseguer
- 1994
|
|
28
|
Pure type systems formalized
– McKinna, Pollack
- 1993
|
|
27
|
The Constructive Engine
– Huet
- 1989
|
|
27
|
Checking Algorithms for Pure Type Systems
– Jutting, McKinna, et al.
- 1994
|
|
24
|
Representing Logics in Type Theory
– Gardner
- 1992
|
|
23
|
Towards a mathematical analysis of the Coquand-Huet calculus of constructions and the other systems in Barendregt's cube
– Berardi
- 1988
|
|
22
|
Een nadere bewijstheoretische analyse van GSTT's
– Terlouw
- 1989
|
|
18
|
From to , a journey through calculi of explicit substitutions
– Lescanne
- 1994
|
|
18
|
Benthem Jutting. Typing in pure type systems
– van
- 1993
|
|
17
|
Maude: speci and programming in rewriting logic
– Clavel, Duran, et al.
- 1999
|
|
17
|
Normalisation in lambda calculus and its relation to type inference
– Severi
- 1996
|
|
13
|
Closure under alpha-conversion
– Pollack
- 1993
|
|
13
|
A verified typechecker
– Pollack
- 1995
|
|
5
|
The calculus of explicit substitutions
– Lescanne, Rouyer-Degli
- 1994
|
|
3
|
The Implementation of ALF -- a Proof Editor based on Martin-Lof's Monomorphic Type Theory with Explicit Substitutions
– Magnussen
- 1994
|
|
3
|
CINNI - A New Calculus of Explicit Substitutions and its Application to Pure Type Systems
– Stehr
- 1999
|
|
1
|
Re metalogical frameworks. To appear
– Basin, Clavel, et al.
- 1999
|
|
1
|
de Bruijn. Lambda calculus for nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
– G
- 1972
|
|
1
|
et al. The Coq Proof Assistent Reference Manual, Version 6.2.4, Coq Project
– Huet, Paulin-Mohring
- 1999
|
