Normalization and partial evaluation

DOI10.1007/3-540-45699-6_4MaRDI QIDQ4813224zbMATH OpenFDO

Authors Peter Dybjer, Andrzej Filinski

Publication date 13 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2395/23950137.htm

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Cut-elimination and normal-form theorems (03F05) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• A semantic account of type-directed partial evaluation
• Normalization by evaluation for the computational lambda-calculus
• Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
• Typeful normalization by evaluation
• Operational aspects of untyped Normalisation by Evaluation

Cited in

(25)

• Term rewriting for normalization by evaluation.
• A static simulation of dynamic delimited control
• Normalization by evaluation and algebraic effects
• A simple take on typed abstract syntax in Haskell-like languages
• Normalization by evaluation for the computational lambda-calculus
• From reduction-based to reduction-free normalization
• Nominal equational logic
• Elaborating evaluation-order polymorphism
• scientific article; zbMATH DE number 4134006 (Why is no real title available?)
• Normalization by evaluation with typed abstract syntax
• Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
• On Normalization by Evaluation for Object Calculi
• scientific article; zbMATH DE number 5353378 (Why is no real title available?)
• Internal normalization, compilation and decompilation for System \({\mathcal F}_{\beta\eta}\)
• From reduction-based to reduction-free normalization
• Memoization in type-directed partial evaluation
• A semantic account of type-directed partial evaluation
• scientific article; zbMATH DE number 1757129 (Why is no real title available?)
• Type directed partial evaluation for level-1 shift and reset
• Many more predecessors: a representation workout
• Typeful normalization by evaluation
• Foundations of Software Science and Computation Structures
• Bisimulations for delimited-control operators
• Normalization flow
• Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation

This page was built for publication: Normalization and partial evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813224)