Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity

DOI10.1016/j.entcs.2009.07.098zbMath1337.68187OpenAlexW2160129419MaRDI QIDQ2805166

Paul Blain Levy, Kidane Yemane Weldemariam

Publication date: 10 May 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.098

zbMATH Keywords

strategynondeterminismlambda calculusbisimilarityexploratory functions

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)

Uses Software

• HOPLA

Cites Work

• Unnamed Item
• LCF considered as a programming language
• Concrete domains
• Domain theory for concurrency
• Proving congruence of bisimulation in functional programming languages
• Infinite trace equivalence
• A universality theorem for PCF with recursive types, parallel-or and ∃
• Finitary PCF is not decidable

This page was built for publication: Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity