Design and Implementation of Symbolic Computation Systems : International Symposium, DISCO '96 Karlsruhe, Germany, September 18-20, 1996 Proceedings / edited by Jacques Calmet, Carla Limongelli.
Contributor(s): Calmet, Jacques | Limongelli, CarlaMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 1128.Publisher: Berlin, Heidelberg : Springer-Verlag, 1996Description: 1 online resource : v.: digitalContent type: text Media type: computer Carrier type: online resourceISBN: 9783540706359; 3540706356; 3540616977; 9783540616979Subject(s): Computer science | Software engineering | Algebra -- Data processing | Artificial intelligence | Algorithms | Algebra -- Data processing | Algorithms | Artificial intelligence | Computer science | Software engineering | Computer Science | Engineering & Applied SciencesGenre/Form: Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.131 LOC classification: QA76.9.S88 | I576 1996Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references.
This book presents the refereed proceedings of the Fourth International Symposium on Design and Implementation of Symbolic Computation Systems, DISCO '96, held in Karlsruhe, Germany, in September 1996. The volume includes four invited contributions surveying the state of the art in a particular subfield or pointing to some new research directions together with 31 revised full papers selected from a total of some 70 submissions. Many current aspects of mathematical software systems, as employed e.g. in computer algebra, automated theorem proving, or al- gebraic specification are addressed.
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.