Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
JA Goguen, J Meseguer - Theoretical Computer Science, 1992 - Elsevier
This paper generalizes many-sorted algebra (MSA) to order-sorted algebra (OSA) by
allowing a partial ordering relation on the set of sorts. This supports abstract data types with …
allowing a partial ordering relation on the set of sorts. This supports abstract data types with …
Membership algebra as a logical framework for equational specification
J Meseguer - International Workshop on Algebraic Development …, 1997 - Springer
This paper proposes membership equational logic—a Horn logic in which the basic
predicates are equations t= t′ and membership assertions t: s stating that a term t belongs …
predicates are equations t= t′ and membership assertions t: s stating that a term t belongs …
[ΒΙΒΛΙΟ][B] Introducing obj
JA Goguen, T Winkler, J Meseguer, K Futatsugi… - 2000 - Springer
This is an introduction to the philosophy and use of OBJ, emphasizing its oper-ational
semantics, with aspects of its history and its logical semantics. Release 2 of OBJ3 is …
semantics, with aspects of its history and its logical semantics. Release 2 of OBJ3 is …
[ΒΙΒΛΙΟ][B] Foundations of algebraic specification and formal software development
D Sannella - 2012 - Springer
As its title promises, this book provides foundations for software specification and formal
software development from the perspective of work on algebraic specification. It …
software development from the perspective of work on algebraic specification. It …
Specification and proof in membership equational logic
This paper is part of a long-term effort to increase expressiveness of algebraic specification
languages while at the same time having a simple semantic foundation on which efficient …
languages while at the same time having a simple semantic foundation on which efficient …
Theorem proving and algebra
JA Goguen - arxiv preprint arxiv:2101.02690, 2021 - arxiv.org
This book can be seen either as a text on theorem proving that uses techniques from
general algebra, or else as a text on general algebra illustrated and made concrete by …
general algebra, or else as a text on general algebra illustrated and made concrete by …
Hidden logic
G Rosu - 2000 - search.proquest.com
Cleverly designed software often fails to satisfy its requirements strictly, but instead satisfies
them behaviorally, in the sense that they appear to be satisfied under every experiment that …
them behaviorally, in the sense that they appear to be satisfied under every experiment that …
From abstract data types to logical frameworks
This paper surveys ways in which the ideas and concepts developed in the research field of
abstract data types have undergone a vigorous process of generalization that has led to the …
abstract data types have undergone a vigorous process of generalization that has led to the …
On the multi-language construction
S Buro, I Mastroeni - … Languages and Systems: 28th European Symposium …, 2019 - Springer
Modern software is no more developed in a single programming language. Instead,
programmers tend to exploit cross-language interoperability mechanisms to combine code …
programmers tend to exploit cross-language interoperability mechanisms to combine code …
Semantics of order-sorted specifications
U Waldmann - Theoretical Computer Science, 1992 - Elsevier
Order-sorted specifications (ie many-sorted specifications with subsort relations) have been
proved to be a useful tool for the description of partially defined functions and error handling …
proved to be a useful tool for the description of partially defined functions and error handling …