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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2018
0519932018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated in… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2016
2016
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated… (More)
  • figure 2
Is this relevant?
2010
2010
It has been long recognised that partial evaluation is related to proof normalisation. Normalisation by evaluation, which has… (More)
  • figure 1
  • figure 2
Is this relevant?
2009
2009
We construct a logical framework supporting datatypes that mix binding and computation, implemented as a universe in the… (More)
Is this relevant?
2005
2005
This thesis presents a critical analysis of normalisation by evaluation as a technique for speeding up compilation of typed… (More)
  • figure 1.1
  • figure 2.1
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
2004
2004
A purely syntactic and untyped variant of Normalization by Evaluation for the -calculus is presented in the framework of a two… (More)
Is this relevant?
2004
2004
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus has a natural counterpart… (More)
Is this relevant?
2003
2003
We extend normalization by evaluation rst presented in from the pure typed calculus to general higher type term rewriting systems… (More)
Is this relevant?
2002
2002
This paper studies normalisation by evaluation for typed lambda calculus from a categorical and algebraic viewpoint. The first… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog… (More)
Is this relevant?