Exploratory functions on nondeterministic strategies, up to lower bisimilarity

DOI10.1016/J.ENTCS.2009.07.098zbMATH Open1337.68187OpenAlexW2160129419MaRDI QIDQ2805166FDOQ2805166

Authors: 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

Recommendations

• Deterministic concurrent strategies
• Nondeterminism and Observable Sequentiality
• scientific article; zbMATH DE number 1231604
• Strategies as profunctors
• Nondeterministic extensions of untyped \(\lambda\)-calculus

zbMATH Keywords

nondeterminismlambda calculusstrategybisimilarityexploratory functions

Mathematics Subject Classification ID

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

Cites Work

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

Uses Software

• HOPLA

This page was built for publication: Exploratory functions on nondeterministic strategies, up to lower bisimilarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805166)