Fork Algebras as a Sufficiently Rich Universal Institution

Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, several propositional monomodal logics, propositional and first-order dynamic logic, and propositional and first-order linear temporal logic in the theory of fork algebras. In this paper we formalize these interpretability results as institution representations from the institution of the corresponding logics to that of fork algebra. We also advocate for the institution of fork algebras as a sufficiently rich universal institution into which institutions meaningful in software development can be represented.

[1]  Magne Haveraaen,et al.  Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification , 1995 .

[2]  Marcelo F. Frias,et al.  Interpretability of first-order linear temporal logics in fork algebras , 2006, J. Log. Algebraic Methods Program..

[3]  Marcelo F. Frias,et al.  Equational Reasoning in Non--Classical Logics , 1998, J. Appl. Non Class. Logics.

[4]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[5]  José Meseguer,et al.  General Logics , 2006 .

[6]  Ivar Jacobson,et al.  The Unified Modeling Language User Guide , 1998, J. Database Manag..

[7]  Marcelo F. Frias,et al.  Fork Algebras in Algebra, Logic and Computer Science , 2002, Fundam. Informaticae.

[8]  Marcelo F. Frias,et al.  Interpretability of First-Order Dynamic Logic in a Relational Calculus , 2001, RelMiCS.

[9]  Joseph A. Goguen,et al.  Introducing Institutions , 1983, Logic of Programs.

[10]  Jean-Pierre Jouannaud,et al.  Operational Semantics for Order-Sorted Algebra , 1985, ICALP.

[11]  José Luiz Fiadeiro.  On the Emergence of Properties in Component-Based Systems , 1996, AMAST.

[12]  José Luiz Fiadeiro,et al.  Structuring Theories on Consequence , 1988, ADT.

[13]  Roger D. Maddux.  Finitary Algebraic Logic , 1989, Math. Log. Q..

[14]  Andrzej Tarlecki.  Moving Between Logical Systems , 1995, COMPASS/ADT.

[15]  Georg Struth,et al.  Relational and Kleene-Algebraic Methods in Computer Science , 2003, Lecture Notes in Computer Science.

[16]  Marcelo F. Frias,et al.  A strategy for efficient verification of relational specifications, based on monotonicity analysis , 2005, ASE '05.

[17]  Natarajan Shankar,et al.  A Semantic Embedding of theA g Dynamic Logic in PVS , 2003 .

[18]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[19]  José Luiz Fiadeiro.  Categories for software engineering , 2005 .