Add to ORKGAbstract In a previous work, we showed the uniform continuity of definable functionals in intuitionistic type theory as an application of forcing with dependent types. The argument was constructive, and so contains implicitly an algorithm which computes a witness that a given functional is uniformly continuous. We present here such an algorithm, which provides a possible computational interpretation of forcing
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
AbstractWe solve or partially solve a number of problems of Watson concerning the preservation of no...
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. The goal of this note is to show the uniform continuity of definable functional in intu-it...
It is well-known that the Gödel’s system T definable functions (N → N) → N are continuous, and that...
International audienceWe generalize to a rich dependent type theory a proof originally developed by ...
This thesis provides a computational interpretation of type theory validating Brouwer’s uniform-cont...
Abstract—This paper presents an intuitionistic forc-ing translation for the Calculus of Construction...
We describe a way to represent computable functions between coinductive types as particular transduc...
Real world programming languages crucially depend on the availability of computational effects to ac...
This paper discusses the design of a hierarchy of structures which combine linear algebra with conce...
In this paper, we show how to integrate linear types with type dependency, by extending the linear/n...
Intuitionistic type theory (also constructive type theory or Martin-L\uf6f type theory) is a formal ...
Abstract. Paul Cohen's method of forcing, together with Saul Kripke's related semantics fo...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
AbstractWe solve or partially solve a number of problems of Watson concerning the preservation of no...
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. The goal of this note is to show the uniform continuity of definable functional in intu-it...
It is well-known that the Gödel’s system T definable functions (N → N) → N are continuous, and that...
International audienceWe generalize to a rich dependent type theory a proof originally developed by ...
This thesis provides a computational interpretation of type theory validating Brouwer’s uniform-cont...
Abstract—This paper presents an intuitionistic forc-ing translation for the Calculus of Construction...
We describe a way to represent computable functions between coinductive types as particular transduc...
Real world programming languages crucially depend on the availability of computational effects to ac...
This paper discusses the design of a hierarchy of structures which combine linear algebra with conce...
In this paper, we show how to integrate linear types with type dependency, by extending the linear/n...
Intuitionistic type theory (also constructive type theory or Martin-L\uf6f type theory) is a formal ...
Abstract. Paul Cohen's method of forcing, together with Saul Kripke's related semantics fo...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
AbstractWe solve or partially solve a number of problems of Watson concerning the preservation of no...
International audienceThis paper studies forcing translations of proofs in dependent type theory, th...