Skip to search formSkip to main content

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

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

2012

2012

We show how to combine a general purpose type system for an existing language with support for programming with binders and… Expand

Is this relevant?

2011

2011

Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting… Expand

Is this relevant?

2010

2010

It has been long recognised that partial evaluation is related to proof normalisation. Normalisation by evaluation, which has… Expand

Is this relevant?

2010

2010

Invited Talks.- Beluga: Programming with Dependent Types, Contextual Data, and Contexts.- Using Static Analysis to Detect Type… Expand

Is this relevant?

2009

2009

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

Is this relevant?

2009

2009

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

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We present an abstract machine and a reduction semantics for the
lambda-calculus extended with control operators that give access… Expand

Is this relevant?

2004

2004

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

Is this relevant?

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

Is this relevant?

1998

1998

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

Is this relevant?