Design and Implementation of Symbolic Computation Systems

Problem-oriented applications of automated theorem proving.- ?IT — A strongly-typed embeddable computer algebra library.- DiscAtinf: A general framework for implementing calculi and strategies.- Equality elimination for the tableau method.- Towards lean proof checking.- WALDMEISTER: High performance equation theorem proving.- A reflective language based on conditional term rewriting.- Term rewriting systems: An h-categorical semantic.- Generative geometric modeling in a functional environment.- Exploiting SML for experimenting with algebraic algorithms: The example of p-adic lifting.- Conditional categories and domains.- Parameterizing object specifications.- Analyzing the dynamics of a Z specification.- Walking faster.- Integer and rational arithmetic on masPar.- Parallel 3-primes FFT algorithm.- A master-slave approach to parallel term rewriting on a hierarchical multiprocessor.- Multi-agent cooperation — Concepts and applications.- Document-centered presentation of computing software: Compound documents are better workspaces.- Animating a non-executable formal specification with a distributed symbolic language.- Uniform representation of basic algebraic structures in computer algebra.- Integrating computer algebra with proof planning.- Structures for symbolic mathematical reasoning and computation.- Implementing FS0 in Isabelle: Adding structure at the metalevel.- An approach to class reasoning in symbolic computation.- An intelligent interface to numerical routines.- Computer algebra and the World Wide Web.- Interfacing REDUCE to Java.- Software architectures for computer algebra: A case study.- A deductive database for mathematical formulas.- CASA — A system for Computer Aided Constructive Algebraic geometry.- Making systems communicate and cooperate: The Central Control approach.- A database for number fields.- Compiling residuation for a multiparadigm symbolic programming language.- Pluggability issues in the Multi Protocol.