M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L'evy. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Electronic Notes in Theoretical Computer Science 67 (2002) - Url Http Www (Correct)
.... s e as well as and the suspension calculus are non comparable while s e is more adequate than the suspension calculus. Keywords: Calculi of explicit substitutions, lambda calculi, eta reduction. 1 Introduction Recent years have witnessed an explosion of work on expliciting substitutions [1,7,9,14,15,17,19] and on establishing its usefulness to computation: e.g. to Partially supported by the Brazilian CNPq research council grant number 47488101 6. First author partially suported by the FEMAT Brazilian foundation for research in mathematics, second author supported by the CAPES Brazilian ....
....c 2002 Published by Elsevier Science B. V. automated deduction and theorem proving [24,25] to proof theory [31] to programming languages [8,20,23,26] and to higher order uni cation HOU [2,13] This paper concentrates on three di erent styles of substitutions: i) The style [1] which introduces two di erent sets of entities: one for terms and one for substitutions. ii) The suspension calculus [28,26] denoted susp , which introduces three di erent sets of entities: one for terms, one for environments and one for environment terms. iii) The s style [19] which uses ....
[Article contains additional citation context not shown here]
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit Substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
Electronic Notes in Theoretical Computer Science 67 (2002) - Url Http Www (Correct)
.... s e as well as and the suspension calculus are non comparable while s e is more adequate than the suspension calculus. Keywords: Calculi of explicit substitutions, lambda calculi, eta reduction. 1 Introduction Recent years have witnessed an explosion of work on expliciting substitutions [1,7,9,14,15,17,19] and on establishing its usefulness to computation: e.g. to Partially supported by the Brazilian CNPq research council grant number 47488101 6. First author partially suported by the FEMAT Brazilian foundation for research in mathematics, second author supported by the CAPES Brazilian ....
....c 2002 Published by Elsevier Science B. V. automated deduction and theorem proving [24,25] to proof theory [31] to programming languages [8,20,23,26] and to higher order uni cation HOU [2,13] This paper concentrates on three di erent styles of substitutions: i) The style [1] which introduces two di erent sets of entities: one for terms and one for substitutions. ii) The suspension calculus [28,26] denoted susp , which introduces three di erent sets of entities: one for terms, one for environments and one for environment terms. iii) The s style [19] which uses ....
[Article contains additional citation context not shown here]
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit Substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
Formalising Strong Normalisation Proofs of Explicit.. - Kamareddine, Qiao (2002) (Correct)
....been an interest in formalising substitution explicitly in order to provide a theoretical framework for the implementation of programming languages and theorem provers. Several calculi including new operators to denote substitution and new rules to handle these operators have been proposed (e.g. [10, 2, 17, 30, 4, 5, 21, 22, 28, 13]) Amongst these calculi we mention C (cf. 14] the calculi of categorical combinators (cf. 10] SP (cf. 2, 11, 30] referred to as the family; BLT (cf. 20] cf. 4] and (cf. 28] which are descendants of the family; s (cf. 21] and s e (cf. 22] Most ....
.... Several calculi including new operators to denote substitution and new rules to handle these operators have been proposed (e.g. 10, 2, 17, 30, 4, 5, 21, 22, 28, 13] Amongst these calculi we mention C (cf. 14] the calculi of categorical combinators (cf. 10] SP (cf. [2, 11, 30]) referred to as the family; BLT (cf. 20] cf. 4] and (cf. 28] which are descendants of the family; s (cf. 21] and s e (cf. 22] Most of these calculi are described in de Bruijn notation and can roughly be classi ed under two styles: the [2, 17] and the s styles ....
[Article contains additional citation context not shown here]
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
The S-Calculus: Its Typed and Its Extended Versions - Fairouz Kamareddine And (Correct)
....E 1 ; E 2 ; E n , we shall use the notation Ei for the environment E i ; E i 1 ; E n , analogously Ei stands for E 1 ; E i , etc. The typing rules for the oe and operators that we introduce below may be derived from the typing rules of the simply typed oe calculus (cf. [ACCL91]) and the translation we gave for the s calculus into the oe calculus (cf. KR95] Definition 4 The syntax for the simply typed s terms is given as follows (types and environments are defined as for terms) Terms s t : IN j s t s t j A:s t j s t oe s t j k s t i 1 ; k 0 The typing ....
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L'evy. Explicit Substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Analysis and Caching of Dependencies - Mart'in Abadi Digital Self-citation (Abadi L'evy) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L'evy. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Type Theory and Rewriting - BLANQUI (2001) (1 citation) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (2 citations) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lvy. Explicit substitutions. Journal of Functional Programming, 1(4):375416, 1991.
Bigraphical Semantics Of Higher-Order Mobile Embedded.. - Bundgaard, Hildebrandt (2006) (Correct)
No context found.
Abadi, M., L. Cardelli, P.-L. Curien and J.-J. Levy, Explicit substitutions, Journal of Functional Programming 1 (1991), pp. 375--416.
Scrap your Nameplate - Functional Pearl - Cheney (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L evy. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Axiomatic Rewriting Theory II - The λσ-calculus.. - Mellies (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Levy. \Explicit substitutions". Journal of Functional Programming, 1(4):375-416, 1991.
Axiomatic Rewriting Theory VI - Residual Theory Revisited - Mellies (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Levy. \Explicit substitutions". Journal of Functional Programming, 1(4):375-416, 1991.
Nominal Logic Programming - Cheney (2004) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Cut Rules and Explicit Substitutions - Vestergaard, Wells (1999) (3 citations) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991. 12
Explicit Fusions - Wischik, Gardner (2000) (7 citations) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991. http://research.microsoft.com/Users/luca/Papers/ExplicitSub.pdf
Strong Bisimulation for the Explicit Fusion Calculus - Wischik, Gardner (2004) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991. http://research.microsoft.com/Users/luca/Papers/ExplicitSub.pdf
A Simply Typed Context Calculus with First-Class Environments - Sato, Sakurai, Kameyama (2002) (4 citations) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit Substitutions. Journal of Functional Programming, 1:375--416, 1991.
Intersection Types for Explicit Substitutions - Lengrand, Lescanne.. (2003) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Implementing Typeful Program Transformations - Chen, Xi (2003) (2 citations) (Correct)
No context found.
M. Abadi, L. Cardelli, Curien, P.-L., and Levy, J.-J. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Generalized Fi-Reduction and Explicit Substitutions - Fairouz Kamareddine And (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L'evy. Explicit Substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Binding Logic: proofs and models - Dowek, Hardin, Kirchner (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Levy, Explicit substitutions, Journal of Functional Programming, 1, 4 (1991) pp. 375-416.
Bridging de Bruijn Indices and Variable Names in Explicit.. - Kamareddine, Rios (1998) (7 citations) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit Substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Revisiting the Notion of Function - Kamareddine, Laan, Nederpelt (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
The Confluence of the S E -Calculus Via a Generalized - Interpretation Method Fairouz (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L'evy. Explicit Substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
Electronic Notes in Theoretical Computer Science 4 (1996) - Rewriting Logic As (1998) (1 citation) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L'evy, Explicit substitutions, Journal of Functional Programming 1(4) (1991) 375--416.
Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002) (Correct)
No context found.
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L evy. Explicit substitutions. Journal of Functional Programming, 1(4):375--416, 1991.
First 50 documents Next 50
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