The following pages link to Fixpoint semantics and simulation (Q1575253):
Displaying 19 items.
- Identifying all preorders on the subdistribution monad (Q283773) (← links)
- Relation lifting, a survey (Q299182) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- Unifying wp and wlp (Q671411) (← links)
- Simulations in coalgebra (Q703522) (← links)
- Simulation of operational semantics of machine instructions (Q763568) (← links)
- Simulation of simultaneous safe recursion over an arbitrary structure (Q845681) (← links)
- Simulating finitely recursive processes in LISP (Q1198588) (← links)
- Program morphisms (Q1203125) (← links)
- Fixpoint semantics and simulation (Q1575253) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- A modular approach to defining and characterising notions of simulation (Q2495641) (← links)
- Constrained simulations, nested simulation semantics and counting bisimulations (Q2871848) (← links)
- Codensity Lifting of Monads and its Dual (Q4553284) (← links)
- Feedback, trace and fixed-point semantics (Q4787833) (← links)
- Bisimulation as a logical relation (Q5058364) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431295) (← links)
- Transitivity and Difunctionality of Bisimulations (Q5739448) (← links)
- A coalgebraic presentation of structured transition systems (Q5941158) (← links)