Extending AlgBench with a type system

  • Stephan A. Missura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 722)


This paper presents some design decisions taken in the ongoing project of extending the symbolic computation system AlgBench with a type system. The only mechanism for structuring values in AlgBench are classes which are first-class values and anonymous, hence type constructors are simple functions. We show how within this approach abstract datatypes and categories can be modelled. Subtyping by means of embeddings (inclusions) is distinguished from subtyping by coercions to avoid some deficiencies which arise in a coercion-based mechanism. Furthermore, we allow to compute with “declared-only” identifiers to retain the symbolic capabilities of the original AlgBench.


Type System Computer Algebra Symbolic Computation Concrete Syntax Type Constructor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. Abelson and G. J. Sussman. Structure and Interpretation of Computer Programs The MIT Press, Cambridge, Mass., 1985.Google Scholar
  2. 2.
    L. Cardelli and P. Wegner. On Understanding, Data Abstraction and Polymorphism. ACM Computing Surveys, 17: 471–522, 1985.CrossRefGoogle Scholar
  3. 3.
    Joseph A. Goguen et al. Introducing OBJ. Technical report, SRI International, March 1992.Google Scholar
  4. 4.
    A. Fortenbacher. Efficient type inference and coercion in computer algebra. In DISCO90 (Lecture Notes in Computer Science), pages 56–60. Springer Verlag, 1990.Google Scholar
  5. 5.
    Richard D. Jenks and Robert S. Sutor. Axiom: the scientific computation system. Springer, 1992.Google Scholar
  6. 6.
    Roman E. Maeder. Algbench: An object-oriented symbolic core system. In J. H. Davenport, editor, Design and Implementation of Symbolic Computation Systems (Proceedings of DISCO '92). (to appear), 1992.Google Scholar
  7. 7.
    N. Marti-Oliet and J. Meseguer. Inclusions and Subtypes. Technical report, SRI International, December 1990.Google Scholar
  8. 8.
    Stephan A. Missura. Klassenbasierte Umgebung für algebraische Modellierungen in AlgBench. Diploma Thesis, ETH Zurich, 1992.Google Scholar
  9. 9.
    Lawrence C. Paulson. Introduction to Isabelle. Technical report, Computer Laboratory, University of Cambridge, 1993.Google Scholar
  10. 10.
    John C. Reynolds. Using category theory to design implicit conversions and generic operators. In Neil D. Jones, editor, Semantics-Directed Compiler Generation, Workshop, volume 94 of Lecture Notes in Computer Science, pages 211–258, Aarhus, Denmark, January 1980. Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Stephan A. Missura
    • 1
  1. 1.Institute for Theoretical Computer Science ETH ZürichZürichSwitzerland

Personalised recommendations