scientific article; zbMATH DE number 4179333
From MaRDI portal
zbMATH Open0716.03007MaRDI QIDQ3202991FDOQ3202991
Authors: Eugenio Moggi 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Cited In (only showing first 100 items - show all)
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
- From exponential to polynomial-time security typing via principal types
- Invariants of monadic coalgebras
- Covariant types
- A representable approach to finite nondeterminism
- When programs have to watch paint dry
- Effectful applicative similarity for call-by-name lambda calculi
- On the semantics of parsing actions
- Title not available (Why is that?)
- Dependent types and fibred computational effects
- All adapted topologies are equal
- Netter: probabilistic, stateful network models
- Anatomy of a domain of continuous random variables. II
- A selective CPS transformation
- Semantics of quantum programming languages: Classical control, quantum control
- Classical control and quantum circuits in enriched category theory
- Monads for the formalization of a pattern matching procedure
- 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
- Anatomy of a domain of continuous random variables. I
- A Fresh Look at the λ-Calculus
- A concrete categorical semantics of lambda-\(\mathcal{S}\)
- Complete call-by-value calculi of control operators. II: Strong termination
- A calculus for language transformations
- Computer Certified Efficient Exact Reals in Coq
- Open call-by-value
- Categories of timed stochastic relations
- 1ML with special effects. F-ing generativity polymorphism
- Declarative pearl: deriving monadic quicksort
- Classical call-by-need and duality
- Presheaf models of quantum computation: an outline
- A model of intuitionistic affine logic from stable domain theory
- Anatomy of a proposition
- Notions of computation as monoids
- Call-By-Push-Value from a Linear Logic Point of View
- A model of dynamical concurrent program execution
- Title not available (Why is that?)
- Algebra for quantitative information flow
- Title not available (Why is that?)
- Turing-Completeness Totally Free
- Idioms are oblivious, arrows are meticulous, monads are promiscuous
- Title not available (Why is that?)
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- A unifying approach to goal-directed evaluation
- A tutorial on a monadic approach for exppressions evaluation
- Building verification condition generators by compositional extension
- Quantum arrows in Haskell
- Interpreting Localized Computational Effects Using Operators of Higher Type
- Program algebra for quantitative information flow
- A mechanically assisted constructive proof in category theory
- Title not available (Why is that?)
- Counting successes: effects and transformations for non-deterministic programs
- Monad transformers as monoid transformers
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
- Comparing free algebras in topological and classical domain theory
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
- A category-theoretic account of program modules
- Axioms for control operators in the CPS hierarchy
- On the relations between monadic semantics
- A co-induction principle for recursively defined domains
- Observationally-induced algebras in domain theory
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- Quantitative domains and infinitary algebras
- Inferring the equivalence of functional programs that mutate data
- Translating regular expression matching into transducers
- A first order logic of effects
- Notions of computation and monads
- Freyd categories are enriched Lawvere theories
- The proof monad
- Models for the computational \(\lambda\)-calculus
- Pseudo-distributive laws and axiomatics for variable binding
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Combining algebraic effects with continuations
- Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
- Discrete Lawvere theories and computational effects
- Modelling environments in call-by-value programming languages.
- Generic models for computational effects
- The connected Vietoris powerlocale
- A syntax for linear logic
- The revised report on the syntactic theories of sequential control and state
- Continuity as a computational effect
- A theory for program and data type specification
- Categories for computation in context and unified logic
- A type-theoretic foundation of delimited continuations
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Nominal Lawvere theories: a category theoretic account of equational theories with names
- Combining effects: sum and tensor
- Graded algebraic theories
- Title not available (Why is that?)
- A note on preservation of strong normalisation in the \(\lambda \)-calculus
- A short proof that adding some permutation rules to \(\beta \) preserves SN
- Aliasing models for mobile objects
- On the call-by-value CPS transform and its semantics
- 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
- The Arrow Calculus as a Quantum Programming Language
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- Probabilistic operational semantics for the lambda calculus
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
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)
