Delia Kesner  Home/Search
Context Related
| lri.fr/LRI/articles/ke...explicit.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: ps.unisb.de/ccl/publicati...1998 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper studies confluence of extensional and non-extensional -calculi with explicit substitutions, where extensionality is interpreted by j-expansion. For that, we propose a scheme for explicit substitutions which describes those abstract properties that are sufficient to guarantee confluence. Our method makes it possible to treat at the same time many well-known calculi such as oe , oe * , OE , s , AE , f , d and dn . Keywords: functional programming, -calculi, explicit... (Update)
Context of citations to this paper: More
...operation, executed by operators that are external to the language. In calculi with explicit substitutions, as, for instance, [1, 5, 8, 27], and the pattern calculus TPCES that we propose here, the substitution is internalized and handled by symbols and reduction rules...
...executed by operators that are external to the language. In calculi with explicit substitutions, as, for instance, [ACCL91, BR96, Kes, BBLRD96], and the pattern calculus TPCES that we propose here, the substitution is internalized and handled by symbols and reduction...
Cited by: More
From Higher-Order to First-Order Rewriting - Bonelli, Kesner, Ríos (Correct)
Pattern Matching as Cut Elimination - Cerrito, Kesner (1999) (Correct)
Similar documents (at the sentence level):
5.1%: Confluence Properties of Extensional and Non-Extensional.. - Kesner (1996) (Correct)
Active bibliography (related documents): More All
2.7: Lambda-Calculi With Explicit Substitutions And Weak.. - Ferreira, Kesner, Puel (1996) (Correct)
1.1: lambda-calculi with explicit substitutions and composition.. - Ferreira, al. (1996) (Correct)
0.9: Explicit Substitutions for Objects and Functions - Kesner, López (1998) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Reasoning about Redundant Patterns - Kesner (1997) (Correct)
0.2: Rewriting with Extensional Polymorphic lambda-calculus - Di Cosmo, Kesner (1996) (Correct)
0.2: Combining First Order Algebraic Rewriting Systems, Recursion .. - Di Cosmo, Kesner (1994) (Correct)
Related documents from co-citation: More All
4: a calculus of explicit substitutions which preserves strong normalisation (context) - Benaissa, Briaud et al. - 1995
4: Orderings for term-rewriting systems (context) - Dershowitz - 1982
4: Rewrite systems - Dershowitz, Jouannaud - 1990
BibTeX entry: (Update)
D. Kesner. Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. TCS. To appear. http://citeseer.ist.psu.edu/10783.html More
@article{ kesner00confluence,
author = "Delia Kesner",
title = "Confluence of extensional and non-extensional lambda-calculi with explicit substitutions",
journal = "Theoretical Computer Science",
volume = "238",
number = "1-2",
pages = "183-220",
year = "2000",
url = "citeseer.ist.psu.edu/10783.html" }
Citations (may not include all citations):116 Ideas and results in proof theory (context) - Prawitz - 1971
101 Lambda-calculus notation with nameless dummies (context) - de Bruijn - 1972
89 Termination on term rewriting: interpretation and type elimi.. - Zantema - 1994
61 Higher-order unification via explicit substitutions - Dowek, Hardin et al. - 1995
50 a la de bruijn with explicit substitutions (context) - Kamareddine, R'ios et al. - 1995
46 On mints' reductions for ccc-calculus (context) - Akama - 1993
40 The Virtues of Eta-expansion - Jay, Ghani - 1995
35 a journey through calculi of explicit substitutions - Lescanne, to - 1994
31 Weak orthogonality implies confluence: the higher-order case (context) - van Oostrom, van Raamsdonk - 1994
25 and Jean-Jacques L'evy (context) - Abadi, Cardelli et al. - 1991
22 Confluence properties of extensional and non-extensional -ca.. - Kesner - 1996
21 Aktualnye problemy logiki i metodologii nauky (context) - Mints, dokazatelstv - 1979
19 Some lambda calculi with categorical sums and products - Dougherty - 1993
17 Combinatory reduction systems with explicit substitution tha.. - Bloo, Rose - 1996
16 Lambda-calculus notation with namefree formulas involving sy.. (context) - de Bruijn - 1978
14 Combinatory reduction systems: introduction and survey - Klop, van Oostrom et al. - 1993
12 Combining first order algebraic rewriting systems - Di Cosmo, Kesner - 1994
10 The Church Rosser Theorem for the Typed lambda-calculus with.. (context) - Pottinger - 1981
9 An explicit eta rewrite rule - Briaud - 1995
9 Progress in Theoretical Computer Science (context) - Curien, sequential et al. - 1986
9 ese Hardin, and Jean-Jacques L (context) - Curien - 1992
8 volume 127 of Mathematical Centre Tracts (context) - Klop, Systems - 1980
8 A left-linear variant of oe (context) - noz - 1997
7 Personal Communication (context) - Lescanne - 1996
7 Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matema.. (context) - Mints, the et al. - 1977
7 a calculus of explicit substitutions which preserves strong .. (context) - Benaissa, Briaud et al. - 1996
6 equations dans les langages d'ordre 1; 2; : : : ; !. Th`ese .. (context) - Huet - 1976
6 A confluent reduction for the extensional typed \Gammacalcul.. (context) - Di Cosmo, Kesner - 1993
5 A confluent reduction system for the - calculus with surject.. (context) - Curien, Di Cosmo - 1991
4 Typed -calculi with explicit substitutions may not terminate (context) - Mellies - 1995
3 ese de doctorat, Universit (context) - Ehrhard, cat'egorique et al. - 1988
3 The calculus of explicit substitutions - Lescanne, Rouyer-Degli - 1994
3 Alejandro R'ios. Contribution `a l"etude des -calculus avec .. (context) - Contribution, calculus et al. - 1993
2 Eta-conversion for the languages of explicit substitutions (context) - Hardin - 1994
2 Functional back-ends and compilers within the lambda-sigma c.. (context) - Hardin, Maranget et al. - 1995
2 ese Hardin, and Alejandro R (context) - Curien - 1992
2 Confluence of extensional and non-extensional -calculi with .. (context) - Kesner - 1997
2 Reasoning about redundant patterns - Kesner - 1997
2 Four typed-lambda calculi with explicit substitutions may no.. (context) - Mellies - 1994
1 a la compilation des langages fonctionnels. Th`ese de doctor.. (context) - Pagano, de substitution et al. - 1998
1 algorithmes s'equentiels et programmation applicative (context) - Curien - 1983
1 Rewriting with extensional polymorphic - calculus (context) - Di Cosmo, Kesner - 1995
1 reduction for explicit substitutions (context) - Hardin - 1992
1 ese 3e ` me cycle, Universit (context) - Mauny, langages et al. - 1985
1 Proof of termination of the rewriting system subst on c (context) - Hardin, Laville - 1986
Documents on the same site (http://www.ps.uni-sb.de/ccl/publications/1998.html): More
Dominance Constraints: Algorithms and Complexity - Koller, Niehren, Treinen (1998) (Correct)
Reducing AC-Termination to Termination - Ferreira, Kesner, Puel (1997) (Correct)
An On-line Problem Database - Dershowitz, Treinen (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