scientific article
From MaRDI portal
Publication:3202991
zbMath0716.03007MaRDI QIDQ3202991
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items
Observationally-induced algebras in domain theory, Freyd categories are enriched Lawvere theories, Classical control and quantum circuits in enriched category theory, From global to local state, coalgebraically and compositionally, Unnamed Item, Reversible effects as inverse arrows, Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics, On the call-by-value CPS transform and its semantics, Continuity as a computational effect, Probabilistic operational semantics for the lambda calculus, Lawvere theories enriched over a general base, Open Call-by-Value, Strong normalization from weak normalization in typed \(\lambda\)-calculi, Pseudo-distributive laws and axiomatics for variable binding, Unnamed Item, Counting Successes: Effects and Transformations for Non-deterministic Programs, 1ML with Special Effects, Call-by-push-value: Decomposing call-by-value and call-by-name, Generic models for computational effects, Discrete Lawvere theories and computational effects, Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects, Semantics of quantum programming languages: Classical control, quantum control, Combining algebraic effects with continuations, On the relations between monadic semantics, Turing-Completeness Totally Free, Covariant types, A first order logic of effects, Monad transformers as monoid transformers, A representable approach to finite nondeterminism, Monad as modality, An equational notion of lifting monad, Program algebra for quantitative information flow, Interpreting Localized Computational Effects Using Operators of Higher Type, Translating regular expression matching into transducers, Cartesian effect categories are Freyd-categories, A short proof that adding some permutation rules to \(\beta \) preserves SN, A note on preservation of strong normalisation in the \(\lambda \)-calculus, Graded algebraic theories, A model of dynamical concurrent program execution, The untyped computational \(\lambda \)-calculus and its intersection type discipline, All adapted topologies are equal, Unnamed Item, On the semantics of parsing actions, Modelling environments in call-by-value programming languages., Notions of computation as monoids, Type checking and typability in domain-free lambda calculi, Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence, Nominal Lawvere theories: a category theoretic account of equational theories with names, A model of intuitionistic affine logic from stable domain theory, From Exponential to Polynomial-Time Security Typing via Principal Types, Some fundamental algebraic tools for the semantics of computation. III: Indexed categories, Quantitative domains and infinitary algebras, Netter: probabilistic, stateful network models, Axioms for control operators in the CPS hierarchy, Classical Call-by-Need and Duality, Categories for computation in context and unified logic, 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, New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic, Monads and algebras in the semantics of partial data types, Effectful applicative similarity for call-by-name lambda calculi, Inferring the equivalence of functional programs that mutate data, Tail recursion through universal invariants, The revised report on the syntactic theories of sequential control and state, A theory for program and data type specification, Invariants of monadic coalgebras, A Selective CPS Transformation, Semantics for Algebraic Operations, Anatomy of a domain of continuous random variables. I, Comparing free algebras in topological and classical domain theory, Coproducts of Ideal Monads, Presheaf Models of Quantum Computation: An Outline, Anatomy of a Domain of Continuous Random Variables II, Models for the computational λ-calculus, A type-theoretic foundation of delimited continuations, Probabilistic coherence spaces as a model of higher-order probabilistic computation, The proof monad, Functions with local state: regularity and undecidability, Monads for the formalization of a pattern matching procedure, Combining effects: sum and tensor, A computer-verified monadic functional implementation of the integral, Unnamed Item, Call-By-Push-Value from a Linear Logic Point of View, Declarative pearl: deriving monadic quicksort, Categories of Timed Stochastic Relations, Dependent Types and Fibred Computational Effects, Anatomy of a proposition, An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form, The Arrow Calculus as a Quantum Programming Language, Notions of computation and monads, Axiomatics for Data Refinement in Call by Value Programming Languages, Enriching an Effect Calculus with Linear Types, The connected Vietoris powerlocale, Encoding types in ML-like languages, A concrete categorical semantics of lambda-\(\mathcal{S}\), Aliasing models for mobile objects, The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads, Building Verification Condition Generators by Compositional Extension, Quantum Arrows in Haskell, A co-induction principle for recursively defined domains, Algebra for Quantitative Information Flow, Runners in Action, A syntax for linear logic, Problems in rewriting applied to categorical concepts by the example of a computational comonad, A category-theoretic account of program modules, Unnamed Item, When programs have to watch paint dry, From gs-monoidal to oplax cartesian categories: constructions and functorial completeness, From semantics to types: the case of the imperative \(\lambda\)-calculus, Flexibly graded monads and graded algebras, Smart Choices and the Selection Monad, The order-K-ification monads, Canonical Gradings of Monads, Sweedler theory of monads, Quantitative global memory, Unnamed Item, Unnamed Item, Unnamed Item, Head reduction and normalization in a call-by-value lambda-calculus, Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous, Unnamed Item, Unnamed Item, A unifying approach to goal-directed evaluation, Computer Certified Efficient Exact Reals in Coq, Unnamed Item, Unnamed Item, Unnamed Item, Monads and Quantitative Equational Theories for Nondeterminism and Probability, A Fresh Look at the λ-Calculus, On reduction and normalization in the computational core
