scientific article; zbMATH DE number 4085643

MaRDI QIDQ3815296zbMATH OpenFDO

Authors David Rydeheard, John G. Stell

Publication date 1987

zbMATH Keywords

categorical logicconstruction of unification algorithmsequational theories

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Theories (e.g., algebraic theories), structure, and semantics (18C10) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• An introduction to category-based equational logic
• scientific article; zbMATH DE number 3999263
• Categorical Abstract Algebraic Logic: Categorical Algebraization of Equational Logic
• scientific article; zbMATH DE number 1841841
• Unification properties of commutative theories: a categorical treatment

Cited in

(26)

• Conditional rewriting logic as a unified model of concurrency
• Constructing inverse semigroups from category actions
• A categorical critical-pair completion algorithm
• Categorical shape theory as a formal language for pattern recognition?
• Finite limits and anti-unification in substitution categories
• Relative full completeness for bicategorical Cartesian closed structure
• Computing over K-modules
• scientific article; zbMATH DE number 4071154 (Why is no real title available?)
• scientific article; zbMATH DE number 29052 (Why is no real title available?)
• scientific article; zbMATH DE number 40567 (Why is no real title available?)
• scientific article; zbMATH DE number 3999263 (Why is no real title available?)
• scientific article; zbMATH DE number 1841841 (Why is no real title available?)
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• A semantics for type checking
• An abstract formulation for rewrite systems
• An introduction to category-based equational logic
• CPO models for infinite term rewriting
• A categorical reduction system for linear logic
• Term Rewriting and Applications
• Complete Categorical Deduction for Satisfaction as Injectivity
• Context rewriting
• Conditional rewriting logic: Deduction, models and concurrency
• Unique-sort order-sorted theories : A description as monad morphisms
• Using categorical methods in computer science
• Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus
• An algebraic approach to stable domains

Describes a project that uses

Uses Software

• LCF

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 Q3815296)