DISCO 1996: Karlsruhe, Germany

• Wolfgang Bibel, Daniel S. Korn, Christoph Kreitz, Stephen Schmitt:
  Problem-Oriented Applications of Automated Theorem Proving. 1-21
  
• Manuel Bronstein:
  Sigma^IT - A Strongly-Typed Embeddable Computer Algebra Library. 22-33
  
• Christophe Bourely, Nicolas Peltier:
  Disc_Atinf: A General Framework for Implementing Calculi and Strategies. 34-45
  
• Anatoli Degtyarev, Andrei Voronkov:
  Equality Elimination for the Tableau Method. 46-60
  
• Gilles Barthe, Hugo Elbers:
  Towards Lean Proof Checking. 61-62
  
• Arnim Buch, Thomas Hillenbrand, Roland Fettig:
  WALDMEISTER: High Performance Equational Theorem Proving. 63-64
  
• Masanobu Numazawa, Masahito Kurihara, Azuma Ohuchi:
  A Reflective Language Based on Conditional Term Rewriting. 65-66
  
• Giulio Balestreri:
  Term Rewriting Systems: An h-Categorical Semantic. 67-78
  
• Alberto Paoluzzi:
  Generative Geometric Modeling in a Functional Environment. 79-97
  
• Wolfgang Gehrke, Carla Limongelli:
  Exploiting SML for Experimenting with Algebraic Algorithms: The Example of p-adic Lifting. 98-111
  
• Philip S. Santas:
  Conditional Categories and Domains. 112-125
  
• Martin Gogolla:
  Parameterizing Object Specifications. 126-137
  
• Paolo Ciancarini, Cecilia Mascolo:
  Analyzing the Dynamics of a Z Specification. 138-149
  
• Beatrice Amrhein, Oliver Gloor, Wolfgang Küchlin:
  Walking Faster. 150-161
  
• Tudor Jebelean:
  Integer and Rational Arithmetic on MasPar. 162-173
  
• Giovanni Cesari, Roman Maeder:
  Parallel 3-Primes FFT Algorithm. 174-182
  
• Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin:
  A Master-Slave Approach to Parallel Term Rewriting on a Hierarchical Multiprocessor. 183-194
  
• Hans Haugeneder, Donald Steiner:
  Multi-Agent Cooperation - Concepts and Applications. 195-197
  
• Wolfgang Weck:
  Document-Centered Presentation of Computing Software: Compound Documents Are Better Workspaces. 198-199
  
• Paolo Ciancarini, Stelvio Cimato:
  Animating a Non-executable Formal Specification with a Distributed Symbolic Language. 200-201
  
• Carla Limongelli, Giuseppina Malerba, Marco Temperini:
  Uniform Representation of Basic Algebraic Structures in Computer Algebra. 202-203
  
• Manfred Kerber, Michael Kohlhase, Volker Sorge:
  Integrating Computer Algebra with Proof Planning. 204-215
  
• Karsten Homann, Jacques Calmet:
  Structures for Symbolic Mathematical Reasoning and Computation. 216-227
  
• Seán Matthews:
  Implementing FS₀ in Isabelle: Adding Structure at the Metalevel. 228-239
  
• Gianna Cioni, Attilio Colagrossi, Marco Temperini:
  An Approach to Class Reasoning in Symbolic Computation. 240-251
  
• Brian J. Dupée, James H. Davenport:
  An Intelligent Interface to Numerical Routines. 252-262
  
• Anthony C. Hearn:
  Computer Algebra and the World Wide Web. 263-270
  
• Arthur Norman, John Fitch:
  Interfacing REDUCE to Java. 271-276
  
• Gregory Butler:
  Software Architectures for Computer Algebra: A Case Study. 277-286
  
• Stéphane Dalmas, Marc Gaëtano, Claude Huchet:
  A Deductive Database for Mathematical Formulas. 287-296
  
• Michal Mnuk, Franz Winkler:
  CASA - A System for Computer Aided Constructive Algebraic Geometry. 297-307
  
• Stéphane Dalmas, Marc Gaëtano:
  Making Systems Communicate and Cooperate: The Central Control Approach. 308-319
  
• Mario Daberkow, Andreas Weber:
  A Database for Number Fields. 320-330
  
• Grigorios Grivas, Alexios Palinginis:
  Compiling Residuation for a Multiparadigm Symbolic Programming Language. 331-342
  
• Simon Gray, Norbert Kajler, Paul S. Wang:
  Pluggability Issues in the Multi Protocol. 343-356