scientific article

Publication date: 23 January 1993

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

monoidal categories limits linear logic categories monads functors internal categories typed lambda calculus adjunctions categorical semantics natural transformations internal models recursive domain equations closed categories type-free lambda calculus second-order lambda calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to category theory (18-01)

Related Items

\(F\)-semantics for type assignment systems, A computable expression of closure to efficient causation, What is a categorical model of the differential and the resource λ-calculi?, Data Intensive Distributed Computing in Data Aware Self-organizing Networks, Categorical Models for Simply Typed Resource Calculi, Effective applicative structures, Stable power domains, Logic in Category Theory, Pullback in partial morphism categories, Causal categories: relativistically interacting processes, Equational properties of iteration in algebraically complete categories, On collecting semantics for program analysis, A relational semantics for parallelism and non-determinism in a functional setting, The differential method and the causal incompleteness of programming theory in molecular biology, Causal dependencies in multiplicative linear logic with MIX, Approximating Markov processes through filtration, Indexed containers, Categorical properties of \(M\)-indiscernibility spaces, Unnamed Item, A specification structure for deadlock-freedom of synchronous processes, Products in categories of relations, Unnamed Item, Unnamed Item, Unnamed Item, POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE, Algorithm design through the optimization of reuse-based generation, Fixed-point operations on ccc's. I, Categorical models of polymorphism, Unnamed Item, An algebraic semantics for structured transition systems and its application to logic programs, On the Relationship between Filter Spaces and Weak Limit Spaces, On injectivity in category of rough sets, Conditionally reversible computations and weak universality in category theory, Subtractive logic, Concrete data structures and functional parallel programming, Linear realizability and full completeness for typed lambda-calculi, A semantic basis for Quest, Closedness of the category of liminf complete fuzzy orders, A Relational Model of a Parallel and Non-deterministic λ-Calculus, Safe \& robust reachability analysis of hybrid systems, Domains via graphs, Node rewriting in graphs and hypergraphs: A categorical framework, Unnamed Item, From exact sciences to life phenomena: Following Schrödinger and Turing on programs, life and causality, From environments to representations -- a mathematical theory of artificial perceptions, The sequential topology on is not regular, Relationships between category theory and functional programming with an application, On the algebraic structure of declarative programming languages, Universal monos in partial morphism categories, Graphical reasoning in compact closed categories for quantum computation, Topology, domain theory and theoretical computer science, Automorphisms of types in certain type theories and representation of finite groups, A structural approach to reversible computation, Modeling Pointer Redirection as Cyclic Term-graph Rewriting, A categorical understanding of environment machines, The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus, Essential and relational models