Search for Author All Reviews
	Meseguer, Jose     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       All about Maude - a high-performance logical framework: how to specify, program, and verify systems in rewriting logic (Lecture Notes in Computer Science 4350) Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., Talcott C., Springer-Verlag New York, Inc., Secaucus, NJ, 2007. 799 pp.  Type: Book (9783540719403) Maude is a rich logical framework with a distinguished history. Its roots lie in the work on order-sorted algebra by Goguen and Meseguer in the late 1980s and early 1990s. The first programming environments for order-sort...... Mar 4 2008     Algebra, meaning, and computation: essays dedicated to Joseph A. Goguen on the occasion of His 65th Birthday (Lecture Notes in Computer Science 4060) Futatsugi K., Jouannaud J., Meseguer J., Springer-Verlag New York, Inc., Secaucus, NJ, 2006. 643 pp.  Type: Book (9783540354628) Joseph A. Goguen was a world-class computer scientist whose work centered on the most abstract features of computer science. His central insight was that computer structures were grounded in abstract algebra. His particular interests i...... Jan 15 2007     Process versus unfolding semantics for place/transition Petri nets Meseguer J., Montanari U., Sassone V. (ed) Theoretical Computer Science 153(1-2): 171-210, 1996.  Type: Article A categorical approach is used to study the relationship among various semantics for place/transition Petri nets. In particular, the authors consider nonsequential processes semantics, unfolding semantics, and algebraic model semantics...... Aug 1 1997     Final algebras, cosemicomputable algebras and degrees of unsolvability Moss L. (ed), Meseguer J., Goguen J. (ed) Theoretical Computer Science 100(2): 267-302, 1992.  Type: Article The computability of an abstract data type is a measure of the complexity of this data type; it is also a measure of the adequacy of specification methods. An abstract data type is computable or semicomputable if a decis...... Aug 1 1993     Unifying functional, object-oriented and relational programming with logical semantics Goguen J. (ed), Meseguer J., MIT Press, Cambridge, MA, 1987.  Type: Book (9780262192644) This paper describes a unification of three powerful programming styles: functional, relational (this term is used because ‘logic’ programming has some nonlogical features), and object-oriented. Starting from the kn...... May 1 1989
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy