Journal of Logic, Language and Information

, Volume 16, Issue 2, pp 221–232 | Cite as

Book Review

Book Review
  • 38 Downloads

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Augusteijn L. (1998). Sorting morphisms. In: Swierstra S., Henriques P., Oliveira J. (eds). 3rd International summer school on advanced functional programming. Vol. 1608 of LNCS, Springer-Verlag, Berlin, pp. 1–27Google Scholar
  2. Barwise, J., & Etchemendy, J. (1999). Language, proof, and logic. Stanford, CA, USA: Center for the Study of Language and Information.Google Scholar
  3. Barwise, J., & Moss, L. (1996) Vicious circles: on the mathematics of non-wellfounded phenomena. Stanford, CA, USA: Center for the Study of Language and Information.Google Scholar
  4. Claessen, K., & Hughes, J. (2000). QuickCheck: a lightweight tool for random testing of Haskell programs. In: Proceedings of the ACM sigplan international conference on functional programming (ICFP-00), Vol. 35.9 of ACM sigplan notices, pp. 268–279. NY: ACM Press.Google Scholar
  5. Hall C., O’Donnell J. (2006) Discrete mathematics using a computer, 2nd edn. Springer-Verlag, Berlin, to appearGoogle Scholar
  6. Hudak P. The Haskell school of expression: learning functional programming through multimedia. Cambridge University Press, CambridgeGoogle Scholar
  7. Kiselyov, O., Lämmel, R., & Schupke, K. (2004). Strongly typed heterogeneous collections. In: Haskell ’04: proceedings of the ACM SIGPLAN workshop on Haskell, pp. 96–107. New York: ACM Press.Google Scholar
  8. Leijen, D., & Meijer, E. (1999) Domain specific embedded compilers. In: Proceedings of the 2nd conference on domain-Specific languages, pp. 109–122. New York: ACM Press.Google Scholar
  9. Meijer, E., Fokkinga, M., & Paterson, R. (1991). Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. In: FPCA91: Functional programming languages and computer architecture, Vol. 523 of LNCS, pp. 124–144. Berlin: Springer-Verlag.Google Scholar
  10. Okasaki, C. (1996) Purely functional data structures. PhD thesis, Carnegie Mellon University.Google Scholar
  11. Okasaki C. (2001). An overview of edison. In: Hutton G. (eds). Electronic notes in theoretical computer science, Vol. 41. Elsevier, AmsterdamGoogle Scholar
  12. Thompson S. (1991). Type theory and functional programming. International computer science series Addison Wesley, Reading, MAGoogle Scholar
  13. Thompson S. (1999) The craft of functional programming. 2nd edn. Addison Wesley, Reading, MAGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2006

Authors and Affiliations

  1. 1.Microsoft CorporationRedmondUSA

Personalised recommendations