A Co-induction Principle for Recursively Defined Domains

A Co-induction Principle for Recursively Defined Domains (0)

Cached

Download Links

[ftp.cl.cam.ac.uk]
[www.cl.cam.ac.uk]

Other Repositories/Bibliography

DBLP

by Andrew Pitts

Venue:	Theoretical Computer Science
Citations:	40 - 3 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Co-induction Principle for Recursively Defined Domains	user correction - Legacy Corrections
AUTHOR NAME	Andrew Pitts	user correction - Legacy Corrections
AUTHOR AFFIL	University of Cambridge Computer Laboratory; New Museums Site, Pembroke	user correction - Legacy Corrections
AUTHOR ADDR	Street; Cambridge CB2 3QG, England	user correction - Legacy Corrections
ABSTRACT	This paper establishes a new property of predomains recursively defined using the cartesian product, disjoint union, partial function space and convex powerdomain constructors. We prove that the partial order on such a recursive predomain D is the greatest fixed point of a certain monotone operator associated to D. This provides a structurally defined family of proof principles for these recursive predomains: to show that one element of D approximates another, it suffices to find a binary relation containing the two elements that is a post-fixed point for the associated monotone operator. The statement of the proof principles is independent of any of the various methods available for explicit construction of recursive predomains. Following Milner and Tofte [10], the method of proof is called co-induction. It closely resembles the way bisimulations are used in concurrent process calculi [9]. Two specific instances of the co-induction principle already occur in work of Abramsky [2, 1] i...	user correction - Legacy Corrections
YEAR	0	user correction - Legacy Corrections
VENUE	Theoretical Computer Science	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
VOLUME	124	INFERENCE
TECH	Technical Report 252	INFERENCE
CITATIONS	20 found	ParsCit 1.0