| Alternate document: Details From Interpreter to Logic Engine by Defunctionalization (04) Dariusz Danvy, Olivier Danvy |
Olivier Danvy  Home/Search
Context
Related
| brics.dk/RS/04/Ref...ICSRS0430.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: brics.dk/RS/04/...BRICSRS04Ref (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a systematic construction of a reduction-free normalization function. (Update)
Active bibliography (related documents): More All
3.8: An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004) (Correct)
1.9: Refocusing in Reduction Semantics - Danvy, Nielsen (2004) (Correct)
1.8: On Evaluation Contexts, Continuations, and the Rest of Computation - Danvy (Correct)
Similar documents based on text: More All
0.4: Formalizing Implementation Strategies for First-Class Continuations - Danvy (2000) (Correct)
0.4: The Abstraction and Instantiation of String-Matching.. - Amtoft, Consel.. (2001) (Correct)
0.4: Basic Research in Computer Science - Sur Un Exemple (Correct)
BibTeX entry: (Update)
@misc{ danvy-from,
author = "Olivier Danvy",
title = "From Reduction-Based to Reduction-Free Normalization",
url = "citeseer.ist.psu.edu/danvy04from.html" }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin - 1981
384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1998
122 Type-directed partial evaluation - Danvy - 1998
122 Type-directed partial evaluation - Danvy - 1996
70 Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
50 Artificial Intelligence Laboratory (context) - Jr, for et al. - 1978
46 CS Conversion: A Syntactic Theory of Control and State in Im.. (context) - Felleisen, of - 1987
43 An inverse of the evaluation functional for typed #-calculus (context) - Berger, Schwichtenberg - 1991
33 Intuitionistic model constructions and normalization proofs - Coquand, Dybjer - 1997
26 Categorical reconstruction of a reduction-free normalization.. - Altenkirch, Hofmann et al. - 1995
24 Science of Computer Programming (context) - Danvy, direct - 1994
19 A semantic account of type-directed partial evaluation - Filinski - 1999
18 About models for intuitionistic type theories and the notion.. (context) - Martin-Lof - 1975
15 Using functor categories to generate intermediate code (context) - Reynolds - 1995
13 Functional runtime systems within the lambda-sigma calculus (context) - Hardin, Maranget et al. - 1998
12 Normalization by evaluation - Berger, Eberl et al. - 1998
11 Defunctionalization at work (context) - Danvy, Nielsen - 2001
10 Mathematical Structures in Computer Science (context) - Cubric, Dybjer et al. - 1998
10 Extracting a proof of coherence for monoidal categories from.. - Beylin, Dybjer - 1995
9 A functional correspondence between evaluators and abstract .. (context) - Ager, Biernacki et al. - 2003
7 From syntactic theories to interpreters: Automating proofs o.. - Xiao, Sabry et al. - 2001
7 A rational deconstruction of Landin's SECD machine (context) - Danvy - 2004
6 A functional correspondence between call-by-need evaluators .. - Ager, Danvy et al. - 2004
6 Unpublished lecture notes (context) - Felleisen, Flatt et al.
6 From interpreter to logic engine by defunctionalization (context) - Biernacki, Danvy - 2003
6 Normalization and partial evaluation - Dybjer, Filinski - 2000
5 and Mitchell Wand (context) - Ganz, Friedman - 1999
5 A functional correspondence between monadic evaluators and a.. - Ager, Danvy et al. - 2005
4 An operational foundation for delimited continuations in the.. (context) - lgorzata, Dariusz et al. - 2004
4 An abstract machine for lambda-terms normalization (context) - Cregut - 1990
3 Information Processing Letters (context) - Goldberg, the - 2000
3 Refocusing in reduction semantics - Danvy, Nielsen - 2004
3 A compiled implementation of strong reduction - Gregoire, Leroy - 2002
3 and the rest of the computation (context) - Danvy, contexts - 2004
2 The correctness of a modified SECD machine (context) - McGowan - 1970
2 Extensional normalisation and type-directed partial evaluati.. (context) - Balat, Di Cosmo et al. - 2004
2 Operational aspects of untyped normalization by evaluation - Aehlig, Joachimski - 2004
2 Memoization in type-directed partial evaluation - Balat, Danvy - 2002
2 The simple type theory of normalisation by evaluation (context) - Vestergaard - 2001
2 Making fast curry pushenter vs (context) - Marlow, Jones et al. - 2004
1 Normalization by evaluation (context) - Altenkirch, Uustalu - 2004
1 A bicategorical analysis of E-categories - Kinoshita - 1998
1 A denotational account of untyped normalization by evaluatio.. - Filinski, Rohde - 2004
Documents on the same site (http://www.brics.dk/RS/04/Ref/BRICS-RS-04-Ref/BRICS-RS-04-Ref.html): More
Congruences for Contextual Graph-Rewriting - Sassone, Sobocinski (2004) (Correct)
The Design Space of Type Checkers for XML Transformation.. - Møller, Schwartzbach (2004) (Correct)
Split-2 Bisimilarity has a Finite Axiomatization over CCS with.. - Aceto, al. (2004) (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