Add to ORKGAbstract. The goal of this note is to show the uniform continuity of definable functional in intu-itionistic type theory as an application of forcing with dependent type theory
International audienceWe define a monadic translation of type theory, called weaning translation, th...
Abstract. In our approach we consider programming as logical reasoning over type theory of a given s...
International audienceThis paper studies forcing translations of proofs in dependent type theory, th...
In a previous work, we showed the uniform continuity of definable functionals in intuitionistic type...
Abstract In a previous work, we showed the uniform continuity of definable functionals in intuitioni...
International audienceWe generalize to a rich dependent type theory a proof originally developed by ...
It is well-known that the Gödel’s system T definable functions (N → N) → N are continuous, and that...
Contains fulltext : 161450.pdf (preprint version ) (Open Access)TYPES 2016 : 22nd ...
One may formulate the dependent product types of Martin-Löf type theory either in terms of abstracti...
International audienceBuilding on the recent extension of dependent type theory with a universe of d...
This paper discusses the design of a hierarchy of structures which combine linear algebra with conce...
Using definability of types for stable formulas, one develops the powerful tools of stability theory...
We describe a way to represent computable functions between coinductive types as particular transduc...
In this paper, we show how to integrate linear types with type dependency, by extending the linear/n...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
International audienceWe define a monadic translation of type theory, called weaning translation, th...
Abstract. In our approach we consider programming as logical reasoning over type theory of a given s...
International audienceThis paper studies forcing translations of proofs in dependent type theory, th...
In a previous work, we showed the uniform continuity of definable functionals in intuitionistic type...
Abstract In a previous work, we showed the uniform continuity of definable functionals in intuitioni...
International audienceWe generalize to a rich dependent type theory a proof originally developed by ...
It is well-known that the Gödel’s system T definable functions (N → N) → N are continuous, and that...
Contains fulltext : 161450.pdf (preprint version ) (Open Access)TYPES 2016 : 22nd ...
One may formulate the dependent product types of Martin-Löf type theory either in terms of abstracti...
International audienceBuilding on the recent extension of dependent type theory with a universe of d...
This paper discusses the design of a hierarchy of structures which combine linear algebra with conce...
Using definability of types for stable formulas, one develops the powerful tools of stability theory...
We describe a way to represent computable functions between coinductive types as particular transduc...
In this paper, we show how to integrate linear types with type dependency, by extending the linear/n...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
International audienceWe define a monadic translation of type theory, called weaning translation, th...
Abstract. In our approach we consider programming as logical reasoning over type theory of a given s...
International audienceThis paper studies forcing translations of proofs in dependent type theory, th...