|
15283
|
1 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
|
|
|
2 |
|
|
15582
|
3 |
<HTML>
|
|
|
4 |
|
|
|
5 |
<HEAD>
|
|
|
6 |
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
|
|
|
7 |
<TITLE>ZF/Coind/README</TITLE>
|
|
|
8 |
</HEAD>
|
|
|
9 |
|
|
|
10 |
<BODY>
|
|
1543
|
11 |
|
|
|
12 |
<H2>Coind -- A Coinduction Example</H2>
|
|
|
13 |
|
|
|
14 |
Jacob Frost has mechanized the proofs from the article
|
|
|
15 |
|
|
|
16 |
<P>
|
|
|
17 |
<PRE>
|
|
|
18 |
@Article{milner-coind,
|
|
|
19 |
author = "Robin Milner and Mads Tofte",
|
|
|
20 |
title = "Co-induction in Relational Semantics",
|
|
|
21 |
journal = TCS,
|
|
|
22 |
year = 1991,
|
|
|
23 |
volume = 87,
|
|
|
24 |
pages = "209--220"}
|
|
|
25 |
</PRE>
|
|
|
26 |
|
|
|
27 |
<P> It involves proving the consistency of the dynamic and static semantics
|
|
|
28 |
for a small functional language. A codatatype definition specifies values and
|
|
|
29 |
value environments in mutual recursion: non-well-founded values represent
|
|
|
30 |
recursive functions; value environments are variant functions from variables
|
|
|
31 |
into values.
|
|
|
32 |
|
|
|
33 |
<P>
|
|
|
34 |
Frost's
|
|
|
35 |
<A
|
|
1544
|
36 |
HREF="http://www.cl.cam.ac.uk/Research/Reports/TR359-jf10008-co-induction-in-isabelle.dvi.gz">report</A> describes this development.
|
|
1543
|
37 |
|
|
3279
|
38 |
</body>
|
|
|
39 |
</html>
|