Sciweavers

9 search results - page 1 / 2
» Towards a Theory of Bisimulation for Local Names
Sort
View
LICS
1999
IEEE
13 years 9 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
LICS
2000
IEEE
13 years 9 months ago
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
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...
Alan Jeffrey, Julian Rathke
ENTCS
2002
108views more  ENTCS 2002»
13 years 4 months ago
Bisimulation Relations for Dynamical and Control Systems
In this paper we propose a new equivalence relation for dynamical and control systems called bisimulation. As the name implies this definition is inspired by the fundamental notio...
Esfandiar Haghverdi, Paulo Tabuada, George J. Papp...
PROCOMET
1998
13 years 6 months ago
Bisimulations in the join-calculus
We develop a theory of bisimulations in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and discuss the impact o...
Michele Boreale, Cédric Fournet, Cosimo Lan...
BIRTHDAY
2003
Springer
13 years 10 months ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg