skip to main content
article

Functional programming, and where you can put it

Published:01 September 2001Publication History
First page image

References

  1. John Backus, Can programming be liberated from the von Neumann style? A functional style and its algebra of programs, Communications of the ACM, 21(8): 613--641, August 1978 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ian Barland, Matthias Felleisen, Phokion Kolaitis, and Moshe Vardi, TeachLogic Project, http://www.cs.rice.edu/ian/TeachLogicGoogle ScholarGoogle Scholar
  3. R. S. Boyer and J. S. Moore, A Computational Logic Handbook, Academic Press, 1988 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. K Broda, S Eisenbach, H Khoshnevisan, and S Vickers, Reasoned Programming, Prentice Hall, 1994 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Magnus Carlsson and Thomas Hallgren, Fudgets A Graphical User Interface in a Lazy Functional Language, Proc. Conference on Functional Programming Languages and Computer Architecture, 321--330, ACM Press, 1993 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R. H. Cobb and H. D. Mills, Engineering software under statistical control, IEEE Software, 7(11): 45--54, November 1990 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Computer Science Accreditation Commission, Criteria for Accrediting Programs in Computer Science in the United States, Version 1.0. Computer Science Accreditation Board, January 2000Google ScholarGoogle Scholar
  8. C Dean and M Hinchey, editors, Teaching and Learning Formal Methods, Academic Press, 1996Google ScholarGoogle Scholar
  9. E. W. Dijkstra, EWD227 stepwise program construction, 1968. In: Selected Writings on Computing: a Personal Perspective, E. W. Dijkstra, editor, 1--14, Springer-Verlag, 1982Google ScholarGoogle Scholar
  10. Conan Elliott and Paul Hudak, Functional Reactive Animation, Proc. 1997 ACM SIGLPLAN International Conference on Functional Programming, ACM, 1997 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. W. W. Gibbs, Software's chronic crisis, Scientific American, 86--95, September 1994Google ScholarGoogle Scholar
  12. M Gordon and T Melham, Introduction to HOL --- A Theorem Proving Environment for Higher Order Logic, 86--95, Cambridge University Press, 1993 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M Gordon, R Milner, R Wadsworth, and P Christopher, Edinburgh LCF: A Mechanical Logic of Computation, Lecture Notes in Computer Science 78. Springer-Vedag, 1979Google ScholarGoogle Scholar
  14. David Gries and Fred Schneider, A Logical Approach to Discrete Math, Springer-Verlag, 1993 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Cordelia Hail and John O'Donnell, Discrete Mathematics with a Computer, Springer, 2000Google ScholarGoogle Scholar
  16. D Hardin, M Wilding, and D Greve, Transforming the theorem prover into a digital design tool: from concept car to off-road vehicle, Computer-Aided Verification, CAV '98, Lecture Notes in Computer Science 1427, Alan J Hu and Moshe Y Vardi, editors, 39--44, Springer-Verlag, 1988 Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C Heitmeyer, R Jeffords, and B Labaw, Automated consistency checking of requirements specifications, ACM Transactions on Software Engineering and Methodology, 5(3):231--261, 1996 Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C. A. R. Hoare, An axiomatic basis for computer programming, Communications of the ACM, 12(10):576--583, 1969 (reprinted in Communications of the ACM, 26(1):53--56, 1983) Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. D Leijen and E Meijer, Domain-Specific Embedded Compilers, 2nd Conference on Domain-Specific Languages, Usenix, 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. John McCarthy Towards a mathematical science of computation, Proc. of IFIP Congress 62, 21--28, North-Holland, 1963Google ScholarGoogle Scholar
  21. S Owre, J Rushby, and N Shankar, PVS: A Prototype Verification System, 11th International Conference on Automated Deduction (CADE), Lecture Notes in Artificial Intelligence 607, 748--752, Deepak Kapur, editor, Springer-Verlag, 1992 Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. L. C. Paulson, Isabelle: A Generic Theorem Prover, Lecture Notes on Computer Science 828, Springer-Verlag, 1994Google ScholarGoogle Scholar
  23. Simon Peyton Jones and John Hughes, editors, Standard Libraries for Haskell 98, http://haskell.cs.yale.edu/onlinelibrary/, February 1999Google ScholarGoogle Scholar
  24. Niklas Rojemo and Colin Runciman, Lag, drag, void and use --- heap profiling and space-efficient compilation revisited, Proc. ICFP'96, ACM SIGPLAN Notices, 31 (6):34--41, June 1996 Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. R. W. Selby, V. R. Basili, and F. T. Baker, Cleanroom software development: an empirical evaluation, IEEE Transactions on Software Engineering, SE-13(9):1027--1037, September 1987 Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Philip Wadler, How to declare and imperative. ACM Computing Surveys, 29(3):240--263, September 1997 Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Philip Wadler, An angry half-dozen, ACM SIGPLAN Notices, 33(2):25--30, February 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Philip Wadler, Why no one uses functional languages, ACM SIGPLAN Notices, 33(8):23--27, August 1998 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Functional programming, and where you can put it

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGPLAN Notices
        ACM SIGPLAN Notices  Volume 36, Issue 9
        September 2001
        73 pages
        ISSN:0362-1340
        EISSN:1558-1160
        DOI:10.1145/609769
        Issue’s Table of Contents

        Copyright © 2001 Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 September 2001

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader