DOIAbstract
AbstractWe present a simple type-checker for a language with dependent types and let expressions, with a simple proof of correctness
AbstractWe present a simple type-checker for a language with dependent types and let expressions, with a simple proof of correctness
This paper presents the design of ZOMBIE, a dependently-typed programming language that uses an adap...
People writing proofs or programs in dependently typed languages can omit some function arguments in...
Dependent type theory is a powerful language for writing functional programs with very precise types...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
AbstractWe present a simple type-checker for a language with dependent types and let expressions, wi...
While dependent types can allow programmers to verify properties of their programs, implementing a t...
The definition of type equivalence is one of the most important design issues for any typed language...
International audienceIn this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) c...
AbstractWe analyze a partial type checking algorithm for the inconsistent domain-free pure type syst...
The expressiveness of dependent type theory can be extended by identifying types modulo some additio...
Research in dependent type theories [ML71a] has, in the past, concentrated on its use in the present...
Dependent type theories are a kind of mathematical foundations investigated both for the formalisati...
The relationship between a type system’s specification and the implementation of the type checker is...
Programming languages based on dependent type theory promise two great advances: flexibility and sec...
International audienceThe expressiveness of dependent type theory can beextended by identifying type...
This paper presents the design of ZOMBIE, a dependently-typed programming language that uses an adap...
People writing proofs or programs in dependently typed languages can omit some function arguments in...
Dependent type theory is a powerful language for writing functional programs with very precise types...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
AbstractWe present a simple type-checker for a language with dependent types and let expressions, wi...
While dependent types can allow programmers to verify properties of their programs, implementing a t...
The definition of type equivalence is one of the most important design issues for any typed language...
International audienceIn this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) c...
AbstractWe analyze a partial type checking algorithm for the inconsistent domain-free pure type syst...
The expressiveness of dependent type theory can be extended by identifying types modulo some additio...
Research in dependent type theories [ML71a] has, in the past, concentrated on its use in the present...
Dependent type theories are a kind of mathematical foundations investigated both for the formalisati...
The relationship between a type system’s specification and the implementation of the type checker is...
Programming languages based on dependent type theory promise two great advances: flexibility and sec...
International audienceThe expressiveness of dependent type theory can beextended by identifying type...
This paper presents the design of ZOMBIE, a dependently-typed programming language that uses an adap...
People writing proofs or programs in dependently typed languages can omit some function arguments in...
Dependent type theory is a powerful language for writing functional programs with very precise types...
Add to ORKG