A theory for program and data type specification

Citations of this article
Mendeley users who have this article in their library.


The theory presented here, IOCC (Impredicative theory of Operations, Control and Classes) is an essentially first-order, two-layered theory. The lower layer is a theory of program equivalence and definedness. Program primitives that can be treated within this theory include functional application and abstraction, conditional, numbers, pairing, and continuation capture and resumption. The upper layer is a theory of class membership with a general comprehension principle for defining classes. Many standard class constructions and data types can be represented naturally including algebraic abstract data types, list-, record-, and function-type constructions. In addition classes can be constructed satisfying systems of equations such as[S = A×G; G = B → S] which are useful in treating programming concepts such as streams and object behaviors. Coroutines can also be classified within this theory. Examples are given illustrating the derivation of programs using escape mechanisms, and methods for reasoning about streams and coroutines. Methods are given for constructing models of IOCC from semantic models of the underlying programming language. © 1992.




Talcott, C. (1992). A theory for program and data type specification. Theoretical Computer Science, 104(1), 129–159. https://doi.org/10.1016/0304-3975(92)90169-G

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free