AbstractWe extend Martin-Löf's Logical Framework with special constructions and typing rules providing internalized parametricity. Compared to previous similar proposals, this version comes with a denotational semantics which is a refinement of the standard presheaf semantics of dependent type theory. Further, this presheaf semantics is a refinement of the one used to interpret nominal sets with restrictions. The present calculus is a candidate for the core of a proof assistant with internalized parametricity
Abstract. We introduce a new kind of models for constructive set theories based on categories of pre...
We develop normalisation by evaluation (NBE) for dependent types based onpresheaf categories. Our co...
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...
We extend Martin-L\uf6f\u27s Logical Framework with special constructions and typing rules providing...
AbstractWe extend Martin-Löf's Logical Framework with special constructions and typing rules providi...
Parametricity results have recently been proved for dependently-typed calculi such as the Calculus o...
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...
Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions ca...
Abstract—Reynolds ’ abstraction theorem has recently been extended to lambda-calculi with dependent ...
Reynolds\u27 abstraction theorem has recently been extended to lambda-calculi with dependent types. ...
Reynolds\u27 abstraction theorem shows how a typing judgement in System F can be translated into a r...
Reynolds\u27 abstraction theorem shows how a typingjudgement in System F can be translated into a re...
Parametricity results have recently been proved for dependently-typed calculi such as the Calculus o...
We give the first relationally parametric model of the extensional calculus of constructions. Our mo...
Abstract. We introduce a new kind of models for constructive set theories based on categories of pre...
We develop normalisation by evaluation (NBE) for dependent types based onpresheaf categories. Our co...
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...
We extend Martin-L\uf6f\u27s Logical Framework with special constructions and typing rules providing...
AbstractWe extend Martin-Löf's Logical Framework with special constructions and typing rules providi...
Parametricity results have recently been proved for dependently-typed calculi such as the Calculus o...
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...
Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions ca...
Abstract—Reynolds ’ abstraction theorem has recently been extended to lambda-calculi with dependent ...
Reynolds\u27 abstraction theorem has recently been extended to lambda-calculi with dependent types. ...
Reynolds\u27 abstraction theorem shows how a typing judgement in System F can be translated into a r...
Reynolds\u27 abstraction theorem shows how a typingjudgement in System F can be translated into a re...
Parametricity results have recently been proved for dependently-typed calculi such as the Calculus o...
We give the first relationally parametric model of the extensional calculus of constructions. Our mo...
Abstract. We introduce a new kind of models for constructive set theories based on categories of pre...
We develop normalisation by evaluation (NBE) for dependent types based onpresheaf categories. Our co...
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...