Abstract. We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normal-ization of open λ-terms w.r.t. β-reduction and rewrite rules. We have implemented NBE and show both a detailed formal model of our imple-mentation and its verification in Isabelle. Finally we discuss how NBE is turned into a proof rule in Isabelle.
We develop normalisation by evaluation (NBE) for dependent types based onpresheaf categories. Our co...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
International audienceWe show how testing convertibility of two types in dependently typed systems c...
Abstract. We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like lang...
AbstractWe develop the type theory of the Normalisation by Evaluation (NbE) algorithm for the λ-calc...
We introduce Normalisation by Stack-based Evaluation, NbSE, combining Normalisation by Evaluation, N...
International audienceDependently typed theorem provers allow arbitrary terms in types. It is conven...
This thesis presents a critical analysis of normalisation by evaluation as a technique for speeding...
International audienceDependently typed theorem provers allow arbitrary terms in types. It is conven...
AbstractWe develop the type theory of the Normalisation by Evaluation (NbE) algorithm for the λ-calc...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
International audienceDependently typed theorem provers allow arbitrary terms in types. It is conven...
We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{bet...
International audienceWe show that Hyland and Ong's game semantics for PCF can be presented using no...
International audienceWe present the first typeful implementation of Normalization by Evaluation for...
We develop normalisation by evaluation (NBE) for dependent types based onpresheaf categories. Our co...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
International audienceWe show how testing convertibility of two types in dependently typed systems c...
Abstract. We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like lang...
AbstractWe develop the type theory of the Normalisation by Evaluation (NbE) algorithm for the λ-calc...
We introduce Normalisation by Stack-based Evaluation, NbSE, combining Normalisation by Evaluation, N...
International audienceDependently typed theorem provers allow arbitrary terms in types. It is conven...
This thesis presents a critical analysis of normalisation by evaluation as a technique for speeding...
International audienceDependently typed theorem provers allow arbitrary terms in types. It is conven...
AbstractWe develop the type theory of the Normalisation by Evaluation (NbE) algorithm for the λ-calc...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
International audienceDependently typed theorem provers allow arbitrary terms in types. It is conven...
We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{bet...
International audienceWe show that Hyland and Ong's game semantics for PCF can be presented using no...
International audienceWe present the first typeful implementation of Normalization by Evaluation for...
We develop normalisation by evaluation (NBE) for dependent types based onpresheaf categories. Our co...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
International audienceWe show how testing convertibility of two types in dependently typed systems c...