We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated using internal type theory using quotient inductive types. We use a typed presentation hence there are no preterms or realizers in our construction. NBE for simple types is using a logical relation between the syntax and the presheaf interpretation. In our construction, we merge the presheaf interpretation and the logical relation into a proof-relevant logical predicate. We have formalized parts of the construction in Agda
Type theory (with dependent types) was introduced by Per Martin-Löf with the intention of providing ...
Abstract. We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like lang...
This thesis is about Martin-Löf’s intuitionistic theory of types (type theory). Type theory is at t...
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our c...
We develop normalisation by evaluation (NBE) for dependent types based onpresheaf categories. Our co...
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our c...
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our c...
AbstractWe examine the interplay between computational effects and higher types. We do this by prese...
AbstractWe extend Martin-Löf's Logical Framework with special constructions and typing rules providi...
International audienceSized types have been developed to make termination checking more perspicuous,...
Abstract The decidability of equality is proved for Martin-L"oftype theory with a universe ...
We extend Martin-L\uf6f\u27s Logical Framework with special constructions and typing rules providing...
The decidability of equality is proved for Martin-Löf type theory with a universe a la Russell and t...
AbstractWe develop the type theory of the Normalisation by Evaluation (NbE) algorithm for the λ-calc...
The decidability of equality is proved for Martin-L\uf6f type theory with a universe a la Russell an...
Type theory (with dependent types) was introduced by Per Martin-Löf with the intention of providing ...
Abstract. We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like lang...
This thesis is about Martin-Löf’s intuitionistic theory of types (type theory). Type theory is at t...
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our c...
We develop normalisation by evaluation (NBE) for dependent types based onpresheaf categories. Our co...
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our c...
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our c...
AbstractWe examine the interplay between computational effects and higher types. We do this by prese...
AbstractWe extend Martin-Löf's Logical Framework with special constructions and typing rules providi...
International audienceSized types have been developed to make termination checking more perspicuous,...
Abstract The decidability of equality is proved for Martin-L"oftype theory with a universe ...
We extend Martin-L\uf6f\u27s Logical Framework with special constructions and typing rules providing...
The decidability of equality is proved for Martin-Löf type theory with a universe a la Russell and t...
AbstractWe develop the type theory of the Normalisation by Evaluation (NbE) algorithm for the λ-calc...
The decidability of equality is proved for Martin-L\uf6f type theory with a universe a la Russell an...
Type theory (with dependent types) was introduced by Per Martin-Löf with the intention of providing ...
Abstract. We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like lang...
This thesis is about Martin-Löf’s intuitionistic theory of types (type theory). Type theory is at t...