Gilles Barthe, Morten Heine Sørensen  Home/Search
Context Related
| di.uminho.pt/~gilles/Pape...dfpts.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: di.uminho.pt/~gilles/publis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Pure type systems make use of domain-full -abstractions x : D : M . We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free -abstractions x : M . Domain-free pure type systems have a number of advantages over both pure type systems and so-called type assignment systems (they also have some disadvantages) and have been used in theoretical developments as well as in implementations of proof-assistants. We study the basic properties of domain-free... (Update)
Context of citations to this paper: More
...weak normalization in simply and secondorder typed calculus and in certain systems with subtypes and recursive types. For a domain free [5] version of higher order typed calculus he also shows that strong normalization of all legal objects follows from weak normalization of...
.... of Barendregt s cube [5] For technical simplicity, most of their work is cast in the framework of domainfree Pure Type Systems [9], a variant of Pure Type Systems where abstractions do not carry the domain of their bound variable, i.e. are of the form x: M , in...
Cited by: More
On the role of type decorations in the Calculus of Inductive .. - Barras, Gregoire (Correct)
A Correspondence between Martin-Löf Type Theory, the.. - Kamareddine, Laan (Correct)
Variants of the Basic Calculus of Constructions - Bunder, Seldin (2004) (Correct)
Similar documents (at the sentence level):
54.2%: Domain-Free Pure Type Systems - Barthe (1993) (Correct)
Active bibliography (related documents): More All
0.7: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.4: Formalising mathematics in UTT: fundamentals and case studies - Barthe (1994) (Correct)
0.3: Course Notes in Typed Lambda Calculus - Coquand (1998) (Correct)
Similar documents based on text: More All
0.9: On the Equational Theory of Non-Normalising Pure Type Systems - Barthe, Coquand (2001) (Correct)
0.9: CPS Translations and Applications: The Cube and Beyond - Barthe (1996) (Correct)
0.8: Type-checking Injective Pure Type Systems - Barthe (1993) (Correct)
Related documents from co-citation: More All
19: Lambda Calculi with Types - Barendregt - 1992
12: translation and looping combinators in pure type systems - Coquand, Herbelin - 1994
12: Logics and Type Systems - Geuvers - 1993
BibTeX entry: (Update)
G. Barthe and M.H. Sørensen. Domain-free pure type systems. Manuscript, 1996. http://citeseer.ist.psu.edu/article/barthe93domainfree.html More
@article{ barthe00domainfree,
author = "Gilles Barthe and Morten Heine S{\o}rensen",
title = "Domain-Free Pure Type Systems",
journal = "Journal of Functional Programming",
volume = "10",
number = "5",
pages = "412--452",
year = "2000",
url = "citeseer.ist.psu.edu/article/barthe93domainfree.html" }
Citations (may not include all citations):521 Compiling with continuations (context) - Appel - 1992
419 A formulation of the simple theory of types (context) - Church - 1940
382 Lambda calculi with types - Barendregt - 1992
325 Towards a theory of type structure (context) - Reynolds - 1974
259 Combinatory Logic (context) - Curry, Feys - 1958
191 Polymorphic type inference (context) - Leivant - 1983
132 Interpr'etation fonctionelle et 'elimination des coupures da.. (context) - Girard - 1972
68 Logics and type systems - Geuvers - 1993
63 Elf: a meta-language for deductive systems (context) - Pfenning - 1994
62 Combinatory reduction systems: Introduction and survey - Klop, van Oostrom et al. - 1993
39 A Modular Proof of Strong Normalization for the Calculus of .. (context) - Geuvers, Nederhof - 1991
27 Functionality in combinatory logic (context) - Curry - 1934
24 Characterization of typings in polymorphic type discipline (context) - Giannini, Ronchi - 1988
20 translation and looping combinators in pure type systems - Coquand, Herbelin - 1994
16 Type dependence and constructive mathematics (context) - Berardi - 1990
15 CPS-translation and applications: the cube and beyond - Barthe, Hatcliff et al. - 1996
12 A notion of classical pure type system - Barthe, Hatcliff et al. - 1997
11 Extensions of pure type systems - Barthe - 1995
9 The undecidability of typability in the Lambda-Pi-Calculus (context) - Dowek - 1993
8 Logical Foundations of Computer Science (context) - Adian - 1998
8 Second-order unification and type inference for Church-style.. - Schubert - 1998
7 Electronic Notes in Theoretical Computer Science - MFPS' - 1997
4 Extension of Martin-Lof's theory of types with record types .. (context) - Betarte, Tasistro - 1997
3 A Simplification of Girard's Paradox (context) - Hurkens - 1995
1 Ronchi della Roncha (context) - Type, van Bakel et al. - 1994
1 Een nadere bewijstheoretische analyse van GSTT's (context) - computation, Terlouw - 1989
1 eme de fonctionelles recursives de Godel et son application .. (context) - Girard - 1970
1 Strong normalization from weak normalization in typed -calcu.. (context) - in, of et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.di.uminho.pt/~gilles/publis.html): More
On the Subject Reduction Property for Algebraic Type Systems - Barthe, Melliès (1997) (Correct)
A Simple Abstract Semantics for Equational Theories - Barthe (1995) (Correct)
Order-Sorted Inductive Types - Barthe (1999) (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