Characterizing specification languages which admit initial semantics

DOI10.1016/0304-3975(84)90125-7MaRDI QIDQ792080zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• The meaning of specifications I: Domains and initial models
• Expressive power of specification languages
• scientific article; zbMATH DE number 3936493
• Algebraic specifications of computable and semicomputable data types
• On the power of higher-order algebraic specification methods

Cites work

• scientific article; zbMATH DE number 3881877 (Why is no real title available?)
• scientific article; zbMATH DE number 3819805 (Why is no real title available?)
• scientific article; zbMATH DE number 3821084 (Why is no real title available?)
• scientific article; zbMATH DE number 3827186 (Why is no real title available?)
• scientific article; zbMATH DE number 3653518 (Why is no real title available?)
• scientific article; zbMATH DE number 3714904 (Why is no real title available?)
• scientific article; zbMATH DE number 3776840 (Why is no real title available?)
• scientific article; zbMATH DE number 3492639 (Why is no real title available?)
• scientific article; zbMATH DE number 3536298 (Why is no real title available?)
• scientific article; zbMATH DE number 3550662 (Why is no real title available?)
• scientific article; zbMATH DE number 3290336 (Why is no real title available?)
• Completeness of calculii for axiomatically defined classes of algebras

Cited in

(10)

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

This page was built for publication: Characterizing specification languages which admit initial semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792080)