The following pages link to Notions of computation and monads (Q757075):
Displayed 50 items.
- Principles of programming with complex objects and collection types (Q672333) (← links)
- A theory of binding structures and applications to rewriting (Q685380) (← links)
- Extending separation logic with fixpoints and postponed substitution (Q820139) (← links)
- About permutation algebras, (pre)sheaves and named sets (Q853745) (← links)
- Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) (← links)
- Eilenberg--Moore algebras for stochastic relations (Q859832) (← links)
- Generic models for computational effects (Q860841) (← links)
- Discrete Lawvere theories and computational effects (Q860883) (← links)
- Combining algebraic effects with continuations (Q879352) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- A domain model characterising strong normalisation (Q958484) (← links)
- Kleisli morphisms and randomized congruences for the Giry monad (Q995624) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic (Q1193588) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- Simply-typed underdeterminism (Q1273067) (← links)
- A behavioural theory of first-order CML (Q1285654) (← links)
- Semantics of weakening and contraction (Q1337357) (← links)
- Stable power domains (Q1349652) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Propositional lax logic (Q1368378) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- A first order logic of effects (Q1390955) (← links)
- Continuity spaces: Reconciling domains and metric spaces (Q1391864) (← links)
- Monad as modality (Q1392142) (← links)
- An equational notion of lifting monad (Q1398461) (← links)
- A new framework for declarative programming (Q1399960) (← links)
- A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Modelling environments in call-by-value programming languages. (Q1427853) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Combining a monad and a comonad (Q1603819) (← links)
- A fully abstract denotational semantics for the \(\pi\)-calculus (Q1605174) (← links)
- Lifting results for categories of algebras (Q1605183) (← links)
- Premonoidal categories as categories with algebraic structure (Q1605185) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- Game semantics and linear CPS interpretation (Q1770417) (← links)
- Coalgebras and monads in the semantics of Java (Q1853752) (← links)
- Taut monads and \(T0\)-spaces. (Q1870523) (← links)
- Evolution of rule-based programs (Q1878711) (← links)
- A theory of bisimulation for a fragment of concurrent ML with local names (Q1882896) (← links)
- A first-order one-pass CPS transformation (Q1884883) (← links)
- On the call-by-value CPS transform and its semantics (Q1887170) (← links)
- Constructing a quasi-uniform function space (Q1903595) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Uniqueness logic (Q2368939) (← links)
- Lawvere theories enriched over a general base (Q2378550) (← links)
- Powersets of terms and composite monads (Q2457025) (← links)
- A novel formal approach to program slicing (Q2463836) (← links)
- A static simulation of dynamic delimited control (Q2464731) (← links)