*Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday*

**Author**: Kokichi Futatsugi,Jean-Pierre Jouannaud

**Publisher:** Springer Science & Business Media

**ISBN:** 354035462X

**Category:** Computers

**Page:** 642

**View:** 6388

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 Birthday on 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.

This book constitutes the proceedings of the Third International Conference on Algebra and Coalgebra in Computer Science, CALCO 2009, formed in 2005 by joining CMCS and WADT. This year the conference was held in Udine, Italy, September 7-10, 2009. The 23 full papers were carefully reviewed and selected from 42 submissions. They are presented together with four invited talks and workshop papers from the CALCO-tools Workshop. The conference was divided into the following sessions: algebraic effects and recursive equations, theory of coalgebra, coinduction, bisimulation, stone duality, game theory, graph transformation, and software development techniques.

This book contains the proceedings of the 11th International Conference on Foundations of Software Science and Computational Structures. It covers theories and methods to support analysis, synthesis, transformation and verification of software systems.

"This comprehensive reference work provides immediate, fingertip access to state-of-the-art technology in nearly 700 self-contained articles written by over 900 international authorities. Each article in the Encyclopedia features current developments and trends in computers, software, vendors, and applications...extensive bibliographies of leading figures in the field, such as Samuel Alexander, John von Neumann, and Norbert Wiener...and in-depth analysis of future directions."

This volume began as a remembrance of Alonzo Church while he was still with us and is now finally complete. It contains papers by many well-known scholars, most of whom have been directly influenced by Church's own work. Often the emphasis is on foundational issues in logic, mathematics, computation, and philosophy - as was the case with Church's contributions, now universally recognized as having been of profound fundamental significance in those areas. The volume will be of interest to logicians, computer scientists, philosophers, and linguists. The contributions concern classical first-order logic, higher-order logic, non-classical theories of implication, set theories with universal sets, the logical and semantical paradoxes, the lambda-calculus, especially as it is used in computation, philosophical issues about meaning and ontology in the abstract sciences and in natural language, and much else. The material will be accessible to specialists in these areas and to advanced graduate students in the respective fields.

The ISSAC'88 is the thirteenth conference in a sequence of international events started in 1966 thanks to the then established ACM Special Interest Group on Symbolic and Algebraic Manipulation (SIGSAM). For the first time the two annual conferences "International Symposium on Symbolic and Algebraic Computation" (ISSAC) and "International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes" (AAECC) have taken place as a Joint Conference in Rome, July 4-8, 1988. Twelve invited papers on subjects of common interest for the two conferences are included in the proceedings and divided between this volume and the preceding volume of Lecture Notes in Computer Science which is devoted to AAECC-6. This book contains contributions on the following topics: Symbolic, Algebraic and Analytical Algorithms, Automatic Theorem Proving, Automatic Programming, Computational Geometry, Problem Representation and Solution, Languages and Systems for Symbolic Computation, Applications to Sciences, Engineering and Education.

This proceedings is based on research work on formula manipulation and computer algebra, culminating in the design and construction of a formula manipulation machine at RIKEN known as the FLATS project.

This book, which contains contributions from leading researchers in France, USA and Great Britain, gives detailed accounts of a variety of methods for describing the semantics of programming languages, i.e. for attaching to programs mathematical objects that encompass their meaning. Consideration is given to both denotational semantics, where the meaning of a program is regarded as a function from inputs to outputs, and operational semantics, where the meaning includes the sequence of states or terms generated internally during the computation. The major problems considered include equivalence relations between operational and denotational semantics, rules for obtaining optimal computations (especially for nondeterministic programs), equivalence of programs, meaning-preserving transformations of programs and program proving by assertions. Such problems are discussed for a variety of programming languages and formalisms, and a wealth of mathematical tools is described.

A collection of papers from leading researchers in algebra and geometric group theory.

* Proposes a radically new and thoroughly algorithmic approach to linear algebra * Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples * Designed for a one-semester course, this text gives the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject

*Second International Conference, SNSC 2001, Hagenberg, Austria, September 10-11, 2001, Revised Papers*

**Author**: Franz Winkler,SNSC 2001,International Conference on Symbolic and Numerical Scientific Computation

**Publisher:** Springer Science & Business Media

**ISBN:** 3540405542

**Category:** Computers

**Page:** 386

**View:** 3817

Since its initial publication, Critical Digital Studies has proven an indispensable guide to understanding digitally mediated culture. Bringing together the leading scholars in this growing field, internationally renowned scholars Arthur and Marilouise Kroker present an innovative and interdisciplinary survey of the relationship between humanity and technology. The reader offers a study of our digital future, a means of understanding the world with new analytic tools and means of communication that are defining the twenty-first century. The second edition includes new essays on the impact of social networking technologies and new media. A new section – “New Digital Media” – presents important, new articles on topics including hacktivism in the age of digital power and the relationship between gaming and capitalism. The extraordinary range and depth of the first edition has been maintained in this new edition. Critical Digital Studies will continue to provide the leading edge to readers wanting to understand the complex intersection of digital culture and human knowledge.

This book, first published in 2005, offers an introduction to the application of algebraic statistics to computational biology.

This monograph provides the first up-to-date and self-contained presentation of a recently discovered mathematical structure—the Schrödinger-Virasoro algebra. Just as Poincaré invariance or conformal (Virasoro) invariance play a key rôle in understanding, respectively, elementary particles and two-dimensional equilibrium statistical physics, this algebra of non-relativistic conformal symmetries may be expected to apply itself naturally to the study of some models of non-equilibrium statistical physics, or more specifically in the context of recent developments related to the non-relativistic AdS/CFT correspondence. The study of the structure of this infinite-dimensional Lie algebra touches upon topics as various as statistical physics, vertex algebras, Poisson geometry, integrable systems and supergeometry as well as representation theory, the cohomology of infinite-dimensional Lie algebras, and the spectral theory of Schrödinger operators.

This book constitutes the refereed proceedings of the Fifth International Conference on Algebraic and Logic Programming, ALP '96, held in Aachen, Germany, in September 1996 in conjunction with PLILP and SAS. The volume presents 21 revised full papers selected from 54 submissions; also included is an invited contribution by Claude Kirchner and Ilies Alouini entitled "Toward the Concurrent Implementation of Computational Systems". The volume is divided into topical sections on logic programming, term rewriting, integration of paradigms, abstract interpretation, Lambda-calculus and rewriting, and types.

Algorithmic Algebra studies some of the main algorithmic tools of computer algebra, covering such topics as Gröbner bases, characteristic sets, resultants and semialgebraic sets. The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra or understand the algorithms underlying many popular symbolic computational systems: Mathematica, Maple or Axiom, for instance. Also, researchers in robotics, solid modeling, computational geometry and automated theorem proving community may find it useful as symbolic algebraic techniques have begun to play an important role in these areas. The book, while being self-contained, is written at an advanced level and deals with the subject at an appropriate depth. The book is accessible to computer science students with no previous algebraic training. Some mathematical readers, on the other hand, may find it interesting to see how algorithmic constructions have been used to provide fresh proofs for some classical theorems. The book also contains a large number of exercises with solutions to selected exercises, thus making it ideal as a textbook or for self-study.

This volume contains the proceedings of the Third International Conference on Algebraic and Logic Programming, held in Pisa, Italy, September 2-4, 1992. Like the two previous conferences in Germany in 1988 and France in 1990, the third conference aims at strengthening the connections betweenalgebraic techniques and logic programming. On the one hand, logic programming has been very successful during the last decades and more and more systems compete in enhancing its expressive power. On the other hand, concepts like functions, equality theory, and modularity are particularly well handled in an algebraic framework. Common foundations of both approaches have recently been developed, and this conference is a forum for people from both areas to exchange ideas, results, and experiences. The book covers the following topics: semantics ofalgebraic and logic programming; integration of functional and logic programming; term rewriting, narrowing, and resolution; constraintlogic programming and theorem proving; concurrent features in algebraic and logic programming languages; and implementation issues.