650 search results - page 1 / 130 » Logical Bisimulations and Functional Languages |
72
Voted
FSEN
2007
Springer
15 years 4 months ago
2007
Springer
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
91
Voted
LICS
1999
IEEE
15 years 2 months ago
1999
IEEE
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...
178
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
101
Voted
POPL
2012
ACM
13 years 5 months ago
2012
ACM
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
94
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...