#### Filter Results:

#### Publication Year

1986

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Inÿnite trees form a free completely iterative theory over any given signature—this fact, proved by Elgot, Bloom and Tindell, turns out to be a special case of a much more general categorical result exhibited in the present paper. We prove that whenever an endofunctor H of a category has ÿnal coalgebras for all functors H () + X , then those coalgebras, TX… (More)

- Peter Aczel
- TYPES
- 1998

Introduction The original motivation 1 for the work described in this paper was to determine the proof theoretic strength of the type theories implemented in the proof development systems Lego and Coq, Luo and Pollack 92, Barras et al 96]. These type theories combine the impredicative type of propositions 2 , from the calculus of constructions, Coquand 90],… (More)

- Peter Aczel
- MFPS
- 1993

We describe the nal universe approach to the character-isation of semantic universes and illustrate it by giving char-acterisations of the universes of CCS and CSP processes.

We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive.… (More)

We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable… (More)

- Peter Aczel
- LICS
- 1991

This paper gives a generalisation of a version of order sorted logic and an abstract axiomatic setting for the treatment of substitution. The two ideas are shown to be related, an equational speciication of term declaration logic being a presentation of a nitary generalised compositum. The axiomatic approach to substitution is compared with some others.