Normalization by evaluation for the computational lambda-calculus
From MaRDI portal
Recommendations
- Normalization and partial evaluation
- Foundations of Software Science and Computation Structures
- Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
- The simple type theory of normalisation by evaluation
- Operational aspects of untyped Normalisation by Evaluation
Cited in
(16)- A static simulation of dynamic delimited control
- Normalization by evaluation and algebraic effects
- Breaking through the normalization barrier: a self-interpreter for F-omega
- From reduction-based to reduction-free normalization
- 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
- From reduction-based to reduction-free normalization
- A semantic account of type-directed partial evaluation
- Normalization and partial evaluation
- Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
- Foundations of Software Science and Computation Structures
- Denotational aspects of untyped normalization by evaluation
- scientific article; zbMATH DE number 7324347 (Why is no real title available?)
- On reduction and normalization in the computational core
- Semantic analysis of normalisation by evaluation for typed lambda calculus
This page was built for publication: Normalization by evaluation for the computational lambda-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778820)
