Notions of computation and monads
From MaRDI portal
Publication:757075
DOI10.1016/0890-5401(91)90052-4zbMATH Open0723.68073OpenAlexW1997143185WikidataQ55895577 ScholiaQ55895577MaRDI QIDQ757075FDOQ757075
Authors: Eugenio Moggi 
Publication date: 1991
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(91)90052-4
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Edinburgh LCF. A mechanized logic of computation
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Category-Theoretic Solution of Recursive Domain Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- First order categorical logic. Model-theoretical methods in the theory of topoi and related categories
- The formal theory of monads
- Strong functors and monoidal monads
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The linear abstract machine
- The hereditary partial effective functionals and recursion theory in higher types
- A category-theoretic account of program modules
- A syntactic theory of sequential state
- Verification of programs that destructively manipulated data
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- Indexed categories and their applications
- Computational foundations of basic recursive function theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- A domain model characterising strong normalisation
- Title not available (Why is that?)
- Correctness of compiling polymorphism to dynamic typing
- On one-pass CPS transformations
- Comparing free algebras in topological and classical domain theory
- On equation systems in monotonic models of typed \(\lambda\)-calculus
- Gabriel-Morita theory for excisive model categories
- A generic complete dynamic logic for reasoning about purity and effects
- Title not available (Why is that?)
- The transformation calculus
- Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
- Full abstractness for a functional/concurrent language with higher-order value-passing
- Sound and complete axiomatisations of call-by-value control operators
- A monad for randomized algorithms
- Contributions to a computational theory of policy advice and avoidability
- Algebras for parameterised monads
- Simply-typed underdeterminism
- Query languages for bags and aggregate functions
- A behavioural theory of first-order CML
- Parameterised notions of computation
- Title not available (Why is that?)
- Kan extensions for program optimisation Or: Art and Dan explain an old trick
- Continuity as a computational effect
- Datatype-generic termination proofs
- Dijkstra and Hoare monads in monadic computation
- Generic weakest precondition semantics from monads enriched with order
- Formal categorical reasoning
- A Calculus for Game-Based Security Proofs
- Formal security proofs with minimal fuss: implicit computational complexity at work
- Modules over monads and initial semantics
- Distributive laws for relative monads
- Presheaf models of quantum computation: an outline
- Pseudo-commutative monads
- Bundle functors and fibrations
- On the call-by-value CPS transform and its semantics
- Lifting results for categories of algebras
- CPS transformation of beta-redexes
- Whither semantics?
- Programming from metaphorisms
- An algebraic theory for shared-state concurrency
- Lewis meets Brouwer: constructive strict implication
- Total and partial computation in categorical quantum foundations
- Modalities in homotopy type theory
- Idioms are oblivious, arrows are meticulous, monads are promiscuous
- Asymptotic Improvement of Computations over Free Monads
- The Herbrand functional interpretation of the double negation shift
- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
- A computational treatment of anaphora and its algorithmic implementation
- Monads, indexes and transformations
- Monadic augment and generalised short cut fusion
- Game semantics and linear CPS interpretation
- The Cooper storage idiom
- A coinductive calculus for asynchronous side-effecting processes
- Monad transformers as monoid transformers
- Dijkstra Monads in Monadic Computation
- Propositional lax logic
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- Title not available (Why is that?)
- Normalization by evaluation and algebraic effects
- Monads for behaviour
- Algebraic properties of stochastic effectivity functions
- Title not available (Why is that?)
- On the relations between monadic semantics
- Logical relations for monadic types
- Resource modalities in tensor logic
- Lifting theorems for Kleisli categories
- A first order logic of effects
- Comprehending monads
- Observationally-induced lower and upper powerspace constructions
- Specifying properties of concurrent computations in CLF
- Freyd categories are enriched Lawvere theories
- Towards a notion of lambda monoid
- The coinductive resumption monad
- Program equivalence in linear contexts
- A fully abstract model for the \(\pi\)-calculus.
- A coinductive calculus for asynchronous side-effecting processes
- A monadic framework for delimited continuations
- Combining algebraic effects with continuations
- Game-theoretic analysis of call-by-value computation
- Kleene monads: handling iteration in a framework of generic effects
- Complete iterativity for algebras with effects
- Modelling environments in call-by-value programming languages.
- Coalgebras and monads in the semantics of Java
- On the ubiquity of certain total type structures
- Generic models for computational effects
- On the algebraic structure of declarative programming languages
- A relational realizability model for higher-order stateful ADTs
- Duoidally enriched Freyd categories
- Continuity spaces: Reconciling domains and metric spaces
- Extending separation logic with fixpoints and postponed substitution
- A categorical model of the fusion calculus
- Constructive Boolean circuits and the exactness of timed ternary simulation
- A duality between exceptions and states
- Observationally-induced effects in Cartesian closed categories
- Combining a monad and a comonad
- Computation semantics of the functional scientific workflow language Cuneiform
- Observationally-induced effect monads: upper and lower powerspace constructions
- Program equivalence in a simple language with state
- Mathematical modal logic: A view of its evolution
- What is a categorical model of arrows?
Uses Software
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)
