Type inference using unification in computer algebra

  • J. Calmet
  • H. Comon
  • D. Lugiez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 307)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1-.
    H. Comon, D. Lugiez and Ph. Sshnoebelen, Type Inference in Computer Algebra. To appear in the proceedings of ISSAC '87, Leipzig, DDR; LNCS, Springer-Verlag. A long version will appear as an internal LIFIA report.Google Scholar
  2. 2-.
    A. Fortenbacher, R.D. Jenks, M. Lucks, R.S. Sutor, B.M. Trager and S.M. Watt, An Overview of the Scratchpad II Language and System. IBM Research Report, July 1985.Google Scholar
  3. 3-.
    J. Calmet and D. Lugiez, A Knowledge-Based System for Computer Algebra. ACM-SIGSAM Bulletin, 22(1), pp. 7–13, 1987.Google Scholar
  4. 4-.
    R. Milner, A Theory of Type Polymorphism in Programming. J.C.S.S. 17, pp348–375, 1978.Google Scholar
  5. 5-.
    D. Bert and R. Echahed, Design and Implementation of a Generic, Logic and Functional Programming Language. Proc. of ESOP, LNCS 213, pp 119–132, 1985.Google Scholar
  6. 6-.
    M. Schmidt-Schauss, Unification in Many Sorted Equational Theory. 8-th CADE Conference, LNCS 230, pp 538–552, 1986.Google Scholar
  7. 7-.
    J.M. Hullot, Canonical Forms and Unification. 5th CAD, LNCS 87, pp 318–334, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • J. Calmet
    • 1
  • H. Comon
    • 1
  • D. Lugiez
    • 1
  1. 1.LIFIAGrenoble CedexFrance

Personalised recommendations