Results 1  10
of
29
Inductive Sets and Families in MartinLöf's Type Theory and Their SetTheoretic Semantics
 Logical Frameworks
, 1991
"... MartinLof's type theory is presented in several steps. The kernel is a dependently typed calculus. Then there are schemata for inductive sets and families of sets and for primitive recursive functions and families of functions. Finally, there are set formers (generic polymorphism) and univer ..."
Abstract

Cited by 80 (13 self)
 Add to MetaCart
(Show Context)
MartinLof's type theory is presented in several steps. The kernel is a dependently typed calculus. Then there are schemata for inductive sets and families of sets and for primitive recursive functions and families of functions. Finally, there are set formers (generic polymorphism) and universes. At each step syntax, inference rules, and settheoretic semantics are given. 1 Introduction Usually MartinLof's type theory is presented as a closed system with rules for a finite collection of set formers. But it is also often pointed out that the system is in principle open to extension: we may introduce new sets when there is a need for them. The principle is that a set is by definition inductively generated  it is defined by its introduction rules, which are rules for generating its elements. The elimination rule is determined by the introduction rules and expresses definition by primitive recursion on the way the elements of the set are generated. (In this paper I shall use the term ...
Inductive Families
 Formal Aspects of Computing
, 1997
"... A general formulation of inductive and recursive definitions in MartinLof's type theory is presented. It extends Backhouse's `DoItYourself Type Theory' to include inductive definitions of families of sets and definitions of functions by recursion on the way elements of such sets ar ..."
Abstract

Cited by 78 (13 self)
 Add to MetaCart
(Show Context)
A general formulation of inductive and recursive definitions in MartinLof's type theory is presented. It extends Backhouse's `DoItYourself Type Theory' to include inductive definitions of families of sets and definitions of functions by recursion on the way elements of such sets are generated. The formulation is in natural deduction and is intended to be a natural generalization to type theory of MartinLof's theory of iterated inductive definitions in predicate logic. Formal criteria are given for correct formation and introduction rules of a new set former capturing definition by strictly positive, iterated, generalized induction. Moreover, there is an inversion principle for deriving elimination and equality rules from the formation and introduction rules. Finally, there is an alternative schematic presentation of definition by recursion. The resulting theory is a flexible and powerful language for programming and constructive mathematics. We hint at the wealth of possible applic...
Universes for Generic Programs and Proofs in Dependent Type Theory
 Nordic Journal of Computing
, 2003
"... We show how to write generic programs and proofs in MartinL of type theory. To this end we consider several extensions of MartinL of's logical framework for dependent types. Each extension has a universes of codes (signatures) for inductively defined sets with generic formation, introductio ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
We show how to write generic programs and proofs in MartinL of type theory. To this end we consider several extensions of MartinL of's logical framework for dependent types. Each extension has a universes of codes (signatures) for inductively defined sets with generic formation, introduction, elimination, and equality rules. These extensions are modeled on Dybjer and Setzer's finitely axiomatized theories of inductiverecursive definitions, which also have a universe of codes for sets, and generic formation, introduction, elimination, and equality rules.
Indexed Containers
"... Abstract. The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical computer science community. Approaches such as polynomial types, strictly positive types and inductive types h ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
(Show Context)
Abstract. The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical computer science community. Approaches such as polynomial types, strictly positive types and inductive types have all met with some success but they tend not to cover important examples such as types with variable binding, types with constraints, nested types, dependent types etc. In order to compute with such types, we generalise from the traditional treatment of types as free standing entities to families of types which have some form of indexing. The hallmark of such indexed types is that one must usually compute not with an individual type in the family, but rather with the whole family simultaneously. We implement this simple idea by generalising our previous work on containers to what we call indexed containers and show that they cover a number of sophisticated datatypes and, indeed, other computationally interesting structures such as the refinement calculus and interaction structures. Finally, and rather surprisingly, the extra structure inherent in indexed containers simplifies the theory of containers and thereby allows for a much richer and more expressive calculus. 1
Representing Inductively Defined Sets by Wellorderings in MartinLöf's Type Theory
, 1996
"... We prove that every strictly positive endofunctor on the category of sets generated by MartinLof's extensional type theory has an initial algebra. This representation of inductively defined sets uses essentially the wellorderings introduced by MartinLof in "Constructive Mathematics and C ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
We prove that every strictly positive endofunctor on the category of sets generated by MartinLof's extensional type theory has an initial algebra. This representation of inductively defined sets uses essentially the wellorderings introduced by MartinLof in "Constructive Mathematics and Computer Programming". 1 Background MartinLof [10] introduced a general set former for wellorderings in intuitionistic type theory. It has formation rule Aset (x : A) B(x)set W x:A B(x)set introduction rule a : A (x : B(a)) b(x) : W x:A B(x) sup(a; b) : W x:A B(x) : elimination rule c : W x:A B(x) (x : A; y : B(x) !W x:A B(x); z : Q t:B(x) C(y(t))) d(x; y; z) : C(sup(a; b)) T (c; d) : C(c) and equality rule a : A (x : B(a)) b(x) : W x:A B(x) (x : A; y : B(x) !W x:A B(x); z : Q t:B(x) C(y(t))) d(x; y; z) : C(sup(a; b)) T (sup(a; b); d) = d(a; b; t:T (b(t); d) : C(c) The elimination rule can be viewed either as a rule of transfinite induction or as a rule of definition by transfinite re...
Programming interfaces and basic topology
 Annals of Pure and Applied Logic
, 2005
"... A pattern of interaction that arises again and again in programming, is a “handshake”, in which two agents exchange data. The exchange is thought of as provision of a service. Each interaction is initiated by a specific agent —the client or Angel, and concluded by the other —the server or Demon. We ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
(Show Context)
A pattern of interaction that arises again and again in programming, is a “handshake”, in which two agents exchange data. The exchange is thought of as provision of a service. Each interaction is initiated by a specific agent —the client or Angel, and concluded by the other —the server or Demon. We present a category in which the objects —called interaction structures in the paper — serve as descriptions of services provided across such handshaken interfaces. The morphisms —called (general) simulations— model components that provide one such service, relying on another. The morphisms are relations between the underlying sets of the interaction structures. The proof that a relation is a simulation can serve (in principle) as an executable program, whose specification is that it provides the service described by its domain, given an implementation of the service described by its codomain.
Universal Algebra in Type Theory
 Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs '99, volume 1690 of LNCS
, 1999
"... We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. We use setoids, i.e. ... ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
(Show Context)
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. We use setoids, i.e. ...
Higher Inductive Types in Homotopy Type Theory
"... Homotopy Type Theory (HoTT) refers to the homotopical interpretation [1] of MartinLöf’s intensional, constructive type theory (MLTT) [5], together with several new principles motivated by that interpretation. Voevodsky’s Univalent Foundations program [6] is a conception for a new foundation for mat ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Homotopy Type Theory (HoTT) refers to the homotopical interpretation [1] of MartinLöf’s intensional, constructive type theory (MLTT) [5], together with several new principles motivated by that interpretation. Voevodsky’s Univalent Foundations program [6] is a conception for a new foundation for mathematics, based on HoTT and implemented in a proof assistant like Coq [2]. Among the new principles to be added to MLTT are the Univalence Axiom [4], and the socalled higher inductive types (HITs), a new idea due to Lumsdaine and Shulman which allows for the introduction of some basic spaces and constructions from homotopy theory. For example, the ndimensional spheres S n can be implemented as HITs, in a way analogous to the implementation of the natural numbers as a conventional inductive type. Other examples include the unit interval; truncations, such as brackettypes [A]; and quotients by equivalent relations or groupoids. The combination of univalence and HITs is turning out to be a very powerful and workable system for the formalization of homotopy theory, with the recently given, formally verified proofs of some fundamental results, such as determinations of various of the homotopy groups of spheres by Brunerie and Licata. See [3] for much work in progress After briefly reviewing the foregoing developments, I will give an impredicative encoding of certain HITs on the basis of a new representation theorem, which states that every type of a particular kind is equivalent to its double dual in the space of coherent natural transformations. A realizability model is also provided, establishing the consistency of impredicative HoTT and its extension by HITs.
Specifying Interactions With Dependent Types
 In Workshop on subtyping and dependent types in programming
, 2000
"... this paper we consider how to express specications of interactions in dependent type theory. The results so far are modest, though we hope we have identied some key structures for describing contracts between independent agents, and shown how to dene them in a dependently typed framework. These are ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
this paper we consider how to express specications of interactions in dependent type theory. The results so far are modest, though we hope we have identied some key structures for describing contracts between independent agents, and shown how to dene them in a dependently typed framework. These are called below transition systems (2.2) and interaction systems (2.3). Both are coalgebras; transition systems for a functor Fam , and interaction systems for its composite with itself, Fam (Fam ). These structures seems to have interesting connections with predicate transformer semantics for imperative programs, as initiated by Dijkstra, and also with the renement calculus of Back and von Wright as described in their book [2]. We restrict attention to situations in which the system and its environment communicate by exchanging messages in strict alternation, as with the moves in a two player game.
Interactive programs and weakly final coalgebras (extended version
 Dependently typed programming, number 04381 in Dagstuhl Seminar Proceedings, 2004. Available via http://drops.dagstuhl.de/opus
"... GR/S30450/01. 2 A. Setzer, P. Hancock 1 Introduction According to MartinL"of [19]: "... I do not think that the search for logically ever more satisfactory high level programming languages can stop short of anything but ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
GR/S30450/01. 2 A. Setzer, P. Hancock 1 Introduction According to MartinL&quot;of [19]: &quot;... I do not think that the search for logically ever more satisfactory high level programming languages can stop short of anything but