Classes of finite relations as initial abstract data types. I

DOI10.1016/0012-365X(91)90147-TzbMath0739.08003OpenAlexW1999991857MaRDI QIDQ1179266

Gheorghe Ştefănescu, Virgil Emil Căzănescu

Publication date: 26 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90147-t

zbMATH Keywords

initial algebrafinite relationsAxiomatizationssymmetric strict monoidal category

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05)

Related Items

A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization, An axiomatization of graphs, Normal forms for algebras of connections., Dynamic connectors for concurrency, Classes of finite relations as initial abstract data types. II

Cites Work

• More on advice on structuring compilers and proving them correct
• On the algebraic structure of rooted trees
• Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• A Perspective View of Discrete Automata and Their Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item