## Logical Foundations of CafeOBJ (0)

Venue: | Theoretical Computer Science |

Citations: | 10 - 1 self |

### BibTeX

@ARTICLE{Diaconescu_logicalfoundations,

author = {Razvan Diaconescu and Kokichi Futatsugi},

title = {Logical Foundations of CafeOBJ},

journal = {Theoretical Computer Science},

year = {},

volume = {285},

pages = {289--318}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper surveys the logical and mathematical foundations of CafeOBJ, which is a successor of the famous algebraic specification language OBJ but adding several new primitive paradigms such as behavioural concurrent specification and rewriting logic. We first give a concise overview of CafeOBJ. Then we focus on the actual logical foundations of the language at two different levels: basic specification and structured specification, including also the definition of the CafeOBJ institution. We survey some novel or more classical theoretical concepts supporting the logical foundations of CafeOBJ together with pointing to the main results but without giving proofs and without discussing all mathematical details. Novel theoretical concepts include the coherent hidden algebra formalism and its combination with rewriting logic, and Grothendieck (or fibred) institutions. However for proofs and for some of the mathematical details not discussed here we give pointers to relevant publications. ...