Recommendations
Cites work
- scientific article; zbMATH DE number 3645093 (Why is no real title available?)
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 3650529 (Why is no real title available?)
- scientific article; zbMATH DE number 3808928 (Why is no real title available?)
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 4021100 (Why is no real title available?)
- scientific article; zbMATH DE number 4103051 (Why is no real title available?)
- scientific article; zbMATH DE number 3751225 (Why is no real title available?)
- scientific article; zbMATH DE number 193320 (Why is no real title available?)
- scientific article; zbMATH DE number 3529402 (Why is no real title available?)
- scientific article; zbMATH DE number 3549200 (Why is no real title available?)
- scientific article; zbMATH DE number 3559737 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 4187810 (Why is no real title available?)
- A category-theoretic account of program modules
- A syntactic theory of sequential state
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Computational foundations of basic recursive function theory
- Edinburgh LCF. A mechanized logic of computation
- First order categorical logic. Model-theoretical methods in the theory of topoi and related categories
- Indexed categories and their applications
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- Strong functors and monoidal monads
- The Category-Theoretic Solution of Recursive Domain Equations
- The formal theory of monads
- The hereditary partial effective functionals and recursion theory in higher types
- The linear abstract machine
- Verification of programs that destructively manipulated data
Cited in
(only showing first 100 items - show all)- Eilenberg--Moore algebras for stochastic relations
- Unifying graded and parameterised monads
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
- A coinductive calculus for asynchronous side-effecting processes
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- Monad transformers as monoid transformers
- A domain model characterising strong normalisation
- Mac Lane's comparison theorem for the Kleisli construction formalized in Coq
- Access control in a core calculus of dependency
- Eager and delayed contract monitoring for call-by-value and call-by-name evaluation
- scientific article; zbMATH DE number 3909726 (Why is no real title available?)
- Computational interpretations of classical reasoning: from the epsilon calculus to stateful programs
- Finitely presentable algebras for finitary monads
- Propositional lax logic
- Natural transformations as rewrite rules and monad composition
- Monad compositions II: Kleisli strength
- Synthetic topology in Homotopy Type Theory for probabilistic programming
- Partiality and Container Monads
- A theory of binding structures and applications to rewriting
- Dijkstra Monads in Monadic Computation
- Transactional events
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Coherence of subsumption for monadic types
- Normalization by evaluation and algebraic effects
- Monads for behaviour
- Healthiness conditions for predicate transformers
- Unguarded recursion on coinductive resumptions
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
- A new framework for declarative programming
- Comparing free algebras in topological and classical domain theory
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- Algebraic presentation of semifree monads
- Coalgebraic semantics for nominal automata
- Weak bisimulations for the Giry monad
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
- scientific article; zbMATH DE number 2087441 (Why is no real title available?)
- Correctness of compiling polymorphism to dynamic typing
- Iterated covariant powerset is not a monad
- Reversible monadic computing
- Game theoretic analysis of call-by-value computation
- On one-pass CPS transformations
- scientific article; zbMATH DE number 1231611 (Why is no real title available?)
- A relational account of call-by-value sequentiality
- Asymptotic speedup via effect handlers
- Why adjunctions matter -- a functional programmer perspective
- Combining semilattices and semimodules
- Algebraic properties of stochastic effectivity functions
- Gabriel-Morita theory for excisive model categories
- On equation systems in monotonic models of typed \(\lambda\)-calculus
- A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++
- On the relations between monadic semantics
- VDM semantics of programming languages: Combinators and monads
- A generic complete dynamic logic for reasoning about purity and effects
- Semantics of value recursion for Monadic Input/Output
- Safe functional systems through integrity types and verified assembly
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- Programs as data structures in \(\lambda\)SF-calculus
- scientific article; zbMATH DE number 7269245 (Why is no real title available?)
- Plethysms and operads
- Dependent types and fibred computational effects
- The transformation calculus
- Resource modalities in tensor logic
- Notions of bidirectional computation and entangled state monads
- scientific article; zbMATH DE number 38948 (Why is no real title available?)
- scientific article; zbMATH DE number 7243672 (Why is no real title available?)
- Logical relations for monadic types
- On reduction and normalization in the computational core
- A first order logic of effects
- Unguarded recursion on coinductive resumptions
- Observationally-induced lower and upper powerspace constructions
- Divergences on monads for relational program logics
- Promonads and String Diagrams for Effectful Categories
- Galois connecting call-by-value and call-by-name
- Protocol choice and iteration for the free cornering
- Comonadic notions of computation
- Freyd categories are enriched Lawvere theories
- Towards a notion of lambda monoid
- The coinductive resumption monad
- Evolution of rule-based programs
- Runners for interleaving algebraic effects
- Full abstractness for a functional/concurrent language with higher-order value-passing
- Monadic translation of classical sequent calculus
- Lifting theorems for Kleisli categories
- Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
- Comprehending monads
- Specifying properties of concurrent computations in CLF
- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages
- The proof monad
- Program equivalence in linear contexts
- The essence of the <scp>Iterator</scp> pattern
- A monad for randomized algorithms
- Complete Elgot monads and coalgebraic resumptions
- Fibrational modal type theory
- A fully abstract model for the \(\pi\)-calculus.
- A general semantic construction of dependent refinement type systems, categorically
- Graded Hoare logic and its categorical semantics
- A superposition operator for the refinement of algebraic models
- scientific article; zbMATH DE number 7453116 (Why is no real title available?)
- Sound and complete axiomatisations of call-by-value control operators
- Categorifying computations into components via arrows as profunctors
This page was built for publication: Notions of computation and monads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757075)
