Characterizing specification languages which admit initial semantics
From MaRDI portal
Publication:792080
DOI10.1016/0304-3975(84)90125-7zbMATH Open0536.68011OpenAlexW2002486184WikidataQ127840246 ScholiaQ127840246MaRDI QIDQ792080FDOQ792080
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
Recommendations
Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completeness of calculii for axiomatically defined classes of algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Freeness in classes without equality
- Algebraic approach to single-pushout graph transformation
- Specifications in an arbitrary institution
- The equational theory of parameterized specifications
- On the existence of free models in abstract algebraic institutions
- Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach
- Typed equivalence, type assignment, and type containment
- Quasi-varieties in abstract algebraic institutions
- Logics of finite Hankel rank
- A decade of TAPSOFT. Aspects of progress and prospects in theory and practice of software development
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)