6 search results - page 1 / 2 » Eager Normal Form Bisimulation |
107
Voted
LICS
2005
IEEE
15 years 3 months 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...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
PARLE
1987
15 years 1 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...