Skip to main content
SpringerLink
Log in

Escaping from intermediate expression swell: a continuing saga

  • 7. Systems
  • Conference paper
  • First Online:
Computer Algebra (EUROCAM 1982)

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

Included in the following conference series:

Abstract

The notion of a closed continuation is introduced, and a functional dialect of LISP is presented, using function call and return based on this concept, by extension coroutines are shown to be merely a more general form of function. Potential applications for coroutines in algebraic simplification and expression evaluation are suggested, and a specific example of their use is given in a novel attack on the phenomenon of intermediate expression swell in polynomial multiplication.

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

  • Evans A. PAL — A language for teaching programming linguistics. Proc ACM 23rd National Conference.

    Google Scholar 

  • Gordon M. The denotational semantics of programming languages. Springer-Verlag 1979.

    Google Scholar 

  • Hearn A.C. REDUCE 2 Users Manual University of Utah Computational Physics Group UCP-19 (1973).

    Google Scholar 

  • Hewitt C. Protection and Synchronisation in Actor Systems MIT AI Lab Working Paper 83, Nov 1974.

    Google Scholar 

  • Johnson S.C. Sparse Polynomial Arithmetic. SIGSAM Conf. on Algebraic Manipulation, 1974.

    Google Scholar 

  • Lindstrom G & Soffa M. Referencing and retention in block-structured coroutines. TOPLAS Jul 1981 263–292.

    Google Scholar 

  • Marti J, Hearn A, Griss M, Griss C. The Standard LISP Report. SIGPLAN Notices 1979 14, 10 48–68

    Google Scholar 

  • Moody K & Richards M. A coroutine mechanism for BCPL. Software Practice and Experience, 1980 765–771.

    Google Scholar 

  • Muchnik S & Pleban U. A semantic comparison of LISP and SCHEME. Proceedings of the LISP conf., Stanford 1980, 56–63.

    Google Scholar 

  • Scott D & Strachey C. Toward a mathematical semantics for computer languages. Oxford Programming Research Group, PRG-6 1971.

    Google Scholar 

  • Strachey C & Wadsworth C. Continuations, a mathematical semantics for handling full jumps. Oxford Programming Research Group, PRG-11 1974.

    Google Scholar 

  • Tennent R. The denotational semantics of programming languages. CACM Aug 1976 437–453

    Google Scholar 

  • Thompson K. et al The UNIX Time-Sharing System Bell System Technical Journal, Jul-Aug 1978, Vol 57, No.6 part 2

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of Bath, Avon, England

    J. A. Padget

Authors
  1. J. A. Padget
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Padget, J.A. (1982). Escaping from intermediate expression swell: a continuing saga. In: Calmet, J. (eds) Computer Algebra. EUROCAM 1982. Lecture Notes in Computer Science, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11607-9_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-11607-9_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11607-3

  • Online ISBN: 978-3-540-39433-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation