Klaus Aehlig, Felix Joachimski  Home/Search
Context Related
| mathematik.unimuenchen....01NBE.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: mathematik.unimuenchen.de/~ae... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A purely syntactic and untyped variant of Normalization by Evaluation for the -calculus is presented in the framework of a two-level -calculus with rewrite rules to model the inverse of the evaluation functional. Among its operational properties gures a standardization theorem that formally establishes adequacy of implementation in functional programming languages. An example implementation in Haskell is provided. The relation to usual type-directed Normalization by Evaluation is... (Update)
Context of citations to this paper: More
..., but clearly s , since the set fr j r g = WF of strongly normalizing terms is closed under subterms. It has been shown elsewhere [AJ01] that strong normalization (and con uence) of combined reduction and expansion follows from the same property of reduction alone....
Cited by: More
Optimizing Generic Functions - Artem Alimarine And (2004) (Correct)
Syntactic Analysis of eta-Expansions - In Pure Type (Correct)
Short Proofs of Normalization for the simply-typed.. - Joachimski, Matthes (2002) (Correct)
Similar documents (at the sentence level):
59.4%: Operational Aspects of Untyped Normalization by Evaluation - Aehlig, Joachimski (2003) (Correct)
Active bibliography (related documents): More All
0.9: From Reduction-Based to Reduction-Free Normalization - Danvy (2004) (Correct)
0.5: A Note On Rewriting Theory For Uniqueness Of Iteration - Okada, SCOTT (2000) (Correct)
0.4: An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004) (Correct)
Similar documents based on text: More All
0.7: Term Rewriting for Normalization by Evaluation - Berger, Eberl, Schwichtenberg (1999) (Correct)
0.7: Normalization by Evaluation with Typed Abstract Syntax - Danvy, Rhiger, Rose (2001) (Correct)
0.7: Normalization By Evaluation - Berger, Eberl, Schwichtenberg (1998) (Correct)
Related documents from co-citation: More All
2: Ideas and results in proof theory (context) - Prawitz - 1971
BibTeX entry: (Update)
Klaus Aehlig and Felix Joachimski. Operational aspects of normalization by evaluation. Submitted, 2001. http://citeseer.ist.psu.edu/aehlig01operational.html More
@misc{ aehlig01operational,
author = "K. Aehlig and F. Joachimski",
title = "Operational aspects of normalization by evaluation",
text = "Klaus Aehlig and Felix Joachimski. Operational aspects of normalization
by evaluation. Submitted, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/aehlig01operational.html" }
Citations (may not include all citations):106 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
46 On Mints' reductions for ccc-calculus (context) - Akama
33 Intuitionistic model constructions and normalization proofs - Coquand, Dybjer - 1997
33 Number 1706 in Lecture Notes in Computer Science (context) - Danvy, evaluation - 1998
26 Categorical reconstruction of a reduction free normalization.. - Altenkirch, Hofmann et al. - 1995
12 The type free lambda calculus (context) - Barendregt - 1977
12 Normalization by evaluation - Berger, Eberl et al. - 1998
7 Standardization and con uence for a lambda calculus with gen.. - Joachimski, Matthes - 2000
6 An inverse of the evaluation functional for typed {calculus (context) - Berger, Schwichtenberg - 1991
5 Theoretical Computer Science (context) - van Oostrom - 1997
3 Information Processing Letters (context) - Goldberg, odelization et al. - 2000
2 Structures in Computer Science (context) - Cubri, Peter et al. - 1998
2 A brief history of rewriting with extensionality - di Cosmo - 1996
2 The simple type theory of normalisation by evaluation (context) - Vestergaard
1 odelization in the lambda calculus (context) - Goldberg - 1996
1 Some lambda calculi with categorial sums and products (context) - Dougherty
1 odelization in the untyped lambdacalculus (context) - Mogensen - 1999
1 Simulating expansions without expansions - di Cosmo, Kesner - 1994
1 Available from httpwww (context) - Jay, The et al. - 1995
Documents on the same site (http://www.mathematik.uni-muenchen.de/~aehlig/): More
Linear Ramified Higher Type Recursion and Parallel.. - Aehlig, Johannsen.. (Correct)
Continuous Normalization for the Lambda-Calculus and Gödel's T - Aehlig, Joachimski (Correct)
A Note on Böhm's Theorem - Aehlig, Joachimski (2002) (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