#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1972

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Peter Aczel, Nax Paul Mendler
- Category Theory and Computer Science
- 1989

We prove that every set-based functor on the category of classes has a final coalgebra. This result strengthens the final coalgebra theorem announced in the book "Non-well-founded Sets", by the first author. 1 I n t r o d u c t i o n The theorem of this note is an improvement of a result that was first stated, but not proved in its full generality, in… (More)

- Peter Aczel, Jirí Adámek, Stefan Milius, Jiri Velebil
- Theor. Comput. Sci.
- 2003

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)

Rippling is a radically new technique for the automation of mathematical reasoning. It is widely applicable whenever a goal is to be proved from one or more syntactically similar givens. The goal is manipulated to resemble the givens more closely, so that they can be used in its proof. The goal is annotated to indicate which subexpressions are to be moved… (More)

- Peter Aczel
- Ann. Pure Appl. Logic
- 2006

- Peter Aczel, Michael Barlow, +14 authors P J Scott
- 2002

Books listed below that are marked with a "t will be reviewed in a future issue. Readers who wish to review books for the journal should write, outlining their qualifications, to: Graeme Hirst, book review editor,ously, we cannot promise the availability ol." books in anyone's exact area of interest. Authors and publishers who wish their books to be… (More)

- Peter Aczel
- 1997

- 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.

- Peter Aczel
- 2008

- Peter Aczel, Jirí Adámek, Jiri Velebil
- Electr. Notes Theor. Comput. Sci.
- 2001