scientific article; zbMATH DE number 7407797
From MaRDI portal
Publication:5155688
Recommendations
- Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
- scientific article; zbMATH DE number 6864542
- ModuRes: a Coq library for modular reasoning about concurrent higher-order imperative programming languages
- scientific article; zbMATH DE number 3938530
- Modular proofs for completeness of hierarchical term rewriting systems
- Mechanizing coinduction and corecursion in higher-order logic
- Modular construction of complete coalgebraic logics
- scientific article; zbMATH DE number 7649963
- A coalgebraic presentation of structured transition systems
- Modal intersection types, two-level languages, and staged synthesis
Cites work
- A bisimulation for dynamic sealing
- A bisimulation for type abstraction and recursion
- A complete normal-form bisimilarity for state
- An efficiency preorder for processes
- Behavioral theory for mobile ambients
- Bisimulation and coinduction enhancements: a historical perspective
- Bisimulations up-to: beyond first-order transition systems
- Coalgebraic bisimulation-up-to
- Coinduction All the Way Up
- Complete Lattices and Up-To Techniques
- Divergence and unique solution of equations
- Enhancements of the bisimulation proof method
- Environmental bisimulations for delimited-control operators with dynamic prompt generation
- Equations, contractions, and unique solutions
- First-order reasoning for higher-order concurrency
- From applicative to environmental bisimulation
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1251177 (Why is no real title available?)
- scientific article; zbMATH DE number 1330448 (Why is no real title available?)
- scientific article; zbMATH DE number 1082078 (Why is no real title available?)
- scientific article; zbMATH DE number 1479626 (Why is no real title available?)
- scientific article; zbMATH DE number 1759615 (Why is no real title available?)
- Logical Bisimulations and Functional Languages
- On the bisimulation proof method
- Process algebras with localities.
- Relational reasoning about contexts
- Small bisimulations for reasoning about higher-order imperative programs
- The -calculus: A theory of mobile processes
- The lazy lambda calculus in a concurrency scenario
- The power of parameterization in coinductive proof
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155688)
