Skip to main content

Imperative Specification Programming

  • Chapter
Software Engineering 1

Part of the book series: Texts in Theoretical Computer Science an EATCS Series ((TTCS))

  • 1562 Accesses

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 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.

20.8 Bibliographical Notes

20.8.1 Theory of Computation

  1. J. McCarthy: Recursive Functions of Symbolic Expressions and Their Computation by Machines, Part I. Communications of the ACM 3,4 (1960) pp 184–195

    Article  MATH  MathSciNet  Google Scholar 

  2. J. McCarthy: Towards a Mathematical Science of Computation. In: IFIP World Congress Proceedings, ed by C. Popplewell (1962) pp 21–28

    Google Scholar 

  3. J. McCarthy: A Basis for a Mathematical Theory of Computation. In: Computer Programming and Formal Systems (North-Holland, Amsterdam, 1963)

    Google Scholar 

  4. J. McCarthy: A Formal Description of a Subset of ALGOL. In: [483] (1966)

    Google Scholar 

20.8.2 A Type Theory for the λ-Calculus

  1. D. Scott: Mathematical Concepts in Programming Language Semantics. In: Proc. AFIPS, Spring Joint Computer Conference, 40 (1972) pp 225–234

    Google Scholar 

  2. D. Scott, C. Strachey: Towards a Mathematical Semantics for Computer Languages. In: Computers and Automata, vol 21 of Microwave Research Inst. Symposia (1971) pp 19–46

    Google Scholar 

20.8.3 Source Program Transformation Works

  1. F.L. Bauer, M. Broy, editors. Program Construction, International Summer School, July 26–August 6, 1978, Marktoberdorf, Germany, volume 69 of Lecture Notes in Computer Science. Springer, 1979.

    Google Scholar 

  2. R.M. Burstall, J. Darlington: A Transformation System for Developing Recursive Programs. Journal of ACM 24,1 (1977) pp 44–67

    Article  MATH  MathSciNet  Google Scholar 

  3. J. Darlington: A Synthesis of Several Sorting Algorithms. Acta Informatica 11 (1978) pp 1–30

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Darlington, R.M. Burstall: A System Which Automatically Improves Programs. Acta Informatica 6 (1976) pp 41–60

    Article  MATH  Google Scholar 

20.8.4 Laws of Imperative Programming

  1. C.A.R. Hoare, et al.: Laws of Programming. Communications of the ACM 30,8 (1987) pp 672–686, 770

    Article  MATH  MathSciNet  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2006). Imperative Specification Programming. In: Software Engineering 1. Texts in Theoretical Computer Science an EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31288-9_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-31288-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21149-5

  • Online ISBN: 978-3-540-31288-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics