A note on Coinduction and Weak Bisimilarity for While Programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3512082 (Why is no real title available?)
- scientific article; zbMATH DE number 1304993 (Why is no real title available?)
- The equational logic of fixed points
Cited in
(13)- Adding recursive constructs to bialgebraic semantics
- BISON instantiating the whitened swap-or-not construction
- Monads for behaviour
- Towards weak bisimulation for coalgebras
- A syntactical approach to weak (bi-)simulation for coalgebras
- Trace-Based Coinductive Operational Semantics for While
- Unguarded recursion on coinductive resumptions
- Program equivalence is coinductive
- Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: an exercise in mixed induction-coinduction
- Verification of the correctness of compiler optimization using co-induction
- Unguarded recursion on coinductive resumptions
- Subsequential transducers: a coalgebraic perspective
- A coalgebraic approach to Kleene algebra with tests
This page was built for publication: A note on Coinduction and Weak Bisimilarity for While Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943550)