Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 206,587,597 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

Natural language processing for historical text imposes a variety of challenges, such as to deal with a high degree of spelling…

2011

2011

Emerging trends in proof styles and new applications of interactive proof assistants exploit the computational facilities of the…

2009

2009

We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of…

2008

2008

This article formalizes normalization by evaluation as implemented in Isabelle. Lambda calculus plus term rewriting is compiled…

2004

2004

We show that the standard normalization-by-evaluation construction for the simply-typed λ βη -calculus has a natural counterpart…

2004

2004

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

This paper studies normalisation by evaluation for typed lambda calculus from a categorical and algebraic viewpoint. The first…

Highly Cited

2001

Highly Cited

2001

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

We give an introduction to normalization by evaluation and type-directed partial evaluation. We first present normalization by…

Highly Cited

1998

Highly Cited

1998

We extend normalization by evaluation (FIrst presented in [4]) from the pure typed ?-calculus to general higher type term rewrite…