scientific article; zbMATH DE number 4179333
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A tutorial on a monadic approach for exppressions evaluation
- All adapted topologies are equal
- A Fresh Look at the λ-Calculus
- Netter: probabilistic, stateful network models
- Building verification condition generators by compositional extension
- Quantum arrows in Haskell
- scientific article; zbMATH DE number 7559296 (Why is no real title available?)
- scientific article; zbMATH DE number 3940711 (Why is no real title available?)
- Declarative pearl: deriving monadic quicksort
- A model of intuitionistic affine logic from stable domain theory
- A concrete categorical semantics of lambda-\(\mathcal{S}\)
- Anatomy of a domain of continuous random variables. II
- Unifying graded and parameterised monads
- A unifying approach to goal-directed evaluation
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
- Effectful applicative similarity for call-by-name lambda calculi
- When programs have to watch paint dry
- Turing-Completeness Totally Free
- Interpreting Localized Computational Effects Using Operators of Higher Type
- Anatomy of a proposition
- A selective CPS transformation
- Idioms are oblivious, arrows are meticulous, monads are promiscuous
- From global to local state, coalgebraically and compositionally
- Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics
- Reversible effects as inverse arrows
- The bang calculus and the two Girard's translations
- Program algebra for quantitative information flow
- Anatomy of a domain of continuous random variables. I
- A model of dynamical concurrent program execution
- Semantics of quantum programming languages: Classical control, quantum control
- A calculus for language transformations
- Complete call-by-value calculi of control operators. II: Strong termination
- Classical call-by-need and duality
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Classical control and quantum circuits in enriched category theory
- Computer Certified Efficient Exact Reals in Coq
- Monads for the formalization of a pattern matching procedure
- From exponential to polynomial-time security typing via principal types
- Open call-by-value
- Categories of timed stochastic relations
- 1ML with special effects. F-ing generativity polymorphism
- Algebra for quantitative information flow
- \(\infty\)-groupoid generated by an arbitrary topological \(\lambda\)-model
- On the semantics of parsing actions
- Call-By-Push-Value from a Linear Logic Point of View
- Notions of computation as monoids
- Covariant types
- A representable approach to finite nondeterminism
- Classical control, quantum circuits and linear logic in enriched category theory
- Invariants of monadic coalgebras
- Counting successes: effects and transformations for non-deterministic programs
- Dependent types and fibred computational effects
- Presheaf models of quantum computation: an outline
- Axioms for control operators in the CPS hierarchy
- A category-theoretic account of program modules
- Monads and algebras in the semantics of partial data types
- A note on preservation of strong normalisation in the \(\lambda \)-calculus
- A short proof that adding some permutation rules to \(\beta \) preserves SN
- Observationally-induced algebras in domain theory
- Monad transformers as monoid transformers
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
- Encoding types in ML-like languages
- Aliasing models for mobile objects
- Freyd categories are enriched Lawvere theories
- Cartesian effect categories are Freyd-categories
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- The Arrow Calculus as a Quantum Programming Language
- Semantics for algebraic operations
- The connected Vietoris powerlocale
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- Translating regular expression matching into transducers
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
- A syntax for linear logic
- A theory for program and data type specification
- A first order logic of effects
- Probabilistic operational semantics for the lambda calculus
- Generic models for computational effects
- Nominal Lawvere theories: a category theoretic account of equational theories with names
- Enriching an Effect Calculus with Linear Types
- Combining algebraic effects with continuations
- Categories for computation in context and unified logic
- The revised report on the syntactic theories of sequential control and state
- Tail recursion through universal invariants
- Notions of computation and monads
- Coproducts of Ideal Monads
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- A type-theoretic foundation of delimited continuations
- Lawvere theories enriched over a general base
- An equational notion of lifting monad
- On the relations between monadic semantics
- Discrete Lawvere theories and computational effects
- Pseudo-distributive laws and axiomatics for variable binding
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
- Continuity as a computational effect
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3202991)
