Dependent types are types which unlike simple types, such as products, function spaces, or natural numbers, depend on or vary with values. An example of a dependent type is a type of vectors or arrays Ve
Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new type-level progra...
Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new type-level progra...
In this talk, we discuss the role and the implementation of mathematical structures in libraries of ...
Abstract. In our approach we consider programming as logical reasoning over type theory of a given s...
In these lecture notes we give an introduction to functional programming with dependent types. We us...
In this note, we discuss how to introduce dependent types into the Lambek calculus [7] (or, in gener...
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...
We present a theory of dependent types with explicit substitutions. We follow a meta-theoretical app...
Real world programming languages crucially depend on the availability of computational effects to ac...
The mechanism for declaring datatypes in functional programming languages such as ML and Haskell is ...
We discuss different ways to represent the syntax of dependent types using Martin-Lof type theory as...
We design and study #Obj, a calculus and dependent type system for objects and classes which can hav...
Abstract. Dependent type theory is rich enough to express that a pro-gram satisfies an input/output ...
The paper proposes a new semantics with dependent types for indefinites, encompassing both the data ...
Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new type-level progra...
Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new type-level progra...
In this talk, we discuss the role and the implementation of mathematical structures in libraries of ...
Abstract. In our approach we consider programming as logical reasoning over type theory of a given s...
In these lecture notes we give an introduction to functional programming with dependent types. We us...
In this note, we discuss how to introduce dependent types into the Lambek calculus [7] (or, in gener...
Abstract. Dependent types are useful for statically checking detailed specifications of programs and...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...
We present a theory of dependent types with explicit substitutions. We follow a meta-theoretical app...
Real world programming languages crucially depend on the availability of computational effects to ac...
The mechanism for declaring datatypes in functional programming languages such as ML and Haskell is ...
We discuss different ways to represent the syntax of dependent types using Martin-Lof type theory as...
We design and study #Obj, a calculus and dependent type system for objects and classes which can hav...
Abstract. Dependent type theory is rich enough to express that a pro-gram satisfies an input/output ...
The paper proposes a new semantics with dependent types for indefinites, encompassing both the data ...
Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new type-level progra...
Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new type-level progra...
In this talk, we discuss the role and the implementation of mathematical structures in libraries of ...
DOI
Add to ORKG