Notions of computation and monads
From MaRDI portal
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)- Adjoint logic with a 2-category of modes
- A general semantic construction of dependent refinement type systems, categorically
- Graded Hoare logic and its categorical semantics
- Iterated covariant powerset is not a monad
- Semantics of value recursion for Monadic Input/Output
- Accessibility and presentability in 2-categories
- Noninterference in a predicative polymorphic calculus for access control
- Program logic for higher-order probabilistic programs in Isabelle/HOL
- Dynamic game semantics
- Mac Lane's comparison theorem for the Kleisli construction formalized in Coq
- Unifying graded and parameterised monads
- Synthesis of strategies using the Hoare logic of angelic and demonic nondeterminism
- Finitely presentable algebras for finitary monads
- Commutative semantics for probabilistic programming
- Interactive programming in Agda -- objects and graphical user interfaces
- A simply typed \(\lambda\)-calculus of forward automatic differentiation
- The Giry monad is not strong for the canonical symmetric monoidal closed structure on \textbf {Meas}
- An Essay in λ‐Calculus
- Equational logic and categorical semantics for multi-languages
- Quantitative logics for equivalence of effectful programs
- Parametrized fixed points and their applications to session types
- The effects of effects on constructivism
- Weakest preconditions in fibrations
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
- Quotienting the delay monad by weak bisimilarity
- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- The bang calculus and the two Girard's translations
- Generalized arrays for Stainless frames
- No value restriction is needed for algebraic effects and handlers
- Reversible monadic computing
- Codensity lifting of monads and its dual
- No-iteration mixed distributive laws
- Boolean restriction categories and taut monads
- Formal ball monads
- Safe functional systems through integrity types and verified assembly
- C-system of a module over a \(Jf\)-relative monad
- scientific article; zbMATH DE number 7453116 (Why is no real title available?)
- scientific article; zbMATH DE number 6864542 (Why is no real title available?)
- The linear-non-linear substitution 2-monad
- A (co)algebraic theory of succinct automata
- Amb Breaks Well-Pointedness, Ground Amb Doesn't
- Predicate liftings and functor presentations in coalgebraic expression languages
- Complete Elgot monads and coalgebraic resumptions
- Fibrational modal type theory
- Ambiguity and incomplete information in categorical models of language
- Algebraic presentation of semifree monads
- Coalgebraic semantics for nominal automata
- Categories of timed stochastic relations
- The arrow calculus
- Unguarded recursion on coinductive resumptions
- Partial hyperdoctrines: categorical models for partial function logic and Hoare logic
- A Semantical Approach to Equilibria and Rationality
- Relating structure and power: comonadic semantics for computational resources
- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages
- Combining semilattices and semimodules
- Introducing a calculus of effects and handlers for natural language semantics
- Connected monads weakly preserve products
- Dependent types and fibred computational effects
- Evolution of rule-based programs
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
- An algebraic theory for shared-state concurrency
- CPS transformation of beta-redexes
- Modules over monads and initial semantics
- Lifting results for categories of algebras
- Game semantics and linear CPS interpretation
- A Calculus for Game-Based Security Proofs
- Algebras for parameterised monads
- Query languages for bags and aggregate functions
- Kan extensions for program optimisation Or: Art and Dan explain an old trick
- Gabriel-Morita theory for excisive model categories
- A domain model characterising strong normalisation
- The transformation calculus
- Full abstractness for a functional/concurrent language with higher-order value-passing
- Dijkstra and Hoare monads in monadic computation
- Generic weakest precondition semantics from monads enriched with order
- Distributive laws for relative monads
- Modalities in homotopy type theory
- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
- Monads, indexes and transformations
- Lewis meets Brouwer: constructive strict implication
- Monadic augment and generalised short cut fusion
- Pseudo-commutative monads
- Idioms are oblivious, arrows are meticulous, monads are promiscuous
- Correctness of compiling polymorphism to dynamic typing
- Formal categorical reasoning
- scientific article; zbMATH DE number 3909726 (Why is no real title available?)
- Whither semantics?
- Parameterised notions of computation
- Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
- Programming from metaphorisms
- Total and partial computation in categorical quantum foundations
- Formal security proofs with minimal fuss: implicit computational complexity at work
- Asymptotic Improvement of Computations over Free Monads
- Continuity as a computational effect
- Bundle functors and fibrations
- A generic complete dynamic logic for reasoning about purity and effects
- The Cooper storage idiom
- On one-pass CPS transformations
- Sound and complete axiomatisations of call-by-value control operators
- The Herbrand functional interpretation of the double negation shift
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)
