CPO models for infinite term rewriting (1995)

Cached

Download Links

by Andrea Corradini , Fabio Gadducci
Venue:in Proc. AMAST'95, LNCS 936
Citations:10 - 7 self

Documents Related by Co-Citation

50 Computational semantics of term rewriting systems – G Boudol - 1985
472 Conditional rewriting logic as a unified model of concurrency – J Meseguer - 1992
184 Initial algebra semantic and continuous algebras – J Goguen, J Thatcher, E Wagner, J Wright - 1977
21 Rational Term Rewriting – A. Corradini, F. Gadducci - 1998
34 An algebraic semantics for structured transition systems and its application to logic programs – A Corradini, U Montanari - 1992
12 Axiomatizing permutation equivalence in the - calculus – C Laneve, U Montanari - 1992
20 (Cyclic) Term Graph Rewriting is adequate for Rational Parallel Term Rewriting – Andrea Corradini , Frank Drewes - 1997
364 Process algebra for synchronous communication – J. A. Bergstra, J. W. Klop - 1984
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
3219 Communication and Concurrency – R Milner - 1990
16 An abstract formulation for rewrite systems – A J Power - 1989
166 Functorial Semantics of Algebraic Theories – F W Lawvere - 1963
71 Equational term graph rewriting – Zena M. Ariola, Jan Willem Klop - 1996
381 BASIC CONCEPTS OF ENRICHED CATEGORY THEORY – G. M. Kelly - 2005
24 On The Algebraic Approach To Concurrent Term Rewriting – Fabio Gadducci - 1996
4 Relating Two Categorical Models of Concurrency – A Corradini, F Gadducci, U Montanari - 1995
73 Compositionality through an operational semantics of contexts – K G Larsen, X Liu - 1991
89 Turning SOS Rules into Equations – Luca Aceto, Bard Bloom, Frits Vaandrager - 1994
147 Rewriting Logic as a Logical and Semantic Framework – Narciso Martí-Oliet, José Meseguer - 1993