On the algebra of order

DOI10.1016/0022-0000(80)90038-0zbMath0442.68010OpenAlexW2068599721MaRDI QIDQ1143782

Daniel J. Lehmann

Publication date: 1980

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(80)90038-0

zbMATH Keywords

posetscompletionsordered data typesquotientsordered algebrascontinuous algebrascategorical approachT-algebramathematical semantics

Mathematics Subject Classification ID

Data structures (68P05) Special categories (18B99) Quasivarieties (08C15) Categories of algebras (08C05)

Related Items (4)

Algebraic solutions to recursion schemes ⋮ Datatype laws without signatures ⋮ Epis need not be dense ⋮ P-varieties - a signature independent characterization of varieties of ordered algebras

Cites Work

• A uniform approach to inductive posets and inductive closure
• Final algebra semantics and data type extensions
• Effectively given domains
• Varieties of ordered algebras
• Computability concepts for programming language semantics
• Categories of chain-complete posets
• Fixed-point constructions in order-enriched categories
• Categorial characterization of the MacNeille completion
• Coequalizers and free triples
• Algebraic specification of data types: A synthetic approach
• Data Type Specification: Parameterization and the Power of Specification Techniques
• Bases for Chain-complete Posets
• Initial Algebra Semantics and Continuous Algebras
• Colimits of algebras revisited
• Abstract data types and software validation
• Proving Properties of Programs by Structural Induction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the algebra of order