Download:
|
by Delia Kesner, Pablo E. Martnez Lopez
In ALP/PLILP'98, LNCS 1490
http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/1999/S99-02/JFLP-A99-13.ps.gz
Add To MetaCart
Abstract:
This paper proposes an implementation of objects and functions via a calculus with explicit substitutions that is con
uent and preserves strong normalization. The source calculus corresponds to the combination of the & calculus of Abadi and Cardelli [AC96] and the calculus, and the target calculus corresponds to an extension of the former calculus with explicit substitutions. The interesting feature of our calculus is that substitutions are separated|and treated accordingly|into two dierent kinds: those used to encode ordinary substitutions and those encoding invoke substitutions. When working with explicit substitutions, this dierentiation is essential to the encoding of calculus into & calculus in a conservative way, following the style proposed in [AC96]. 1
Citations
|
808
|
A Theory of Objects
– Abadi, Cardelli
- 1996
|
|
414
|
A language with distributed scope
– Cardelli
- 1995
|
|
341
|
Explicit substitutions
– Abadi, Cardelli, et al.
- 1990
|
|
239
|
Orderings for term-rewriting systems
– Dershowitz
- 1982
|
|
185
|
The Lambda Calculus: Its Syntax and Semantics (revised ed
– Barendregt
- 1984
|
|
117
|
de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation
– G
- 1972
|
|
65
|
A lambda-ealculus it la De Bruijn with explicit substitutions
– KAMAREDDINE, Rios
- 1995
|
|
46
|
Two generalizations of the recursive path ordering
– Kamin, Lévy
- 1980
|
|
45
|
On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis
– Field
- 1990
|
|
30
|
Oostrom V., van Raamsdonk F. Combinatory reduction systems: introduction and survey
– Klop, Oostrom
- 1993
|
|
30
|
A notation for lambda terms: A generalization of environments
– Nadathur, Wilson
- 1998
|
|
26
|
Explicit substitution: on the edge of strong normalisation, Computing Science Reports 96–10
– Bloo, Geuvers
- 1996
|
|
24
|
Explicit cyclic substitutions
– Rose
- 1992
|
|
21
|
Confluence properties of extensional and non-extensional -calculi with explicit substitutions
– Kesner
- 1996
|
|
19
|
Confluence and preservation of strong normalisation in an explicit substitutions calculus
– Munoz
- 1996
|
|
18
|
From to , a journey through calculi of explicit substitutions
– Lescanne
- 1994
|
|
18
|
From Classes to Objects via Subtyping
– Rémy
- 1998
|
|
16
|
Preservation of strong normalization in named lambda calculi with explicit substitution and garbage collection
– Bloo, Rose
- 1995
|
|
16
|
Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Normalisation
– Bloo, Rose
- 1996
|
|
4
|
The polymorphic lambda calculus with explicit substitutions
– Bonelli
- 1999
|
|
4
|
A con calculus of substitutions
– Hardin, Levy
- 1989
|
|
2
|
Explicit substitutions for control operators
– Barthe, Kamareddine, et al.
- 1997
|
|
1
|
Using and explicit substitutions to implement objects and functions in a de Bruijn setting
– Bonelli
- 1999
|
|
1
|
Resultats de con pour les regles fortes de la logique combinatoire categorique et liens avec les lambdacalculs. These de doctorat, Universite de Paris VII
– Hardin
- 1987
|
|
1
|
X.R.S: eXplicit Reduction Systems, A calculus for higher order calculi
– Pagano
- 1998
|
