1557 search results - page 4 / 312 » Programming up to Congruence |
169
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
179
click to vote
ICLP
1995
Springer
15 years 10 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
182
click to vote
LICS
2005
IEEE
16 years 22 hour ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
153
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
151
Voted
ENTCS
2007
15 years 6 months ago
2007
Operational semantics for programming languages usually come in two flavours: big-step and small-step. Both are defined using deduction rules with a congruence rule allowing redu...