Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)

DOI10.1007/978-3-662-44124-4_1MaRDI QIDQ2942772zbMATH OpenOpenAlexFDO

Authors Davide Sangiorgi

Publication date 11 September 2015

Published in Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44124-4_1

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2020181
• scientific article; zbMATH DE number 6115908
• On Bisimulation Theory in Linear Higher-Order π-Calculus
• Introduction to bisimulation and coinduction
• A categorical framework for congruence of applicative bisimilarity in higher-order languages
• Logical Bisimulations and Functional Languages
• Foundations of Software Science and Computation Structures
• More on bisimulations for higher order \(\pi\)-calculus
• Coalgebraic bisimulation-up-to
• Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme

Cited in

(5)

• Coinductive counting: bisimulation in enumerative combinatorics (extended abstract)
• scientific article; zbMATH DE number 6115908 (Why is no real title available?)
• A categorical framework for congruence of applicative bisimilarity in higher-order languages
• scientific article; zbMATH DE number 7407797 (Why is no real title available?)
• Small bisimulations for reasoning about higher-order imperative programs

Describes a project that uses

Uses Software

• IBAL

This page was built for publication: Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)

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