(Enter summary)
Abstract: In this paper, an extension of Pure Type Systems (PTS's ) to include definitions is presented
and the meta-theory of these PTS's with definitions is treated in detail. We prove that
all the properties of a PTS are preserved by the extension.
1 Introduction
A PTS does not provide the possibility to introduce a definition, i.e. an abbreviation (name) for
a larger term which can be used several times in a program or proof. A definition mechanism is
essential for practical use, and indeed... (Update)
Cited by: More
Deciding Type Equivalence in a Language with Singleton Kinds - Stone, Harper (1999)
(Correct)
PAL+: A Lambda-Free Logical Framework - Luo (2000)
(Correct)
Holes with Binding Power - Jojgov
(Correct)
Similar documents (at the sentence level):
20.1%: Normalisation in Lambda Calculus and its relation to Type Inference - Severi (1996)
(Correct)
Active bibliography (related documents): More All
0.5: Pure Type Systems without the Π-condition - Severi (1995)
(Correct)
0.2: Pure Type Systems with Definitions - Paula Severi Erik (1993)
(Correct)
0.2: Checking Algorithms for Pure Type Systems - Jutting, McKinna, Pollack (1992)
(Correct)
Similar documents based on text: More All
0.8: Expansion Postponement Problem for Pure Type Systems with.. - Jiménez (2000)
(Correct)
0.7: SCRIBE: SINGLE-LINE OR MULTIPLE-LINE TITLES GO HERE, 14 pts.. - Authors' Names Pts
(Correct)
0.6: A Verified Typechecker - Pollack (1995)
(Correct)
Related documents from co-citation: More All
14: The LEGO proof development system: A user's manual (context) - Luo, Pollack - 1992
13: Lambda Calculi with Types
- Barendregt - 1992
13: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
BibTeX entry: (Update)
Paula Severi and Erik Poll. Pure type systems with definitions. Computing science note 93/24, Eindhoven University of Technology, September 1993. http://citeseer.ist.psu.edu/severi93pure.html More
@inproceedings{ severi94pure,
author = "Paula Severi and Erik Poll",
title = "Pure Type Systems with Definitions",
booktitle = "Logical Foundations of Computer Science",
pages = "316-328",
year = "1994",
url = "citeseer.ist.psu.edu/severi93pure.html" }
Citations (may not include all citations):
382
Lambda calculi with types
- Barendregt - 1992
382
Lambda calculi with types
- Barendregt - 1992
191
LEGO proof development system: User's manual (context) - Luo, Pollack - 1992
96
A survey of the project AUTOMATH (context) - de Bruijn - 1980
95
the Extended Calculus of Constructions
- Luo - 1989
95
the Extended Calculus of Constructions
- Luo - 1989
41
Information and Computation (context) - Jutting, pure et al.
39
A modular proof of strong normalization for the calculus of .. (context) - Geuvers, Nederhof - 1991
33
Une Theorie des Constructions (context) - Coquand - 1985
26
The Coq proof assistant version (context) - Dowek - 1991
22
The Language Theory of Automath (context) - Van Daalen - 1980
6
Goal directed proof construction in type theory (context) - Helmink - 1991
2
Centre for Mathematics and Computer Science Amsterdam (context) - Klop, Systems - 1990
1
reductions and representability in the lambda calculus (context) - Klop, Barendregt et al. - 1976
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.win.tue.nl/cs/csr/csr93.html): More
A Congruence Theorem for Structured Operational Semantics.. - Baeten, Verhoef (1993)
(Correct)
Deriving the Aho-Corasick Algorithms: A Case Study into the.. - van Geldrop (1993)
(Correct)
Temporal operators viewed as predicate transformers (AB34e) - Bijlsma (1995)
(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