scientific article

zbMath0649.18001MaRDI QIDQ4040030

Rod M. Burstall, David E. Rydeheard

Publication date: 5 June 1993

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

zbMATH Keywords

algorithmsalgebraic theoriesformal systemsfunctional programming languagedata typesStandard MLcategory- theoretic constructionsunification of terms

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Abstract data types; algebraic specification (68Q65) Topoi (18B25) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Functor categories, comma categories (18A25) Research exposition (monographs, survey articles) pertaining to category theory (18-02) General theory of categories and functors (18Axx) Software, source code, etc. for problems pertaining to category theory (18-04)

Related Items

Cosheaf representations of relations and Dowker complexes ⋮ A simple abstract semantics for equational theories ⋮ Composition-nominative logics as institutions ⋮ Naturality of the conditional and the recursion^∗ ⋮ Declarative continuations: An investigation of duality in programming language semantics ⋮ Graph-grammar semantics of a higher-order programming language for distributed systems ⋮ Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials ⋮ Local causation ⋮ Categorical properties of \(M\)-indiscernibility spaces ⋮ Unnamed Item ⋮ Open Petri nets ⋮ Categorical ML -- category-theoretic modular programming ⋮ A sheaf-theoretic approach to pattern matching and related problems ⋮ Kolmogorov Complexity of Categories ⋮ Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types ⋮ Monads for the formalization of a pattern matching procedure ⋮ Structural induction in institutions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graph Transformation by Computational Category Theory ⋮ Structured Cospans ⋮ Petri nets based on Lawvere theories ⋮ Relationships between category theory and functional programming with an application ⋮ Unnamed Item ⋮ A Name Abstraction Functor for Named Sets