The following pages link to (Q5718566):
Displaying 13 items.
- Monads for behaviour (Q265824) (← links)
- A coinductive calculus for asynchronous side-effecting processes (Q393094) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)
- Programming interfaces and basic topology (Q2575770) (← links)
- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) (Q2888481) (← links)
- How to Reason Coinductively Informally (Q3305562) (← links)
- Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme (Q3638258) (← links)
- From Coinductive Proofs to Exact Real Arithmetic (Q3644745) (← links)
- Polynomial functors and polynomial monads (Q4902505) (← links)
- Coalgebras as Types Determined by Their Elimination Rules (Q5253935) (← links)
- Interactive programming in Agda – Objects and graphical user interfaces (Q5372002) (← links)
- A metalanguage for guarded iteration (Q5918344) (← links)
