Notions of computation and monads
From MaRDI portal
Recommendations
Cites work
- 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
- 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?)
- 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)- HasCasl: integrated higher-order specification and program development
- Datatype-generic termination proofs
- A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++
- Domain semantics of possibility computations
- On the algebraic structure of declarative programming languages
- CPS transformation of beta-redexes
- The lambda-context calculus (extended version)
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- Full abstractness for a functional/concurrent language with higher-order value-passing
- Simply-typed underdeterminism
- A behavioural theory of first-order CML
- Semantics of weakening and contraction
- Substitution: A formal methods case study using monads and transformations
- Stable power domains
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Propositional lax logic
- Query languages for bags and aggregate functions
- A first order logic of effects
- Continuity spaces: Reconciling domains and metric spaces
- Monad as modality
- An equational notion of lifting monad
- A new framework for declarative programming
- A fully abstract model for the \(\pi\)-calculus.
- Mathematical modal logic: A view of its evolution
- Modelling environments in call-by-value programming languages.
- Swinging types=functions+relations+transition systems
- Combining a monad and a comonad
- A fully abstract denotational semantics for the \(\pi\)-calculus
- Lifting results for categories of algebras
- Premonoidal categories as categories with algebraic structure
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Bundle functors and fibrations
- Programming from metaphorisms
- Lewis meets Brouwer: constructive strict implication
- The Cooper storage idiom
- Gabriel-Morita theory for excisive model categories
- A monad for randomized algorithms
- Complete Elgot monads and coalgebraic resumptions
- Programs as data structures in \(\lambda\)SF-calculus
- Fibrational modal type theory
- The Giry monad is not strong for the canonical symmetric monoidal closed structure on \textbf {Meas}
- Game semantics and linear CPS interpretation
- Predicate liftings and functor presentations in coalgebraic expression languages
- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- Referential transparency, definiteness and unfoldability
- Coalgebras and monads in the semantics of Java
- Taut monads and T0-spaces.
- Evolution of rule-based programs
- A theory of bisimulation for a fragment of concurrent ML with local names
- A first-order one-pass CPS transformation
- On the call-by-value CPS transform and its semantics
- Constructing a quasi-uniform function space
- Game-theoretic analysis of call-by-value computation
- The order-sobrification monad
- A computational treatment of anaphora and its algorithmic implementation
- Coalgebraic semantics for nominal automata
- Algebraic presentation of semifree monads
- The effects of effects on constructivism
- Quantitative logics for equivalence of effectful programs
- Weakest preconditions in fibrations
- Equational logic and categorical semantics for multi-languages
- Parametrized fixed points and their applications to session types
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
- Iterated covariant powerset is not a monad
- Generalized arrays for Stainless frames
- Accessibility and presentability in 2-categories
- Program logic for higher-order probabilistic programs in Isabelle/HOL
- Mac Lane's comparison theorem for the Kleisli construction formalized in Coq
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- Safe functional systems through integrity types and verified assembly
- Classical misuse attacks on NIST round 2 PQC. The power of rank-based schemes
- Combining semilattices and semimodules
- A general semantic construction of dependent refinement type systems, categorically
- Graded Hoare logic and its categorical semantics
- Elements of a theory of algebraic theories
- Whither semantics?
- Connected monads weakly preserve products
- Formal ball monads
- Noninterference in a predicative polymorphic calculus for access control
- Trace semantics via determinization
- Formal security proofs with minimal fuss: implicit computational complexity at work
- Program equivalence in linear contexts
- Uniqueness logic
- Continuity as a computational effect
- Lawvere theories enriched over a general base
- A (co)algebraic theory of succinct automata
- Powersets of terms and composite monads
- A novel formal approach to program slicing
- A static simulation of dynamic delimited control
- Free-algebra models for the \(\pi \)-calculus
- Infinite trace equivalence
- Cryptographic logical relations
- On the unity of duality
- Combining effects: sum and tensor
- Boolean restriction categories and taut monads
- A relational account of call-by-value sequentiality
- A general method for proving decidability of intuitionistic modal logics
- Stateful runners of effectful computations
- On a monadic semantics for freshness
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
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)
