Congruences Peter Sewell Computer Laboratory, University of Cambridge, New...  Home/Search
Context
Related
| cl.cam.ac.uk/~pes2...abelstcsfinal.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cl.cam.ac.uk/~pes20/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The dynamics of many calculi can be most clearly de ned by a reduction semantics. To work with a calculus, however, an understanding of operational congruences is fundamental; these can often be given tractable de nitions or characterisations using a labelled transition semantics. This paper considers calculi with arbitrary reduction semantics of three simple classes, rstly ground term rewriting, then left-linear term rewriting, and then a class which is essentially the action calculi... (Update)
Similar documents (at the sentence level):
32.4%: Unknown - (Correct)
27.8%: From Rewrite Rules to Bisimulation Congruences - Sewell (1998) (Correct)
Active bibliography (related documents): More All
0.2: The Local Area π-Calculus - Chothia (2003) (Correct)
0.2: Vertical Bisimulation - Rensink, Gorrieri (1998) (Correct)
0.2: Order Isomorphism Does Not Preserve Global Event Independence - Rensink (1993) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ sewell-from,
author = "Congruences Peter Sewell",
title = "From Rewrite Rules to Bisimulation",
url = "citeseer.ist.psu.edu/765362.html" }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin - 1981
854 Information and Computation (context) - Milner, Parrow et al. - 1992
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
254 Theoretical Computer Science (context) - erard, erard et al. - 1992
248 Expressing Mobility (context) - Sangiorgi - 1993
197 Barbed bisimulation - Milner, Sangiorgi - 1992
194 Functions as processes (context) - Milner - 1992
182 Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1992
149 Testing equivalences for processes (context) - De Nicola, Hennessy - 1984
140 On reduction-based process semantics - Honda, Yoshida - 1995
130 Full abstraction in the lazy lambda calculus (context) - Abramsky, Ong - 1993
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1995
116 A typed language for distributed mobile processes - Riely, Hennessy - 1998
112 Bisimilarity as a theory of functional programming (context) - Gordon - 1995
94 Equality in lazy computation systems - Howe - 1989
89 Calculi for interaction - Milner - 1996
67 Towards a mathematical operational semantics - Turi, Plotkin - 1997
64 Turning SOS rules into equations - Aceto, Bloom et al. - 1994
50 A calculus of communicating systems with labelpassing - Engberg, Nielsen - 1986
50 From rewrite rules to bisimulation congruences - Sewell - 1998
50 From rewrite rules to bisimulation congruences - Sewell - 1998
49 The tile model - Gadducci, Montanari - 1999
45 A theory of weak bisimulation for core CML - Ferreira, Hennessy et al. - 1996
42 Globallocal subtyping and capability inference distributed .. - Global, subtyping et al. - 1998
36 Higher-level synchronising devices in meije{SCCS (context) - de Simone - 1985
31 calculus in direct style (context) - erard, The - 1997
30 A calculus for cryptographic protocols: The spi calculus (context) - Abadi, Gordon - 1997
28 Constraints for free in concurrent computation - Niehren, Mueller - 1995
28 On implementations and semantics of a concurrent programming.. - Sewell - 1997
28 Mobile ambients (context) - Cardelli, Gordon - 1998
25 A congruence theorem for structured operational semantics of.. - Bernstein - 1998
24 progressing bisimulation for CCS (context) - Montanari, Sassone et al. - 1992
22 the SECD-machine and the -calculus (context) - Felleisen, Friedman - 1986
22 Bisimilarity of open terms - Rensink - 1997
21 branching time spectrum (context) - van Glabbeek, time - 1990
14 A categorical axiomatics for bisimulation - Cattani, Power et al. - 1998
14 Bisimilarity for a rst-order calculus of objects with subtyp.. (context) - Gordon, Rees - 1996
14 University of Edinburgh (context) - Mifsud, PhD - 1996
9 Con uence and Normalisation for Higher-Order Rewriting (context) - van Raamsdonk - 1996
6 The re exive CHAM and the joincalculus (context) - edric, Georges - 1996
5 branching time spectrum II; the semantics of sequential syst.. (context) - van Glabbeek, time - 1993
2 A new computational model and its discipline of programming (context) - Ban, Daniel et al. - 1986
Documents on the same site (http://www.cl.cam.ac.uk/~pes20/): More
Design Rules and Abstractions (from branching and real time) - Sewell (1996) (Correct)
Global/Local Subtyping for a Distributed π-calculus - Sewell (1997) (Correct)
On Implementations and Semantics of a Concurrent Programming.. - Sewell (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC