## A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages (1997)

### Cached

### Download Links

- [dpelab.cs.depaul.edu]
- [dpelab.cs.depaul.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 36 - 0 self |

### BibTeX

@INPROCEEDINGS{Bernstein97acongruence,

author = {Karen L. Bernstein},

title = {A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages},

booktitle = {},

year = {1997},

pages = {153--164},

publisher = {IEEE Computer Society Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we describe the promoted tyft/tyxt rule format for defining higher-order languages. The rule format is a generalization of Groote and Vaandrager 's tyft/tyxt format in which terms are allowed as labels on transitions in rules. We prove that bisimulation is a congruence for any language defined in promoted tyft/tyxt format and demonstrate the usefulness of the rule format by presenting promoted tyft/tyxt definitions for the lazy -calculus, CHOCS and the ß-calculus. 1 Introduction For a programming language definition that uses bisimulation as the notion of equivalence, it is desirable for the bisimulation relation to be compatible with the language constructs; i.e. that bisimulation be a congruence. Several rule formats have been defined, so that as long as a definition satisfies certain syntactic constraints, then the defined bisimulation relation is guaranteed to be a congruence. However these rule formats have not been widely used for defining languages with higher-...

### Citations

995 | A calculus of mobile processes
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...itable for defining higher-order languages, and we demonstrate the expressiveness of the rule format by giving promoted tyft/tyxt definitions for the lazy -calculus, CHOCS [Tho95] and the ��-calcu=-=lus [MPW92]-=-. Although not presented here, the definition of a small strict functional language from [BS95] is also in promoted tyft/tyxt format. The main result of this paper is that for any language defined in ... |

655 |
Concurrency and automata on infinite sequences
- Park
- 1981
(Show Context)
Citation Context ...d if it contains only closed transitions. A transition system (TS) is a structure (S; T ) where: S is a set of states and T is a set of transition relations over S. We use (strong) bisimulation as in =-=[Par81]-=-. Let A = (S; T ) be a transition system, and R ` S \Theta S a symmetric relation. R is a (strong) bisimulation if for all s; s 0 ; t; a 2 S it satisfies, for all labeled transitions ! 2 R : (s R t an... |

258 | Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms - Sangiorgi - 1992 |

239 | The lazy lambda calculus
- Abramsky
- 1990
(Show Context)
Citation Context ...redicates have made the rule formats of greater practical use [Gro93, BV93, Ver95, BG96]. Abramsky was the first to use bisimulation as the notion of equivalence for a functional programming language =-=[Abr90]-=- and this style of definition is now often used for languages with higher-order features [San92, CG95, FHJ96, Jef95, Gor95, GR96]. These definitions typically prove that bisimulation is a congruence b... |

194 |
Bisimulation can’t be traced
- Bloom, Istrail, et al.
- 1995
(Show Context)
Citation Context ...regard to the congruence property for bisimulation. Rule formats such as de Simone's format [dS85], the tyft/tyxt by Groote and Vaandrager [GV92], and the GSOS rule format by Bloom, Istrael and Meyer =-=[BIM95]-=- guarantee that bisimulation is a congruence. Extensions of these rule formats for including negative premises and predicates have made the rule formats of greater practical use [Gro93, BV93, Ver95, B... |

120 | Bisimilarity as a theory of functional programming - Gordon - 1995 |

115 | Transition system specifications with negative premises - Groote - 1993 |

115 |
A calculus of higher order communicating systems
- Thomsen
- 1989
(Show Context)
Citation Context ...a new rule format that is suitable for defining higher-order languages, and we demonstrate the expressiveness of the rule format by giving promoted tyft/tyxt definitions for the lazy -calculus, CHOCS =-=[Tho95] and-=- the ��-calculus [MPW92]. Although not presented here, the definition of a small strict functional language from [BS95] is also in promoted tyft/tyxt format. The main result of this paper is that ... |

108 | A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing 2 (2), 274–302. A. Proof of Theorem 9 We show that the problem of deciding whether a universal two-counter machine diverges on inp - Verhoef - 1995 |

106 | Proving congruence of bisimulation in functional programming languages
- Howe
- 1996
(Show Context)
Citation Context ...mats for process algebras have not been useful in general for defining these higher-order languages. These definition typically prove that bisimulation is a congruence by using Howe's proof technique =-=[How96]-=-. The previous proposals for rule formats for languages with high-order features all define substitution as part of the meta-theory and often rely on a particular bisimulation relation (not bisimilari... |

74 | The meaning of negative premises in transition system specifications - Bol, Groote - 1996 |

63 | Higher-level synchronising devices in Meije-SCCS
- Simone
- 1985
(Show Context)
Citation Context ...ages, extensive work has been done in metatheories for SOS definitions of process algebras, especially with regard to the congruence property for bisimulation. Rule formats such as de Simone's format =-=[dS85]-=-, the tyft/tyxt by Groote and Vaandrager [GV92], and the GSOS rule format by Bloom, Istrael and Meyer [BIM95] guarantee that bisimulation will be a congruence. Extensions of these rule formats for inc... |

53 | The lazy lambda calculus in a concurrency scenario - Sangiorgi - 1994 |

43 | Bisimilarity for first-order calculus of objects with subtyping - Gordon, Rees - 1996 |

42 |
A theory of bisimulation for the -calculus
- Sangiorgi
- 1993
(Show Context)
Citation Context ...ulus 5 The ��-Calculus In this section, we will present a promoted tyft/tyxt definition for the ��-calculus and show that it is transition equivalent to Sangiorgi's definition with open bisimu=-=lation. [San96]. Th-=-e syntax of our language is: P ::= 0 j ��:P j y(x):P j yx:P j [x = y]P j P 1 + P 2 j P 1 jP 2 j !P j (x)P We will use \Gamma to represent an input, an output, or a silent move. \Gamma ::= a(b) j a... |

39 | A theory of weak bisimulation for core CML - Ferreira, Hennessy, et al. - 1998 |

10 | A sound metalogical semantics for input/output effects - Crole, Gordon - 1994 |

7 |
Friiso Groote and Frits Vaandrager, Structured operational semantics and bisimulation as a congruence
- Jan
(Show Context)
Citation Context ...ies for SOS definitions of process algebras, especially with regard to the congruence property for bisimulation. Rule formats such as de Simone's format [dS85], the tyft/tyxt by Groote and Vaandrager =-=[GV92]-=-, and the GSOS rule format by Bloom, Istrael and Meyer [BIM95] guarantee that bisimulation will be a congruence. Extensions of these rule formats for including negative premises and predicates have ma... |

6 | Operational semantics of a focusing debugger
- Bernstein, Stark
- 1995
(Show Context)
Citation Context ...rmat by giving promoted tyft/tyxt definitions for the lazy -calculus, CHOCS [Tho95] and the ��-calculus [MPW92]. Although not presented here, the definition of a small strict functional language f=-=rom [BS95]-=- is also in promoted tyft/tyxt format. The main result of this paper is that for any language defined in promoted tyft/tyxt format, bisimulation is a congruence. To make the existing definitions for t... |

6 | A fully abstract semantics for a nondeterministic functional language with monadic types - Jeffrey - 1995 |

2 | Metatheory of the -calculus - Weber, Bloom - 1996 |

1 | A conservative look at term deduction systems and variable binding. Technical report, Centrum voor Wiskunde en Informatica (CWI - Fokkink, Verhoef - 1997 |