Skip to main content
SpringerLink
Log in

Extending AlgBench with a type system

  • Conference paper
  • First Online:
Design and Implementation of Symbolic Computation Systems (DISCO 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 722))

  • 209 Accesses

Abstract

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.

Research supported by the Swiss National Science Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Abelson and G. J. Sussman. Structure and Interpretation of Computer Programs The MIT Press, Cambridge, Mass., 1985.

    Google Scholar 

  2. L. Cardelli and P. Wegner. On Understanding, Data Abstraction and Polymorphism. ACM Computing Surveys, 17: 471–522, 1985.

    Article  Google Scholar 

  3. Joseph A. Goguen et al. Introducing OBJ. Technical report, SRI International, March 1992.

    Google Scholar 

  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. Richard D. Jenks and Robert S. Sutor. Axiom: the scientific computation system. Springer, 1992.

    Google Scholar 

  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. N. Marti-Oliet and J. Meseguer. Inclusions and Subtypes. Technical report, SRI International, December 1990.

    Google Scholar 

  8. Stephan A. Missura. Klassenbasierte Umgebung für algebraische Modellierungen in AlgBench. Diploma Thesis, ETH Zurich, 1992.

    Google Scholar 

  9. Lawrence C. Paulson. Introduction to Isabelle. Technical report, Computer Laboratory, University of Cambridge, 1993.

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Institute for Theoretical Computer Science ETH Zürich, CH-8092, Zürich, Switzerland

    Stephan A. Missura

Authors
  1. Stephan A. Missura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Miola

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Missura, S.A. (1993). Extending AlgBench with a type system. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1993. Lecture Notes in Computer Science, vol 722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013190

Download citation

  • DOI: https://doi.org/10.1007/BFb0013190

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57235-0

  • Online ISBN: 978-3-540-47985-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation