| Alternate document: Details Functional Back-Ends within the Lambda-Sigma Calculus Th'er Ese Issn 0249-6399 apport de recherche Institut National De Recherche En Informatique Et Automatique Functional Back-Ends within the |
Thérèse Hardin, Luc Maranget, Bruno Pagano  Home/Search
Context Related
| inria.fr/INRIA/Projects...ICFP96.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: pauillac.inria.fr/publioscope (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We de ne a weak -calculus, w , as a subsystem of the full -calculus with explicit substitutions * . We claim that w could be the archetypal output language of functional compilers, just as the -calculus is their universal input language. Furthermore, * could be the adequate theory to establish the correctness of simpli ed functional compilers. Here, we illustrate these claims by proving the correctness of two simpli ed compilers and runtime systems modeled as abstract machines. We ... (Update)
Context of citations to this paper: More
...choices such as the representation of the environments (lists or vectors) are, in general, not tackled in these formalisms. Hardin al. [25] introduce ls w , a weak l calculus with explicit substitutions, which can serve as the output language of functional compilers. They...
.... of incomplete proofs (Munoz Hurtado 1996b; Magnusson 1995) proof theory (Herbelin 1995) and functional compiler backends (Hardin et al. 1996). Curry Howard Correspondence for L Systems. While the Curry Howard Correspondence is straightforward and, hence, well developed...
Cited by: More
Axiomatic Rewriting Theory I - A Diagrammatic Standardization.. - Mellies (2001) (Correct)
Super-Closures - Lang, Benaissa, Lescanne (Correct)
Cut Rules and Explicit Substitutions - Vestergaard, Wells (2000) (Correct)
Similar documents (at the sentence level):
41.7%: Unknown - (Correct)
40.6%: Functional Back-Ends within the Lambda-Sigma Calculus - Th'er Ese (1996) (Correct)
Active bibliography (related documents): More All
0.3: Décrire Et Comparer Les Implantations De Langages.. - Douence, Fradet (1996) (Correct)
0.3: A Taxonomy of Functional Language Implementations Part I.. - Douence, Fradet (1996) (Correct)
0.2: A Systematic Study of Functional Language Implementations - Douence, Fradet (1998) (Correct)
Similar documents based on text: More All
0.1: H E V E A User Documentation - Version Luc Maranget (Correct)
0.0: LARD: A Distributed Approach - Coarfa, Cakareski, Kanodia (1999) (Correct)
0.0: Code Gardé: Traduction, . . . - Hu (2000) (Correct)
Related documents from co-citation: More All
4: Explicit substitutions - Abadi, Cardelli et al. - 1990
3: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
3: Typed lambda-calculi with explicit substitutions may not terminate (context) - Mellies - 1995
BibTeX entry: (Update)
T. Hardin, L. Maranget, and B. Pagano (1997). Functional Back-Ends within the Lambda-Sigma Calculus. http://citeseer.ist.psu.edu/hardin96functional.html More
@inproceedings{ hardin96functional,
author = "Thse Hardin and Luc Maranget and Bruno Pagano",
title = "Functional Back-Ends within the Lambda-Sigma Calculus",
booktitle = "International Conference on Functional Programming",
pages = "25-33",
year = "1996",
url = "citeseer.ist.psu.edu/hardin96functional.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992
359 The implementation of Functional Programming Languages (context) - Jones - 1987
306 LCF Considered as a Programming Language (context) - Plotkin - 1977
218 The Mechanical Evaluation of Expressions (context) - Landin - 1964
169 A call-by-need lambda-calculus - Ariola, Feleisen et al.
114 A Natural Semantics for Lazy Evaluation - Launchbury
106 The Categorical Abstract Machine (context) - Cousineau, Curien et al.
92 Explicit Substitutions - Abadi, Cardelli et al.
81 The ZINC Experiment: An Economical Implementation of the ML .. - Leroy - 1990
59 A Compiler For Lazy ML (context) - Augustsson
48 From Operational Semantics to Abstract Machines (context) - Hannan, Miller - 1992
43 Lazy Abstract Machine to Execute Supercombinators (context) - Fairbairn, Wray et al.
42 Compiling a Functional Language - Cardelli
35 a Journey through Calculi of Explicit Substitutions - Lescanne, to
32 Higher-Order Unication via explicit Substitutions (context) - Dowek, Hardin et al.
23 An Abstract Framework for Environment Machines (context) - Curien - 1991
18 Calculus Structure Isomorphic to Sequent Calculus Structure (context) - Herbelin
15 A Categorical Understanding of Environment Machines (context) - Asperti - 1992
7 Towards a Taxonomy of Functional Language Implementations - Douence, Fradet
2 An Abstract Machine for the Normalization of Lambda-terms (context) - Cr
2 Optimal derivation in Orthogonal Rewriting Systems and in We.. (context) - Maranget
2 Bi-simulation de machines abstraites en lambda-sigma-calcul (context) - Pagano - 1995
1 Proving the Correctness of a Virtual Machine by a Bisimulati.. (context) - Rittri - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pauillac.inria.fr/publioscope.html): More
Optimal Derivations in Weak Lambda-calculi and in Orthogonal.. - Maranget (1991) (Correct)
Compiling Join-Patterns - Maranget, Le Fessant (1998) (Correct)
A Web navigator with applets in Caml - Rouaix (1996) (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