Characterizing specification languages which admit initial semantics

DOI10.1016/0304-3975(84)90125-7zbMath0536.68011OpenAlexW2002486184WikidataQ127840246 ScholiaQ127840246MaRDI QIDQ792080

Bernd Mahr, Johann A. Makowsky

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90125-7

zbMATH Keywords

equivalencereducibilityabstract data types

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)

Related Items (10)

Typed equivalence, type assignment, and type containment ⋮ On the existence of free models in abstract algebraic institutions ⋮ Quasi-varieties in abstract algebraic institutions ⋮ Specifications in an arbitrary institution ⋮ The equational theory of parameterized specifications ⋮ Logics of Finite Hankel Rank ⋮ A decade of TAPSOFT ⋮ Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach ⋮ Algebraic approach to single-pushout graph transformation ⋮ Freeness in classes without equality

Cites Work

• Completeness of calculii for axiomatically defined classes of algebras
• 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: Characterizing specification languages which admit initial semantics