Add to ORKGEliminating the problems of hidden-lambda insertion Restricting implicit arguments for increased predictability of type checking in a functional programming language with dependent type
System F-less than or equal to is an extension of second-order typed lambda calculus, where a subtyp...
We present Turnstile+, a high-level, macros-based metaDSL for building dependently typed languages. ...
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...
A dependently typed functional programming language is implemented with row polymorphism and extensi...
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer ...
Dependently typed programming languages provide a powerful tool for proving code correct. However, t...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...
The ML programming language restricts type polymorphism to occur only in the "let-in" construct and ...
We propose a novel type inference algorithm for a dependently-typed functional language. The novel f...
International audienceWe present a new, completely redesigned, version of F*, a language that works ...
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
Types express a program's meaning, and checking types ensures that a program has the intended meanin...
English version of my PhD thesis.We study the properties, in particular termination, of dependent ty...
Supporting dependently typed functional programming with proof automation and testin
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
System F-less than or equal to is an extension of second-order typed lambda calculus, where a subtyp...
We present Turnstile+, a high-level, macros-based metaDSL for building dependently typed languages. ...
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...
A dependently typed functional programming language is implemented with row polymorphism and extensi...
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer ...
Dependently typed programming languages provide a powerful tool for proving code correct. However, t...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...
The ML programming language restricts type polymorphism to occur only in the "let-in" construct and ...
We propose a novel type inference algorithm for a dependently-typed functional language. The novel f...
International audienceWe present a new, completely redesigned, version of F*, a language that works ...
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
Types express a program's meaning, and checking types ensures that a program has the intended meanin...
English version of my PhD thesis.We study the properties, in particular termination, of dependent ty...
Supporting dependently typed functional programming with proof automation and testin
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
System F-less than or equal to is an extension of second-order typed lambda calculus, where a subtyp...
We present Turnstile+, a high-level, macros-based metaDSL for building dependently typed languages. ...
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...