Logical Bisimulations and Functional Languages

DOI10.1007/978-3-540-75698-9_24zbMath1141.68377OpenAlexW4210534908MaRDI QIDQ3508541

Eijiro Sumii, Naoki Kobayashi, Davide Sangiorgi

Publication date: 1 July 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-75698-9_24

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Characteristic bisimulation for higher-order session processes ⋮ Parameterizing higher-order processes on names and processes ⋮ Exploring probabilistic bisimulations. I ⋮ A Testing Theory for a Higher-Order Cryptographic Language ⋮ Complete trace models of state and control ⋮ A language-independent proof system for full program equivalence ⋮ Equations, Contractions, and Unique Solutions ⋮ Unnamed Item

This page was built for publication: Logical Bisimulations and Functional Languages