Kristoffer Høgsbro Rose  Home/Search
Context Related
| enslyon.fr/pub/us...osenote166.ps.gz diku.dk/diku/semantics/pap...D166.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: fermivista.math...ftp.enslyon.fr (more) From: diku.dk/researchgroups/to...1993 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The untyped lambda-calculus enriched with local possibly recursive definitions, e.g., let and letrec of functional programming languages, is discussed. It is shown how it may be modeled using conditional term rewriting systems defining "explicit acyclic and cyclic substitution" calculi that generalise the explicit substitution calculus of Abadi, Cardelli, Curien, and Lévy [1] in two directions: the systems model traditional lambda-calculus with variables (thus not restricted to closed... (Update)
Context of citations to this paper: More
.... to the best of the authors knowledge there are but two: Explicit CRS [3] and XRS [16] In [3] explicit substitutions a la x [19, 2] are added to the CRS formalism as a first step towards using higher order rewriting with explicit substitutions for modeling the...
.... authors knowledge there are but two: Explicit CRS [2] and Explicit Reduction Systems (XRS) 17] In [2] explicit substitutions a la x [20, 1] are added to the CRS formalism as a first step towards using higher order rewriting with explicit substitutions for modeling the...
Cited by: More
On the Implementation of Recursion in Call-By-Value.. - Hirschowitz, al. (2003) (Correct)
Bridging de Bruijn Indices and Variable Names in Explicit.. - Kamareddine, Rios (1998) (Correct)
Compilation of Extended Recursion in Call-by-Value.. - Hirschowitz, Leroy.. (2003) (Correct)
Active bibliography (related documents): More All
0.8: Explicit Cyclic Substitutions - Rose (1993) (Correct)
0.3: Graph-based Operational Semantics of a Lazy Functional Language - Rose (Correct)
0.1: Modeling Sharing and Recursion for Weak Reduction.. - Zine-El-Abidine.. (Correct)
Similar documents based on text: More All
0.4: Robust and Effective Transformation of Letrec - Waddell, Sarkar, Dybvig (Correct)
0.3: Operational Reduction Models for Functional Programming Languages - Rose (1996) (Correct)
0.2: Combinatory Reduction Systems with Explicit Substitution that.. - Bloo, Rose (1996) (Correct)
Related documents from co-citation: More All
10: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
9: Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
8: An algorithm for optimal lambda calculus reductions (context) - Lamping - 1990
BibTeX entry: (Update)
K. Rose. Explicit cyclic substitutions. In Rusinowitch and Remy, editors, Proc. of the Third International Workshop on Conditional Term Rewriting Systems (CTRS), number 656 in LNCS, pages 36--50, 1992. http://citeseer.ist.psu.edu/article/rose93explicit.html More
@inproceedings{ rose92explicit,
author = "Kristoffer H. Rose",
title = "Explicit Cyclic Substitutions",
booktitle = "{CTRS~'92}---3rd International Workshop on Conditional Term Rewriting Systems",
number = "656",
publisher = "Springer-Verlag",
address = "Pont-a-Mousson, France",
editor = "M. Rusinowitch and J.-L. R\'e{}my",
pages = "36--50",
year = "1992",
url = "citeseer.ist.psu.edu/article/rose93explicit.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
384 Simple Word Problems in Universal Algebras (context) - Knuth, Bendix - 1970
359 The Implementation of Functional Programming Languages (context) - Jones - 1987
247 Confluent Reductions: Abstract properties and Applications t.. (context) - Huet - 1980
179 The Lazy Lambda Calculus - Abramsky - 1990
114 Fundamental Properties of Infinite Trees (context) - Courcelle - 1983
101 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
92 Explicit Substitutions - Abadi, Cardelli et al. - 1990
72 Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
66 Efficient Compilation of Lazy Evaluation - Johnsson - 1984
63 Optimal Reductions in the Lambda Calculus (context) - L'evy - 1980
61 Term Graph Rewriting: Theory and Practice (context) - Sleep, Plasmeijer et al. - 1993
34 Optimal Derivations in Weak Lambda-Calculi and in Orthogonal.. - Maranget - 1991
31 Theoretical Computer Science (context) - Park, Mu-ineffable - 1976
26 Recursive Data Structures (context) - Hoare - 1975
26 A Syntactic Approach to Program Transformations - Ariola - 1991
22 Explicit Cyclic Substitutions - Rose - 1992
12 Definiteness and Unfoldability (context) - Sondergaard, Sestoft et al. - 1990
7 Recursive Functions of Symbolic Expressions (context) - McCarthy - 1960
7 A Graph-like Lambda Calculus for which Leftmost Outermost Re.. (context) - Staples - 1978
2 Call-by-Mix: A Reduction Strategy for Pure -calculus (context) - Grue - 1987
1 cyclic substitution nesting (context) - CTRS
1 hindley-rosen lemma (context) - garbage, vi
1 RHS: remark to (context) - iv, representative et al.
1 critical pairs: proof (context) - convergence
1 variable capture: remark to (context) - induction, strongly et al.
1 free variable set (context) - vi, vi
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ens-lyon.fr.html): More
Un Calcul De Constructions Infinies Et Son Application A La.. - Giménez (1996) (Correct)
Parallel Approximation of Optimization Problems.. - Bovet, Clementi.. (Correct)
MasPar Programming Language (ANSI C compatible MPL) User Guide - Software Version (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