scientific article; zbMATH DE number 4179333
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Functions with local state: regularity and undecidability
- Unifying graded and parameterised monads
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- Monad transformers as monoid transformers
- The lambda calculus: practice and principle
- Combining and relating control effects and their semantics
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
- Comparing free algebras in topological and classical domain theory
- Covariant types
- A representable approach to finite nondeterminism
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
- From exponential to polynomial-time security typing via principal types
- Effectful applicative similarity for call-by-name lambda calculi
- Invariants of monadic coalgebras
- scientific article; zbMATH DE number 29052 (Why is no real title available?)
- On the semantics of parsing actions
- When programs have to watch paint dry
- Axioms for control operators in the CPS hierarchy
- On the relations between monadic semantics
- A fibrational tale of operational logical relations: pure, effectful and differential
- A co-induction principle for recursively defined domains
- A category-theoretic account of program modules
- Observationally-induced algebras in domain theory
- Dependent types and fibred computational effects
- Quantitative domains and infinitary algebras
- Inferring the equivalence of functional programs that mutate data
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- Translating regular expression matching into transducers
- On reduction and normalization in the computational core
- Notions of computation and monads
- A first order logic of effects
- Canonical Gradings of Monads
- The order-K-ification monads
- Freyd categories are enriched Lawvere theories
- All adapted topologies are equal
- The proof monad
- Netter: probabilistic, stateful network models
- Pseudo-distributive laws and axiomatics for variable binding
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Models for the computational \(\lambda\)-calculus
- Semantics of quantum programming languages: Classical control, quantum control
- Anatomy of a domain of continuous random variables. II
- A selective CPS transformation
- Combining algebraic effects with continuations
- Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
- Classical control, quantum circuits and linear logic in enriched category theory
- Classical control and quantum circuits in enriched category theory
- Monads for the formalization of a pattern matching procedure
- Runners in Action
- Discrete Lawvere theories and computational effects
- scientific article; zbMATH DE number 7243675 (Why is no real title available?)
- Modelling environments in call-by-value programming languages.
- scientific article; zbMATH DE number 7779295 (Why is no real title available?)
- Generic models for computational effects
- 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 connected Vietoris powerlocale
- Smart Choices and the Selection Monad
- Strong call-by-value and multi types
- The revised report on the syntactic theories of sequential control and state
- Anatomy of a domain of continuous random variables. I
- A syntax for linear logic
- A concrete categorical semantics of lambda-\(\mathcal{S}\)
- A Fresh Look at the λ-Calculus
- Continuity as a computational effect
- A calculus for language transformations
- Complete call-by-value calculi of control operators. II: Strong termination
- A theory for program and data type specification
- Computer Certified Efficient Exact Reals in Coq
- Sweedler theory of monads
- Categories of timed stochastic relations
- Open call-by-value
- 1ML with special effects. F-ing generativity polymorphism
- The bang calculus and the two Girard's translations
- Declarative pearl: deriving monadic quicksort
- Categories for computation in context and unified logic
- A type-theoretic foundation of delimited continuations
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- scientific article; zbMATH DE number 7450001 (Why is no real title available?)
- Flexibly graded monads and graded algebras
- Nominal Lawvere theories: a category theoretic account of equational theories with names
- Combining effects: sum and tensor
- Quantitative global memory
- From gs-monoidal to oplax cartesian categories: constructions and functorial completeness
- Light genericity
- A note on preservation of strong normalisation in the \(\lambda \)-calculus
- A short proof that adding some permutation rules to \(\beta \) preserves SN
- Classical call-by-need and duality
- Graded algebraic theories
- Aliasing models for mobile objects
- Anatomy of a proposition
- Presheaf models of quantum computation: an outline
- A model of intuitionistic affine logic from stable domain theory
- Axiomatics for data refinement in call by value programming languages
- Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects
- On the call-by-value CPS transform and its semantics
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- The category theoretic understanding of universal algebra: Lawvere theories and monads
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)
