Add to ORKGIn this paper I present a partial formalisation of a normaliser for type theory in Agda[Nor07]; extending previous work on big-step normalisation[AC08,AC06]. The normaliser in written as an environment machine. Only the computational behaviour of the normaliser is presented omitting details of termination
Abstract. We present a formal treatment of normalization by evalua-tion in type theory. The involved...
The decidability of equality is proved for Martin-Löf type theory with a universe a la Russell and t...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
AbstractIn this paper I present a partial formalisation of a normaliser for type theory in Agda [Ulf...
This thesis is about Martin-Löf’s intuitionistic theory of types (type theory). Type theory is at t...
Big step normalisation is a normalisation method for typed lambda-calculi which relies on a purely s...
We present a Tait-style proof to show that a simple functional normaliser for a combinatory version ...
For certain kinds of applications of type theories, the faithfulness of formalization in the theory ...
We prove the strong normalisation for any PTS, provided the existence of a certain-set A * (s) fo...
AbstractWe examine the interplay between computational effects and higher types. We do this by prese...
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...
Ulrich Berger presented a powerful proof of strong normalisation usingdomains, in particular it simp...
In this paper, we present an Agda formalization of a normalizer for simply-typed lambda terms. The n...
International audienceSized types have been developed to make termination checking more perspicuous,...
Abstract. We present a formal treatment of normalization by evalua-tion in type theory. The involved...
The decidability of equality is proved for Martin-Löf type theory with a universe a la Russell and t...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
AbstractIn this paper I present a partial formalisation of a normaliser for type theory in Agda [Ulf...
This thesis is about Martin-Löf’s intuitionistic theory of types (type theory). Type theory is at t...
Big step normalisation is a normalisation method for typed lambda-calculi which relies on a purely s...
We present a Tait-style proof to show that a simple functional normaliser for a combinatory version ...
For certain kinds of applications of type theories, the faithfulness of formalization in the theory ...
We prove the strong normalisation for any PTS, provided the existence of a certain-set A * (s) fo...
AbstractWe examine the interplay between computational effects and higher types. We do this by prese...
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...
Ulrich Berger presented a powerful proof of strong normalisation usingdomains, in particular it simp...
In this paper, we present an Agda formalization of a normalizer for simply-typed lambda terms. The n...
International audienceSized types have been developed to make termination checking more perspicuous,...
Abstract. We present a formal treatment of normalization by evalua-tion in type theory. The involved...
The decidability of equality is proved for Martin-Löf type theory with a universe a la Russell and t...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...