Logical Bisimulations and Functional Languages

DOI10.1007/978-3-540-75698-9_24MaRDI QIDQ3508541zbMATH OpenOpenAlexFDO

Authors Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii

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)

Recommendations

• Proving congruence of bisimulation in functional programming languages
• Bisimulations up-to: beyond first-order transition systems
• Small bisimulations for reasoning about higher-order imperative programs
• scientific article; zbMATH DE number 1231459
• Environmental bisimulations for probabilistic higher-order languages

Cited in

(22)

• Bisimilarity as a theory of functional programming
• Fibrational bisimulations and quantitative reasoning
• Proving congruence of bisimulation in functional programming languages
• Exploring probabilistic bisimulations. I
• Complete trace models of state and control
• Characteristic bisimulation for higher-order session processes
• Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
• The marriage of bisimulations and Kripke logical relations
• A Testing Theory for a Higher-Order Cryptographic Language
• scientific article; zbMATH DE number 6115908 (Why is no real title available?)
• Typed Normal Form Bisimulation
• scientific article; zbMATH DE number 1231459 (Why is no real title available?)
• scientific article; zbMATH DE number 1330448 (Why is no real title available?)
• First-order functional languages and intensional logic
• Parameterizing higher-order processes on names and processes
• A language-independent proof system for full program equivalence
• scientific article; zbMATH DE number 7407797 (Why is no real title available?)
• Equations, contractions, and unique solutions
• A Virtual Machine for Functional Logic Computations
• From applicative to environmental bisimulation
• The largest respectful function
• From bounded checking to verification of equivalence via symbolic up-to techniques

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

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