Add to ORKGContains fulltext : 161450.pdf (preprint version ) (Open Access)TYPES 2016 : 22nd International Conference on Types for Proofs and Programs, Novi Sad, Serbia, 23-26 May 201
peer reviewedChurch’s type theory, aka simple type theory, is a formal logical language which includ...
Contains fulltext : 175392.pdf (publisher's version ) (Open Access
We describe a way to represent computable functions between coinductive types as particular transduc...
Contains fulltext : 161438.pdf (preprint version ) (Open Access)LICS 2016 : Thirty...
Contains fulltext : 104054.pdf (preprint version ) (Open Access)1992 Workshop on T...
In this paper, I establish the categorical structure necessary to interpret dependent inductive and ...
Contains fulltext : 143633.pdf (preprint version ) (Open Access
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...
In this talk, we discuss the role and the implementation of mathematical structures in libraries of ...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
Contains fulltext : 197722.pdf (publisher's version ) (Open Access)336 p
We give a short introduction to Martin-L\uf6f\u27s Type Theory, seen as a theory of inductive defini...
International audienceBuilding on the recent extension of dependent type theory with a universe of d...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...
International audienceDependent Type Theory as implemented into proof assistants and programming lan...
peer reviewedChurch’s type theory, aka simple type theory, is a formal logical language which includ...
Contains fulltext : 175392.pdf (publisher's version ) (Open Access
We describe a way to represent computable functions between coinductive types as particular transduc...
Contains fulltext : 161438.pdf (preprint version ) (Open Access)LICS 2016 : Thirty...
Contains fulltext : 104054.pdf (preprint version ) (Open Access)1992 Workshop on T...
In this paper, I establish the categorical structure necessary to interpret dependent inductive and ...
Contains fulltext : 143633.pdf (preprint version ) (Open Access
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...
In this talk, we discuss the role and the implementation of mathematical structures in libraries of ...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
Contains fulltext : 197722.pdf (publisher's version ) (Open Access)336 p
We give a short introduction to Martin-L\uf6f\u27s Type Theory, seen as a theory of inductive defini...
International audienceBuilding on the recent extension of dependent type theory with a universe of d...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...
International audienceDependent Type Theory as implemented into proof assistants and programming lan...
peer reviewedChurch’s type theory, aka simple type theory, is a formal logical language which includ...
Contains fulltext : 175392.pdf (publisher's version ) (Open Access
We describe a way to represent computable functions between coinductive types as particular transduc...