Co-induction in semantics relational

Milner, R. and M. Tofte, Co-induction in relational semantics, Theoretical Computer Science 87 (1991) 209-220. An application of the mathematical theory of maximum fixed points of monotonic set operators to relational semantics is presented. It is shown how an important proof method which we call co-induction, a variant of Park's (1969) principle of fixpoint induction, can be used to prove the consistency of the static and the dynamic relational semantics of a small functional programming language with recursive functions.

[1]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[2]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

[3]  Mads Tofte,et al.  Type Inference for Polymorphic References , 1990, Inf. Comput..

[4]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[5]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[6]  M. Tofte.  Operational Semantics and Polymorphic Type Inference , 1988 .

[7]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[8]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[9]  Luís Damas,et al.  Type assignment in programming languages , 1984 .

[10]  Gilles Kahn,et al.  Natural Semantics , 1987, STACS.