The following pages link to Notions of computation and monads (Q757075):
Displaying 50 items.
- 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)
- The order-sobrification monad (Q2024926) (← links)
- A computational treatment of anaphora and its algorithmic implementation (Q2035844) (← links)
- Coalgebraic semantics for nominal automata (Q2104476) (← links)
- Algebraic presentation of semifree monads (Q2104481) (← links)
- The effects of effects on constructivism (Q2133168) (← links)
- Quantitative logics for equivalence of effectful programs (Q2133179) (← links)
- Weakest preconditions in fibrations (Q2133463) (← links)
- Equational logic and categorical semantics for multi-languages (Q2133469) (← links)
- Parametrized fixed points and their applications to session types (Q2133474) (← links)
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies (Q2134814) (← links)
- Iterated covariant powerset is not a monad (Q2134821) (← links)
- Generalized arrays for Stainless frames (Q2152661) (← links)
- Accessibility and presentability in 2-categories (Q2161116) (← links)
- Program logic for higher-order probabilistic programs in Isabelle/HOL (Q2163157) (← links)
- Mac Lane's comparison theorem for the Kleisli construction formalized in Coq (Q2209259) (← links)
- The untyped computational \(\lambda \)-calculus and its intersection type discipline (Q2210507) (← links)
- Safe functional systems through integrity types and verified assembly (Q2220814) (← links)
- Classical misuse attacks on NIST round 2 PQC. The power of rank-based schemes (Q2229273) (← links)
- Combining semilattices and semimodules (Q2233397) (← links)
- A general semantic construction of dependent refinement type systems, categorically (Q2233424) (← links)
- Graded Hoare logic and its categorical semantics (Q2233460) (← links)
- Elements of a theory of algebraic theories (Q2253182) (← links)
- Whither semantics? (Q2286732) (← links)
- Connected monads weakly preserve products (Q2310433) (← links)
- Formal ball monads (Q2312469) (← links)
- Noninterference in a predicative polymorphic calculus for access control (Q2339144) (← links)
- Trace semantics via determinization (Q2341701) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- Program equivalence in linear contexts (Q2346993) (← links)
- Uniqueness logic (Q2368939) (← links)
- Continuity as a computational effect (Q2374315) (← links)
- Lawvere theories enriched over a general base (Q2378550) (← links)
- A (co)algebraic theory of succinct automata (Q2423764) (← 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)
- Free-algebra models for the \(\pi \)-calculus (Q2474057) (← links)
- Infinite trace equivalence (Q2474445) (← links)
- Cryptographic logical relations (Q2481976) (← links)
- On the unity of duality (Q2482843) (← links)
- Combining effects: sum and tensor (Q2500483) (← links)
- Boolean restriction categories and taut monads (Q2503320) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- A general method for proving decidability of intuitionistic modal logics (Q2506825) (← links)
- Stateful runners of effectful computations (Q2520704) (← links)
- On a monadic semantics for freshness (Q2566026) (← links)
