Gilles Barthe, John Hatcliff, Morten Heine Sørensen  Home/Search
Context Related
| di.uminho.pt/~gilles/Pap...mfps97.ps.gz cwi.nl/pub/gilles/mfps97.ps.Z cs.chalmers.se/pub/users/...mfps97.ps.Z 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) From: math.jussieu.fr/~fer...ftp.cwi.nl (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we nevertheless establish that it is possible to define a notion of classical pure type system (CPTS) which has suitable properties for systems of dependent types. We do not claim that CPTSs provide the final answer as to the choice of formalism for classical -calculi; however, CPTSs generalize sufficiently many of the existing calculi to be considered as a valid framework for the study of classical -calculi. (Update)
Context of citations to this paper: More
...for the underlying pure type systemusing CPS translations from the extended systems to the underlying pure type systems. The authors [7] study a more general notion of classical pure type system, whereby most logical pure type systems, including those with dependent types,...
.... the computational content of classical proofs where CPS translations are a frequently employed tool, see, e.g. [13, 33, 38, 39, 34, 12, 4, 42, 24, 25, 35, 36, 6]. Inductive and coinductive types, see, e.g. 31, 29, 20, 15, 40] are syntactic representations for initial...
Cited by: More
Explicit Provability And Constructive Semantics - Artemov (2001) (Correct)
Weak and Strong Normalization, K-redexes, and First-Order Logic - Neergaard (1999) (Correct)
CPS Translating Inductive and Coinductive Types (Extended.. - Barthe, Uustalu (2002) (Correct)
Active bibliography (related documents): More All
4.4: A Notion of Classical Pure Type System - Barthe, Hatcliff, al. (1997) (Correct)
2.7: CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996) (Correct)
0.8: Expanding the Cube - Barthe (1999) (Correct)
Similar documents based on text: More All
1.1: Domain-Free Pure Type Systems - Barthe (1993) (Correct)
0.6: Weak Normalization Implies Strong Normalization in.. - Barthe, Hatcliff.. (1997) (Correct)
0.6: On the Equational Theory of Non-Normalising Pure Type Systems - Barthe, Coquand (2001) (Correct)
Related documents from co-citation: More All
9: Compiling with Continuations (context) - Appel - 1992
9: Lambda Calculi with Types - Barendregt - 1992
8: CPS-translation and applications: the cube and beyond - Barthe, Hatcliff et al. - 1996
BibTeX entry: (Update)
G. Barthe, J. Hatcliff, and M.H. Sørensen. A notion of classical pure type system. In Proceedings of MFPS'97, volume 6 of Electronic Notes in Theoretical Computer Science, 1997. http://citeseer.ist.psu.edu/article/barthe97notion.html More
@inproceedings{ barthe97notion,
author = "Gilles Barthe and John Hatcliff and Morten Heine S{\o}rensen",
title = "A Notion of Classical Pure Type Systems",
booktitle = "Mathematical foundations of programming semantics",
volume = "6",
publisher = "Elsevier",
editor = "S. Brookes and M. Main and A. Melton and M. Mislove",
year = "1997",
url = "citeseer.ist.psu.edu/article/barthe97notion.html" }
Citations (may not include all citations):382 Lambda calculi with types - Barendregt - 1992 ACM
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975 ACM
259 Combinatory Logic (context) - Curry, Feys - 1958
233 The formulae-as-types notion of construction (context) - Howard - 1980
191 LEGO proof development system: User's manual (context) - Luo, Pollack - 1992
174 Combinatory reduction systems (context) - Klop, van Oostrom et al. - 1993 ACM
167 Natural Deduction: A proof theoretical study (context) - Prawitz - 1965
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1993 ACM DBLP
134 calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
126 Higher-order critical pairs (context) - Nipkow - 1991 DBLP
116 Ideas and results of proof theory (context) - Prawitz - 1970
110 A formulae-as-types notion of control - Griffin - 1990 DBLP
86 Implementing Mathematics with the NuPrl Development System (context) - Constable, Allen et al. - 1986
84 Computation and Reasoning: A Type Theory for Computer Scienc.. (context) - Luo - 1994
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987 ACM DBLP
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991 ACM DBLP
68 Logics and Type Systems - Geuvers - 1993
66 Continuation semantics in typed lambda-calculi - Meyer, Wand - 1985
64 Metamathematical investigations of a calculus of constructio.. (context) - Coquand - 1990
62 Combinatory reduction systems: Introduction and survey - Klop, van Oostrom et al. - 1993 ACM DBLP
60 Extracting Constructive Contents from Classical Proofs (context) - Murthy - 1990
57 Confluence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
56 Explicit polymorphism and CPS conversion - Harper, Lillibridge - 1993 ACM DBLP
46 CS Conversion: A Syntactic theory of Control and State in Im.. (context) - Felleisen, of - 1987
41 An evaluation semantics for classical proofs (context) - Murthy - 1991 DBLP
40 Strong normalization for second order classical natural dedu.. (context) - Parigot - 1993 DBLP
35 Typing first-class continuations in ML - Lillibridge, Harper - 1993 ACM DBLP
34 Higher-order rewrite systems and their confluence - Mayr, Nipkow - 1994 ACM DBLP
31 Confluence and Normalisation for Higher-Order Rewriting (context) - van Raamsdonk - 1996
31 Weak orthogonality implies confluence: the higher-order case (context) - van Oostrom, van Raamsdonk - 1994 ACM
25 A modular proof of strong normalisation for the Calculus of .. (context) - Geuvers, Nederhof - 1991
24 Domain-free pure type systems - Barthe, Sorensen - 1996 ACM DBLP
24 LISP and Symbolic Computation (context) - Reynolds, of - 1993
24 A computational analysis of Girard's translation and LC (context) - Murthy - 1992 DBLP
20 translation and looping combinators in pure type systems - Coquand, Herbelin - 1994
20 Expression Reduction Systems - Khasidashvili - 1990
18 volume 121 of Studies In Logic And The Foundations Of Mathem.. (context) - Troelstra, van Dalen et al. - 1988
16 A cps-translation of the ¯-calculus (context) - de Groote - 1994
16 Type dependence and Constructive Mathematics (context) - Berardi - 1990
15 Context-sensitive conditional expression reduction systems - Khasidashvili, van Oostrom - 1995 DBLP
15 CPS-translation and applications: the cube and beyond - Barthe, Hatcliff et al. - 1997
14 Extracting constructive content from classical proofs via co.. - Barbanera, Berardi - 1993
14 Syntactic translations and provably recursive functions (context) - Leivant - 1985 DBLP
13 Normalization theorems for full first order classical natura.. (context) - Stalmarck - 1991 ACM DBLP
13 A constructive logic behind the catch and throw mechanism (context) - Nakano - 1994 DBLP
13 A symmetric lambda calculus for classical program extraction (context) - Barbanera, Berardi - 1996 ACM DBLP
13 A short and flexible proof of strong normalisation for the C.. (context) - Geuvers - 1995
13 Strong normalization in type systems: a model theoretic appr.. (context) - Terlouw - 1995 DBLP
12 The Coq proof assistant user's guide (context) - Cornes, Courant et al. - 1995
11 Delta calculus - Rehof, Sorensen - 1994
11 S'equents qu'on calcule (context) - Herbelin - 1995
10 Finding computational contents in classical proofs (context) - Constable, Murthy - 1990
10 Normalization and excluded middle (context) - Seldin - 1989
10 A simple calculus of exception handling - de Groote - 1995 ACM DBLP
10 and pseudo-classical type systems: A-translation at work (context) - Murthy, hierachies - 1992
9 volume 127 of Mathematical Centre Tracts (context) - Klop, Systems - 1980
9 Continuations and simple types: A strong normalization resul.. (context) - Barbanera, Berardi - 1992
8 Laboratory for the Foundations of Computer Science (context) - Altenkirch, inductive et al. - 1994
8 A symmetric lambda calculus (context) - Barbanera, Berardi - 1994
7 Proof-terms for classical and intuitionistic logic (context) - Ritter, Pym et al. - 1996
7 the adequacy of representing higher order intuitionistic log.. (context) - Tonino, Fujita - 1992
6 Witness extraction in classical logic through normalization (context) - Barbanera, Berardi - 1993 ACM
5 A generic proof of strong normalisation for pure type system.. (context) - Mellies, Werner - 1996
5 A reduction rule for the Peirce formula (context) - Hirokawa, Komori et al. - 1994
4 Towards a classical linear -calculus (context) - Bierman - 1996
4 A constructive valuation interpretation for classical logic .. (context) - Barbanera, Berardi - 1992 ACM DBLP
4 A strong normalization result for classical logic - Barbanera, Berardi - 1995 DBLP
3 Strong normalisation for terms of the theory of construction.. (context) - Pottinger - 1987
2 Beyond BHK (context) - Rezus - 1993
2 A simple set-theoretic semantics for the Calculus of Constru.. (context) - Stefanova, Geuvers - 1996
2 Classical proofs: Lambda calculus methods in elementary proo.. (context) - Rezus - 1991
2 Conservativity between logics and typed -calculi (context) - Geuvers - 1993
2 Center for the Study of Language and Information (context) - Ungar, cut-elimination et al. - 1992
2 Sound and complete axiomatisations of call-by-balue control .. (context) - Hofmann - 1995
1 is not conservative over p (context) - Ruys - 1991
1 Excluded middle and definite descriptions in the theory of c.. (context) - Seldin - 1991
1 Available by ftp from ftp (context) - Altenkirch, Gaspes et al. - 1994
1 Definite descriptions and exluded middle in the theory of co.. (context) - Pottinger - 1989
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