Abstract
This volume is an up-to-date introduction to developments in the calculational construction of computer programs, with particular emphasis on the use of algebraic and coalgebraic datatypes. By including introductory chapters on the relevant mathematical foundations alongside more advanced chapters describing applications, the contents are designed to be accessible to a broad spectrum of readers — from computer practitioners with little or no knowledge of the area seeking a basic introduction, to researchers with an active interest wishing to broaden and deepen their understanding.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Backus. The Syntax and Semantics of the Proposed International Algebraic Language of the Zurich ACM-GAMM Conference. In International Conference on Information Processing, pages 125–132, June 1959. 4
M. Barr and C. Wells. Category Theory for Computing Science. International Series in Computer Science. Prentice Hall, 1990. 2
R. L. Crole. Categories for Types. Cambridge Mathematical Textbooks. Cambridge University Press, 1993. xvii+335 pages, ISBN 0521450926HB, 0521457017PB. 2
P. J. Freyd and A. Scedrov. Categories, Allegories. Elsevier Science Publishers, 1990. Appears as Volume 39 of the North-Holland Mathematical Library. 2
R. Goldblatt. Topoi: the categorial analysis of logic. Amsterdam; Oxford: North-Holland, 1984. ISBN: 0444867112. 10, 11
David Gries and Fred B. Schneider. A Logical Approach to Discrete Math. Springer-Verlag, 1993. 2
S. Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer Verlag, 1971. 2
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980. 7
P. Naur. Revised Report on the Algorithmic Language Algol 60. Communications of the ACM, 6(1):1–17, 1963. 4
B. C. Pierce. Basic Category Theory for Computer Scientists. Foundations of Computing Series. The MIT Press, 1991. 2
D. S. Scott. The lattice of flow diagrams. Technical Report 3, Programming Research Group, Oxford University Computing Laboratory, 1970. 5, 14
D. S. Scott. Towards a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, 1970. 5
D. S. Scott. Continuous lattices. Technical Report 7, Programming Research Group, Oxford University Computing Laboratory, 1971. 5, 14
D. S. Scott. Datatypes as lattices. SIAM Journal of Computing, 5(3):522–587, 1976. 5, 14
D. S. Scott. Domains for denotational semantics. In ICALP 1982, volume 140 of Lecture Notes in Computer Science, pages 577–613. Springer-Verlag, 1982. 5
M. L. Scott. Programming Language Pragmatics. Morgan Kaufmann, 2000. 2
R. Sethi. Programming Languages: Concepts and Constructs. Addison-Wesley, 1989. 2
D. S. Scott and C. Strachey. Towards a mathematical semantics for computer languages. Technical Report 6, Programming Research Group, Oxford University Computing Laboratory, 1971. 5
G. Winskel and K. G. Larsen. Using information systems to solve recursive domain equations effectively. Technical Report 51, University of Cambridge Computer Laboratory, 1983. 14
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Crole, R. (2002). Introduction. In: Backhouse, R., Crole, R., Gibbons, J. (eds) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Lecture Notes in Computer Science, vol 2297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47797-7_1
Download citation
DOI: https://doi.org/10.1007/3-540-47797-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43613-3
Online ISBN: 978-3-540-47797-6
eBook Packages: Springer Book Archive