The following pages link to (Q4077434):
Displaying 20 items.
- The coinductive resumption monad (Q283770) (← links)
- Flag-based big-step semantics (Q516041) (← links)
- Denotational semantics of CSP (Q801677) (← links)
- Calculi for synchrony and asynchrony (Q1050111) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- Interactive foundations of computing (Q1127523) (← links)
- The denotational semantics of sequential machines (Q1133896) (← links)
- Semantics of nondeterminism, concurrency, and communication (Q1139946) (← links)
- A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949) (← links)
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus (Q1229201) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- Universal coalgebra: A theory of systems (Q1583483) (← links)
- Nivat's processes and their synchronization (Q1603683) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- (Q3912568) (← links)
- (Q3914421) (← links)
- (Q4499206) (← links)
- A fully abstract denotational semantics for the calculus of higher-order communicating systems (Q5940933) (← links)
