T. Winkler

C Proof of Theorem 4 . 1 a Proof of Theorem 3 . 1

R. Milner, M. Gordon, J. Goguen, 1994 .

5 Concluding Remarks 4 a Semantics for Oodb 4.1 Schemas and Databases 4.2 Inheritance State $ Term $ Proposition Transition $ Rewriting $ Deduction 3.4 Initial Model Semantics

J. Thatcher, H. Kirchner, J. Meseguer, 1993 .

An Introduction to OBJ 3

José Meseguer, Claude Kirchner, Hélène Kirchner, 1988, CTRS.

Denotational semantics and rewrite rules for FP

Joseph Y. Halpern, John H. Williams, Edward L. Wimmers, 1985, POPL.

Programming in OBJ and Maude

Timothy C. Winkler, T. Winkler, 1993, Functional Programming, Concurrency, Simulation and Automated Reasoning.

Simulation and performance estimation for the Rewrite Rule Machine

Joseph A. Goguen, B. Taheri, Patrick Lincoln, 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

Parallel Programmming in Maude

José Meseguer, Timothy C. Winkler, J. Meseguer, 1991, Research Directions in High-Level Parallel Programming Languages.

The Rewrite Rule Machine Project

Joseph A. Goguen, Hitoshi Aida, José Meseguer, 1989 .

THE REWRITE RULE MACHINE, 1988

Joseph A. Goguen, José Meseguer, Sany Leinwand, 1989 .

Approximate Reasoning About the Semantic Effects of Program Changes

Timothy C. Winkler, Mark Moriconi, M. Moriconi, 1990, IEEE Trans. Software Eng..

Constant-Only Multiplicative Linear Logic is NP-Complete

Patrick Lincoln, Timothy C. Winkler, P. Lincoln, 1992, Theor. Comput. Sci..