Skip to search formSkip to main contentSkip to account menu

Normalisation by evaluation

Known as: Normalization by evaluation 
In programming language semantics, normalisation by evaluation (NBE) is a style of obtaining the normal form of terms in the λ calculus by appealing… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Beta normal formCombinatory logicDenotational semanticsDomain theory

Broader (1)

Lambda calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Normalisation of Historical Text Using Context-Sensitive Weighted Levenshtein Distance and Compound Splitting
Natural language processing for historical text imposes a variety of challenges, such as to deal with a high degree of spelling… 
2011
2011
Full Reduction at Full Throttle
Emerging trends in proof styles and new applications of interactive proof assistants exploit the computational facilities of the… 
2009
2009
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of… 
2008
2008
Normalization by Evaluation
This article formalizes normalization by evaluation as implemented in Isabelle. Lambda calculus plus term rewriting is compiled… 
2004
2004
A Denotational Account of Untyped Normalization by Evaluation
We show that the standard normalization-by-evaluation construction for the simply-typed λ βη -calculus has a natural counterpart… 
2004
2004
Operational aspects of untyped Normalisation by Evaluation
A purely syntactic and untyped variant of Normalisation by Evaluation for the $\lambda$-calculus is presented in the framework of… 
Highly Cited
2002
Highly Cited
2002
Semantic analysis of normalisation by evaluation for typed lambda calculus
This paper studies normalisation by evaluation for typed lambda calculus from a categorical and algebraic viewpoint. The first… 
Highly Cited
2001
Highly Cited
2001
Normalization by evaluation for typed lambda calculus with coproducts
Solves the decision problem for the simply typed lambda calculus with a strong binary sum, or, equivalently, the word problem for… 
Highly Cited
2000
Highly Cited
2000
Normalization and Partial Evaluation
We give an introduction to normalization by evaluation and type-directed partial evaluation. We first present normalization by… 
Highly Cited
1998
Highly Cited
1998
Normalisation by Evaluation
We extend normalization by evaluation (FIrst presented in [4]) from the pure typed ?-calculus to general higher type term rewrite… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)