Gilles Barthe, Fairouz Kamareddine, Alejandro Ríos  Home/Search
Context
Related
| di.uminho.pt/~gilles/Pape...alp97.ps.gz cee.hw.ac.uk/~fairouz/p...alphoa97.ps cs.chalmers.se/pub/users/g...alp97.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: cee.hw.ac.uk/~fairouz/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The \Delta-calculus is a -calculus with a control-like operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce \Deltaexp, an explicit substitution calculus for \Delta, and study its properties. In particular, we show that \Deltaexp preserves strong normalisation, which provides us with the first example --moreover a very natural one indeed-- of explicit substitution calculus which is not structure-preserving and has the preservation of... (Update)
Similar documents (at the sentence level):
25.8%: Explicit Substitutions for Control Operators - Barthe, Kamareddine, Ríos (1997) (Correct)
Active bibliography (related documents): More All
0.3: Characterizing the Paralation Model using Dynamic Assignment - Eric Freeman (Correct)
0.3: Label-Selective Lambda-Calculus Syntax and Confluence - Aït-Kaci, Garrigue (1995) (Correct)
0.2: Calculi of Generalised beta-Reduction and Explicit Substitutions.. - Wells (1998) (Correct)
Similar documents based on text: More All
0.4: Extending a lambda-calculus with Explicit Substitution which .. - Kamareddine, al. (1993) (Correct)
0.3: A Semantics for a fine λ-calculus with de Bruijn.. - Kamareddine, Nederpelt (1997) (Correct)
0.2: The Barendregt Cube with Definitions and Generalised.. - Bloo, Kamareddine.. (1997) (Correct)
BibTeX entry: (Update)
@misc{ barthe-explicit,
author = "Gilles Barthe and Fairouz Kamareddine and Alejandro Ríos",
title = "Explicit substitutions for the lambda Delta-calculus",
url = "citeseer.ist.psu.edu/136301.html" }
Citations (may not include all citations):729 The Lambda Calculus : Its Syntax and Semantics (context) - Barendregt - 1984
521 Compiling with Continuations (context) - Appel - 1992
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
167 Natural Deduction: A proof theoretical study (context) - Prawitz - 1965
137 Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
134 calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
110 A formulae-as-types notion of control - Griffin - 1990
80 The Scheme Programming Language (context) - Dybvig - 1987
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
73 a calculus of explicit substitutions which preserves strong .. (context) - Benaissa, Briaud et al. - 1996
68 Confluence properties of weak and strong calculi of explicit.. - Curien, Hardin et al. - 1996
66 Continuation semantics in typed lambda-calculi - Meyer, Wand - 1985
65 The implementation of ALF: a proof editor based on Martin-Lo.. - Magnusson - 1994
62 Combinatory reduction systems: Introduction and survey - Klop, van Oostrom et al. - 1993
61 Higher-order unification via explicit substitutions - Dowek, Hardin et al. - 1995
60 Extracting Constructive Contents from Classical Proofs (context) - Murthy - 1990
50 a la de Bruijn with explicit substitutions (context) - Kamareddine, R'ios et al. - 1995
31 Theoretical Computer Science (context) - Kamareddine, Nederpelt et al. - 1996
29 Handbook of Logic in Computer Science (context) - Klop, systems - 1992
24 the intuitionistic force of classical search - Ritter, Pym et al. - 1996
22 Confluence Results for the Pure Strong Categorical Logic CCL.. (context) - Hardin - 1989
19 Preservation of Strong Normalisation for Explicit Substituti.. - Bloo - 1995
17 Combinatory reduction systems with explicit substitutions th.. - Bloo, Rose - 1996
12 A notion of classical pure type system - Barthe, Hatcliff et al. - 1997
12 Proof representation in type theory: State of the art (context) - noz - 1996
11 Explicit substitution: On the edge of strong normalisation - Bloo, Geuvers - 1996
11 Delta calculus - Rehof, Sorensen - 1994
3 This article was processed using the L a T E X macro package.. (context) - Steele, The et al. - 1984
2 Elimination des coupures dans les sequents qu'on calcule (context) - Herbelin - 1994
1 Ecole Normal Superieure de Lyon (context) - Audebaud, for et al. - 1994
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