Design and Implementation of Symbolic Computation Systems

1. Front Matter

   PDF

2. Current problems in computer algebra systems design

   • J. H. Davenport

   Pages 1-9

3. The design of cayley — a language for modern algebra

   • Greg Butler, John Cannon

   Pages 10-19

4. CoCoA: A user-friendly system for commutative algebra

   • Alessandro Giovini, Gianfranco Niesi

   Pages 20-29

5. The design of SISYPHE : a system for doing symbolic and algebraic computations

   • A. Galligo, J. Grimm, L. Pottier

   Pages 30-39

6. Scratchpad's view of algebra I: Basic commutative algebra

   • J. H. Davenport, B. M. Trager

   Pages 40-54

7. Design issues for a computed-aided environment for constructive mathematics

   • Gerard Huet

   Pages 55-55

8. Efficient type inference and coercion in computer algebra

   • Albrecht Fortenbacher

   Pages 56-60

9. Abstract specification of mathematical structures and methods

   • Carla Limongelli, M. Beatrice Mele, Mauro Regio, Marco Temperini

   Pages 61-70

10. Programming paradigms for symbolic computation systems analysis of an example

    • Uwe Petermann

    Pages 71-80

11. The computation of Gröbner bases on a shared memory multiprocessor

    • Jean-Philippe Vidal

    Pages 81-90

12. A theory for program and data type specification

    • Carolyn Talcott

    Pages 91-100

13. Context induction: A proof principle for behavioural abstractions

    • Rolf Hennicker

    Pages 101-110

14. Completion modulo associativity, commutativity and identity (AC1)

    • Jean-Pierre Jouannaud, Claude Marché

    Pages 111-120

15. Polymorphic type checking with subtypes in Prolog

    • Thom W. Frühwirth

    Pages 121-130

16. On the power of subsumption and context checks

    • Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop

    Pages 131-140

17. Putting algebraic components together: A dependent type approach

    • Jean-Claude Reynaud

    Pages 141-150

18. The use of proof plans in formal methods

    • Alan Bundy

    Pages 151-153

19. A prolog technology theorem prover: A new exposition and implementation in Prolog

    • Mark E. Stickel

    Pages 154-163

20. Parametric queries, linear constraints and variable elimination

    • Jean-Louis Lassez

    Pages 164-173

The growing importance of the systems for symbolic computation has greatly influenced the decision of organizing DISCO '90 which is short for International Symposium on Design and Implementation of Symbolic Computation Systems. DISCO '90 focuses mainly on the most innovative methodological and technological aspects of hardware and software system design and implementation for Symbolic and Algebraic Computation, Automated Reasoning, Software Environments (Languages and User Interfaces), and Automatic Programming. In particular, it includes papers on the design and the development of significant running systems. The general objective of DISCO '90 is to present an up-to-date view of the field, while encouraging the scientific exchange among academic, industrial and user communities of the development of systems for symbolic computation.

• Computeralgebra
• Scratch
• Softwareumgebungen
• Symbolisches Rechnen
• System
• automated reasoning
• automation
• automatisches Programmieren
• automatisches Schließen
• expert system
• formal method
• logic
• object
• programming
• proving

Policies and ethics