225382

Springer, Dordrecht

2006

642 Pages

ISBN 978-3-540-35462-8

Lecture Notes in Computer Science
vol. 4060

Algebra, meaning, and computation

essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday

Edited by

Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer

Joseph Goguen is one of the most prominent computer scientists worldwide. His numerous research contributions span many topics and have changed the way we think about many concepts. Our views about data types, programming languages, software specification and verification, computational behavior, logics in computer science, semiotics, interface design, multimedia, and consciousness, to mention just some of the areas, have all been enriched in fundamental ways by his ideas.

This Festschrift volume - published to honor Joseph Goguen on his 65th Birthdayon June 28, 2006 - includes 32 refereed papers by leading researchers in the different areas spanned by Joseph Goguen's work. The papers address a broad variety of topics from meaning, meta-logic, specification and composition, behavior and formal languages, as well as models, deduction, and computation.

The papers were presented at a Symposium in San Diego, California, USA in June 2006. Both the Festschrift volume and the Symposium allow the articulation of a retrospective and prospective view of a range of related research topics by key members of the research community in computer science and other fields connected with Joseph Goguen's work.

Publication details

DOI: 10.1007/11780274

Full citation:

Futatsugi, K. , Jouannaud, J. , Meseguer, J. (eds) (2006). Algebra, meaning, and computation: essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday, Springer, Dordrecht.

Table of Contents

Sync or swarm

Borgo David

1-24

Open Access Link
My friend Joseph Goguen

Burstall Rod

25-30

Open Access Link
Quantum institutions

Caleiro Carlos; Sernadas Cristina

50-64

Open Access Link
Semantic web languages

Lucanu Dorel; Fang Li Yuan; Song Dong Jin

99-123

Open Access Link
Some varieties of equational logic

Plotkin Gordon

150-156

Open Access Link
Extension morphisms for community

Aguirre Nazareno; Maibaum Tom; Alencar Paulo

173-193

Open Access Link
Non-intrusive formal methods and strategic rewriting for a chemical application

Andrei Oana; Ibanescu Liliana; Kirchner Hélène

194-215

Open Access Link
From obj to ml to coq

Chrząszcz Jacek; Jouannaud Jean-Pierre

216-234

Open Access Link
From obj to maude and beyond

Meseguer José

252-280

Open Access Link
Constructive action semantics in obj

Mosses Peter D.

281-295

Open Access Link
Horizontal composability revisited

Sannella Donald; Tarlecki Andrzej

296-316

Open Access Link
Proving behavioral refinements of col-specifications

Bidoit Michel; Hennicker Rolf

333-354

Open Access Link
The reactive engine for modular transducers

Huet Gérard; Razet Benoît

355-374

Open Access Link
Uniform functors on sets

Moss Lawrence S.

420-448

Open Access Link
From chaos to undefinedness

Broy Manfred

476-496

Open Access Link
Completion is an instance of abstract canonical system inference

Burel Guillaume; Kirchner Claude

497-520

Open Access Link
Eliminating dependent pattern matching

Goguen Healfdene; McBride Conor; McKinna James

521-540

Open Access Link
Iterative lexicographic path orders

van Oostrom Vincent; de Vrijer Roel

541-554

Open Access Link
A functorial framework for constraint normal logic programming

Lucio Paqui; Orejas Fernando; Pasarella Edelmira; Pino Elvira

555-577

Open Access Link
Some tips on writing proof scores in the ots/cafeobj method

Ogata Kazuhiro; Futatsugi Kokichi

596-615

Open Access Link

This document is unfortunately not available for download at the moment.