scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

category theory specification Fixed points Denotational semantics Data types Assertion semantics Partially additive semantics Semantics of recursion

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General theory of categories and functors (18A99) Theory of computing (68Q99)

Related Items (75)

Varieties and covarieties of languages (extended abstract) ⋮ Process algebra with guards: Combining hoare logic with process algebra ⋮ Guard modules ⋮ Initial algebra semantics for lambda calculi ⋮ Inductive \(^{*}\)-semirings ⋮ Condition/decision duality and the internal logic of extensive restriction categories ⋮ The modernity of Dedekind's anticipations contained in \textit{What are numbers and what are they good for?} ⋮ A Representation Theorem for Unique Decomposition Categories ⋮ Categorical fixed point calculus ⋮ Algebraic solutions to recursion schemes ⋮ Pseudocomplementation and minimal prime ideals in semirings ⋮ From Coalgebraic to Monoidal Traces ⋮ Categories, relations and dynamic programming ⋮ Semantics of higher-order quantum computation via geometry of interaction ⋮ COMPLEMENTATION OF A GAMMA SEMIRING ⋮ A formal mathematical framework for modeling probabilistic hybrid systems ⋮ Naturality of the conditional and the recursion^∗ ⋮ The duality between flow charts and circuits ⋮ Semantics for a quantum programming language by operator algebras ⋮ Unnamed Item ⋮ Categorical shape theory as a formal language for pattern recognition? ⋮ Boolean product representations of algebras via binary polynomials ⋮ From probability monads to commutative effectuses ⋮ Total and Partial Computation in Categorical Quantum Foundations ⋮ The equational logic of fixed points ⋮ Program correctness and matricial iteration theories ⋮ Characterizing functions mappable over GADTs ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ An extension of a Y. C. Yang theorem ⋮ Probabilistic systems coalgebraically: a survey ⋮ A reification calculus for model-oriented software specification ⋮ A transformational characterization of if-then-else ⋮ Probabilistic arithmetic. I: Numerical methods for calculating convolutions and dependency bounds ⋮ Generic functional programming with types and relations ⋮ Unnamed Item ⋮ Datatype laws without signatures ⋮ On \(*\)-\(\lambda\)-semirings. ⋮ The contraction principle as a particular case of Kleene's fixed point theorem ⋮ On the greatest fixed point of a set functor ⋮ The dual equivalence of equations and coequations for automata ⋮ Semantic models for total correctness and fairness ⋮ Effectuses from monads ⋮ Some economic applications of Scott domains ⋮ A categorical analogue of the monoid semiring construction ⋮ Local fibred right adjoints are polynomial ⋮ I-categories as a framework for solving domain equations ⋮ On the discretization in time for a parabolic integrodifferential equation with a weakly singular kernel. I: Smooth initial data ⋮ Machine semantics ⋮ Adas and the equational theory of if-then-else ⋮ Quantum circuit oracles for abstract machine computations ⋮ A coinductive calculus of binary trees ⋮ Towards a geometry of recursion ⋮ Matrix representable so-rings ⋮ Semantic models for total correctness and fairness ⋮ Probabilities, distribution monads, and convex categories ⋮ Fusion of recursive programs with computational effects ⋮ Unnamed Item ⋮ Categories of Timed Stochastic Relations ⋮ On geometry of interaction for polarized linear logic ⋮ A ``geometric view of the dynamics of trajectories of computer programs ⋮ A note on guarded theories ⋮ Categorical fixed point semantics ⋮ Structural induction and coinduction in a fibrational setting ⋮ Equational weighted tree transformations ⋮ Universal coalgebra: A theory of systems ⋮ Formalizing abstract computability: Turing categories in Coq ⋮ A tutorial on coinductive stream calculus and signal flow graphs ⋮ Pushdown tree automata, algebraic tree systems, and algebraic tree series ⋮ Context-free series on trees ⋮ Aspects of Categorical Recursion Theory ⋮ The inverse semigroup of a sum-ordered semiring ⋮ Closure functions and general iterates as reflectors ⋮ On the semantics of nested datatypes ⋮ A Fully Equational Proof of Parikh's Theorem ⋮ A categorical model for the geometry of interaction

This page was built for publication: