scientific article; zbMATH DE number 4179333
From MaRDI portal
Publication:3202991
Recommendations
Cited in
(only showing first 100 items - show all)- The connected Vietoris powerlocale
- Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
- Quantitative domains and infinitary algebras
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- Monads and algebras in the semantics of partial data types
- Inferring the equivalence of functional programs that mutate data
- The revised report on the syntactic theories of sequential control and state
- A theory for program and data type specification
- A co-induction principle for recursively defined domains
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Covariant types
- A first order logic of effects
- A representable approach to finite nondeterminism
- Monad as modality
- An equational notion of lifting monad
- Modelling environments in call-by-value programming languages.
- Encoding types in ML-like languages
- Aliasing models for mobile objects
- On the call-by-value CPS transform and its semantics
- A model of dynamical concurrent program execution
- Effectful applicative similarity for call-by-name lambda calculi
- Monads for the formalization of a pattern matching procedure
- Declarative pearl: deriving monadic quicksort
- Anatomy of a proposition
- Classical control and quantum circuits in enriched category theory
- From global to local state, coalgebraically and compositionally
- Reversible effects as inverse arrows
- Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics
- Semantics of quantum programming languages: Classical control, quantum control
- Graded algebraic theories
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- All adapted topologies are equal
- Netter: probabilistic, stateful network models
- Anatomy of a domain of continuous random variables. I
- A concrete categorical semantics of lambda-\(\mathcal{S}\)
- Continuity as a computational effect
- Lawvere theories enriched over a general base
- Program algebra for quantitative information flow
- On the semantics of parsing actions
- Nominal Lawvere theories: a category theoretic account of equational theories with names
- Axioms for control operators in the CPS hierarchy
- Combining effects: sum and tensor
- Observationally-induced algebras in domain theory
- Freyd categories are enriched Lawvere theories
- Call-By-Push-Value from a Linear Logic Point of View
- Categories of timed stochastic relations
- Dependent types and fibred computational effects
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Building verification condition generators by compositional extension
- Quantum arrows in Haskell
- Probabilistic operational semantics for the lambda calculus
- Turing-Completeness Totally Free
- From exponential to polynomial-time security typing via principal types
- Classical call-by-need and duality
- Open call-by-value
- Counting successes: effects and transformations for non-deterministic programs
- The lambda calculus: practice and principle
- 1ML with special effects. F-ing generativity polymorphism
- A calculus for language transformations
- Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects
- Interpreting Localized Computational Effects Using Operators of Higher Type
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- The Arrow Calculus as a Quantum Programming Language
- Enriching an Effect Calculus with Linear Types
- scientific article; zbMATH DE number 3940711 (Why is no real title available?)
- scientific article; zbMATH DE number 29052 (Why is no real title available?)
- Translating regular expression matching into transducers
- Notions of computation as monoids
- A model of intuitionistic affine logic from stable domain theory
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
- Coproducts of Ideal Monads
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- Invariants of monadic coalgebras
- A selective CPS transformation
- Semantics for algebraic operations
- Presheaf models of quantum computation: an outline
- Anatomy of a domain of continuous random variables. II
- Models for the computational \(\lambda\)-calculus
- Combining and relating control effects and their semantics
- Axiomatics for data refinement in call by value programming languages
- The bang calculus and the two Girard's translations
- scientific article; zbMATH DE number 7450001 (Why is no real title available?)
- Unifying graded and parameterised monads
- Runners in Action
- Problems in rewriting applied to categorical concepts by the example of a computational comonad
- Beyond polarity: towards a multi-discipline intermediate language with sharing
- A Fresh Look at the λ-Calculus
- Typed equivalence of effect handlers and delimited control
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- -groupoid generated by an arbitrary topological -model
- A category-theoretic account of program modules
- Modules over monads and operational semantics (expanded version)
- Classical control, quantum circuits and linear logic in enriched category theory
- Compiling with classical connectives
- Idioms are oblivious, arrows are meticulous, monads are promiscuous
- Computer Certified Efficient Exact Reals in Coq
- Head reduction and normalization in a call-by-value lambda-calculus
- Algebra for quantitative information flow
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)
