Gilles Barthe  Home/Search
Context Related
| sop.inria.fr/lemme/perso...mfcs98.ps.gz 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: sop.inria.fr/lemme/perso...publis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that every functional Pure Type System may be extended to a semi-full Pure Type System. Moreover, the extension is conservative and preserves weak normalization. Based on these results, we give a new, conceptually simple type-checking algorithm for functional Pure Type Systems. 1 (Update)
Context of citations to this paper: More
...type checking. Over the last years, several authors have proposed such algorithms for some specific classes of Pure Type Systems [3, 6, 13, 16, 17, 18]. However, the situation is in our view unsatisfactory because these algorithms either impose strong restrictions on the Pure...
Cited by: More
Type-checking injective Pure Type Systems - Barthe (1998) (Correct)
Similar documents (at the sentence level):
6.3%: An Induction Principle for Pure Type Systems - Barthe, Hatcliff, Sørensen (1998) (Correct)
5.2%: Existence and Uniqueness of Normal Forms in Pure Type Systems.. - Barthe (1998) (Correct)
Active bibliography (related documents): More All
0.4: Pure Type Systems for Functional Programming (Extended Abstract) - Roorda, Jeuring (Correct)
0.3: Constructions, Inductive Types and Strong Normalization - Altenkirch (1993) (Correct)
0.2: FreshML: Programming with Binders Made Simple - Shinwell, Pitts, Gabbay (2003) (Correct)
Similar documents based on text: More All
1.1: Type-checking Injective Pure Type Systems - Barthe (1993) (Correct)
0.9: De Bruijn's Automath and Pure Type Systems - Kamareddine, Laan, Nederpelt (Correct)
0.8: Pure Type Systems with Definitions - Paula Severi Erik (1993) (Correct)
BibTeX entry: (Update)
G. Barthe. The semi-full closure of Pure Type Systems. In ???, editor, Proceedings of MFCS'98, volume ??? of Lecture Notes in Computer Science, page ??? Springer-Verlag, 1998. To appear. http://citeseer.ist.psu.edu/barthe98semifull.html More
@article{ barthe98semifull,
author = "Gilles Barthe",
title = "The Semi-Full Closure of Pure Type Systems",
journal = "Lecture Notes in Computer Science",
volume = "1450",
pages = "316--??",
year = "1998",
url = "citeseer.ist.psu.edu/barthe98semifull.html" }
Citations (may not include all citations):382 Lambda calculi with types - Barendregt - 1992
72 The Theory of LEGO: A Proof Checker for the Extended Calculu.. - Pollack - 1994
40 volume 133 of Studies in Logic and the Foundations of Mathem.. (context) - Nederpelt, Geuvers et al. - 1994
31 Henk: a typed intermediate language - Jones, Meijer - 1997
13 Normalisation in lambda calculus and its relation to type in.. - Severi - 1996
6 Checking algorithms for pure type systems - Jutting, McKinna et al. - 1994
5 A typechecker for bijective pure type systems (context) - Poll - 1993
4 Type checking injective pure type systems - Barthe - 1997
3 Typechecking in pure type systems - Pollack - 1992
Documents on the same site (http://www-sop.inria.fr/lemme/personnel/Gilles.Barthe/publis.html): More
Constructor Subtyping - Barthe, Frade (1999) (Correct)
Setoids in Type Theory - Barthe, Capretta, Pons (2000) (Correct)
A Formal Executable Semantics of the JavaCard Platform - Barthe, Dufay, Jakubiec.. (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