Announcement

• To: types@cs.indiana.edu
• Subject: Announcement
• From: Jan Rutten <Jan.Rutten@cwi.nl>
• Date: Thu, 09 Jul 1998 16:58:42 +0200
• cc: Jan.Rutten@cwi.nl
• Delivery-Date: Thu, 09 Jul 1998 09:59:23 -0500

Would you please be so kind to distribute the
announcement below on the types network?

Many thanks in advance,  Jan Rutten
***
The following technical report is now
available at ftp.cwi.nl as pub/CWIreports/SEN/SEN-R9803.ps.Z
(also via my home page: http://www.cwi.nl/~janr).

J.J.M.M. Rutten 
Automata and Coinduction (an exercise in coalgebra)
Technical Report SEN-R9803, CWI, Amsterdam, 1998.

Abstract:
The classical theory of deterministic automata 
is presented in terms of the notions of
homomorphism and bisimulation, which are the cornerstones
of the theory of (universal) coalgebra.
This leads to a transparent and uniform presentation
of automata theory and yields some new insights,
amongst which coinduction proof methods
for language equality and language inclusion.
At the same time, the present treatment of
automata theory may serve as an introduction to coalgebra.

• Prev: Re: Type names vs type structure
• Next: A PhD thesis on type inference with subtyping
• Index(es):
  • Main
  • Thread