Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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… Expand

2011

2011

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

2009

2009

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

2009

2009

We construct a logical framework supporting datatypes that mix binding and computation, implemented as a universe in the… Expand

2007

2007

We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is… Expand

2004

2004

A purely syntactic and untyped variant of Normalisation by Evaluation for the $\lambda$-calculus is presented in the framework of… Expand

Highly Cited

2002

Highly Cited

2002

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

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… Expand

Highly Cited

2000

Highly Cited

2000

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

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… Expand