Add to ORKGAbstract. In our approach we consider programming as logical reasoning over type theory of a given solved problem. In our paper we follow our work with describing dependent type theory categorically. We introduce dependent types as families of types indexed by terms and we provide rules of dependent type calculus. We describe indexing in terms of special functors, fibration
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
We give an account of the basic combinatorial structure underlying the notion of type dependency. We...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...
Abstract. Dependent type theory is rich enough to express that a pro-gram satisfies an input/output ...
Dependent type theory is rich enough to express that a program satisfies an input/output relational ...
Real world programming languages crucially depend on the availability of computational effects to ac...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
In these lecture notes we give an introduction to functional programming with dependent types. We us...
In this paper, I establish the categorical structure necessary to interpret dependent inductive and ...
In this talk, we discuss the role and the implementation of mathematical structures in libraries of ...
This paper discusses the design of a hierarchy of structures which combine linear algebra with conce...
We define a dependent programming language in which programmers can define and compute with domain-s...
Dependent types are types which unlike simple types, such as products, function spaces, or natural n...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
In this note, we discuss how to introduce dependent types into the Lambek calculus [7] (or, in gener...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
We give an account of the basic combinatorial structure underlying the notion of type dependency. We...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...
Abstract. Dependent type theory is rich enough to express that a pro-gram satisfies an input/output ...
Dependent type theory is rich enough to express that a program satisfies an input/output relational ...
Real world programming languages crucially depend on the availability of computational effects to ac...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
In these lecture notes we give an introduction to functional programming with dependent types. We us...
In this paper, I establish the categorical structure necessary to interpret dependent inductive and ...
In this talk, we discuss the role and the implementation of mathematical structures in libraries of ...
This paper discusses the design of a hierarchy of structures which combine linear algebra with conce...
We define a dependent programming language in which programmers can define and compute with domain-s...
Dependent types are types which unlike simple types, such as products, function spaces, or natural n...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
In this note, we discuss how to introduce dependent types into the Lambek calculus [7] (or, in gener...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
We give an account of the basic combinatorial structure underlying the notion of type dependency. We...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...