Skip to main content
  • 871 Accesses

Abstract

Functional programming does not normally concern itself with the order in which processes are executed; just that if a process can be completed it is done before those that are still waiting for all their parameter values to be accessible. Thus, parallel operations that are complete may be carried out in any order. In some cases, the specific order of doing operations must be forced. Order is important in the case where a program is controlling a process in real time. As you might expect, all because it is possible (say) to steer left before right does not mean that it should be done in that order.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Addis, T. R. (1985) ‘Designing Knowledge-Based Systems’ Prentice-Hall, Upper Saddle River, NJ, ISBN 0-13-201823-3.

    Google Scholar 

  • Date, C. J. (1995) ‘An Introduction to Database Systems’ Sixth edition, Addis-Wesley Publishing Company, Boston, MA, ISBN 0-201-82458-2.

    MATH  Google Scholar 

  • Newell, A. and Simon, H. A. (1963) GPS, a Program that Simulates Human Thought. Computers and Thoughtedited by Feigenbaum, E. A. and Fieldman, J., McGraw-Hill Book Company, New York, Library of Congress Catalog Card Number 63-17596.

    Google Scholar 

  • Newell, A., Shaw, J. C. and Simon, H. A. (1963) ‘Empirical Explorations with the logic theory machine: a case study in heuristics’, Computers and Thought, editied by Feigenbaum, E. A. and Fieldman, J., McGraw-Hill Book Company, Library of Congress Catalog Card Number 63-17596.

    Google Scholar 

  • Nilson, N. J., (1998) ‘Artificial Intelligence: A new Synthesis’, Morgan Kaufmann publishers Inc, San Mateo, California, ISBN 1-55860-535-5.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Addis, T., Addis, J. (2010). Side Effect Programming and Schematic Design. In: Drawing Programs: The Theory and Practice of Schematic Functional Programming. Springer, London. https://doi.org/10.1007/978-1-84882-618-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-618-2_7

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-619-9

  • Online ISBN: 978-1-84882-618-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics