How to declare an imperative

ACM Computing Surveys

Volumn 29, Issue 3, 1997, Pages 240-263

  Wadler, Philip ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

D.3.3 Programming Languages : Language Constructs and Features input output; F.4.1 Mathematical Logic and Formal Languages : Mathematical Languages lambda calculus and related systems; Functional programming; Haskell; Languages; Monad; Theory

Indexed keywords

COMPUTER PROGRAMMING; FORMAL LANGUAGES; FORMAL LOGIC;

ESCHER PROGRAMMING LANGUAGE; FUNCTIONAL PROGRAMMING; HASKELL PROGRAMMING LANGUAGE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031232913     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/262009.262011     Document Type: Article

References (67)

1. ABRAMSKY, S. 1993. Computational interpretations of linear logic. Theor. Comput. Sci. 111, 3-57.
2. ACHTEN, P. AND PLASMEIJER, R. 1995. The ins and outs of Clean I/O. J. Funct. Program. 5, 1 (Jan.), 81-110.
3. BARENDSEN, E. AND SMETSERS, S. 1993. Conventional and uniqueness typing in graph rewrite systems (extended abstract). In Proceedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science (Bombay, India).
4. BARR, M. AND WELLS, C. 1985. Toposes, Triples, and Theories. Springer-Verlag.
5. BIRD, R. AND WADLER, P. 1987. Introduction to Functional Programming. Prentice Hall, Englewood Cliffs, NJ.
6. CHURCH, A. 1940. A formulation of the simple theory of types. J. Symbol. Logic 5, 56-68.
7. CUPITT, J. 1989. A brief walk through KAOS. Tech. Rep. 52, Computing Laboratory, University of Kent at Canterbury.
8. CHEN, C.-P. AND HUDAK, P. 1997. Rolling your own mutable ADT - a connection between linear types and monads. In 24th Symposium on Principles of Programming Languages (Paris, France, Jan.), ACM, New York.
9. DENNETT, D. 1991. Consciousness Explained. Little, Brown & Co., Boston, MA.
10. FILINSKI, A. 1994. Representing monads. In 21st Symposium on Principles of Programming Languages (Portland, OR, Jan.), ACM, New York.
11. FOKKER, J. 1995. Functional parsers. In Advanced Functional Programming, J. Jeuring and E. Meijer, Eds., LNCS 925, Springer-Verlag.
12. GIRARD, J.-Y. 1987. Linear logic. Theor. Comput. Sci. 50, 1-102.
13. GOGUEN, J. 1990. Higher-order functions considered unnecessary for higher-order programming. In Research Topics in Functional Programming, D. Turner, Ed., Addison-Wesley, Reading, MA.
14. GORDON, A. 1993. Functional Programming and Input/Output. Distinguished Dissertations in Computer Science, Cambridge University Press, New York.
15. GUZMAN, J. AND HUDAK, P. 1990. Single-threaded polymorphic lambda calculus. In Fifth IEEE Symposium on Logic in Computer Science, (Philadelphia, PA, June).
16. HALL, C., HAMMOND, K., PARTAIN, W., PEYTON JONES, S. L., AND WADLER, P. 1992. The Glasgow Haskell compiler: A retrospective. In Proceedings of the 1992 Glasgow Workshop on Functional Programming (Ayr, Scotland, July), Springer Verlag Workshops in Computing Series, 134-143.
17. HATCLIFF, J. AND DANVY, O. 1994. A generic account of continuation-passing styles. In 21st Symposium on Principles of Programming Languages (Portland, OR, Jan.), ACM, New York.
18. HOLMSTRÖM, S. 1988. A linear functional language. In Proceedings of the Workshop on Implementation of Lazy Functional Languages, Programming Methodology Group Rep. 53 (Chalmers University of Technology, Sept.).
19. HOWARD, W. A. 1980. The formulae-as-types notion of construction. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, J. P. Seldin and J. R. Hindley, Eds., Academic Press. (The original version was circulated privately in 1969.)
20. HUDAK, P. AND SUNDARESH, R. S. 1989. On the expressiveness of purely functional I/O systems. Tech. Rep. YALEU/DCS/RR-665, Yale University Dept of Computer Science, March.
21. HUDAK, P., PEYTON JONES, S., AND WADLER, P. Eds. 1992. Report on the programming language Haskell, a non-strict purely-functional programming language, Version 1.2. Sigplan Not. 27, 5 (May).
22. HUGHES, J. 1995. The design of a pretty-printing library. In Advanced Functional Programming, J. Jeuring and E. Meijer, Eds., LNCS 925, Springer-Verlag.
23. JONES, M. P. 1993. A system of constructor classes: Overloading and implicit higher-order polymorphism. In Conference on Functional Programming Languages and Computer Architecture (Copenhagen, June), ACM, New York.
24. JONES, M. P. 1994. Gofer 2.30 implementation. Available by ftp from ftp.cs.nott.ac.uk/nott-fp/ languages/gofer.
25. JONES, M. P. 1995. Functional programming with overloading and higher-order polymorphism. In Advanced Functional Programming, J. Jeuring and E. Meijer, Eds., LNCS 925, Springer-Verlag.
26. JONES, M. P. AND DUPONCHEEL, L. 1993. Composing monads. Res. Rep. YALE/DCS/RR-1004, Yale University, New Haven, Dec.
27. JONES, S. B. 1995. Experiences with Clean I/O, Proceedings of the Glasgow Workshop on Functional Programming (Ullapool, Scotland, July), Electronic Workshops in Computing, Springer-Verlag.
28. KING, D. AND LAUNCHBURY, J. 1995. Structuring depth-first search algorithms in Haskell. In 22nd Symposium on Principles of Programming Languages (San Francisco, CA, Jan.), ACM, New York.
29. KING, D. AND WADLER, P. 1992. Combining monads. In Glasgow Workshop on Functional Programming (Ayr, Scotland, July), Workshops in Computing Series, Springer-Verlag.
30. LAFONT, Y. 1988. The linear abstract machine. Theor. Comput. Sci. 59, 157-180.
31. LANDIN, P. J. 1965. A correspondence between ALGOL 60 and Church's lambda notation: Parts I and II. Commun. ACM 8, 2,3 (Feb./March), 89-101, 158-165.
32. LAUNCHBURY, J. 1993. Lazy imperative programming. In Workshop on State in Programming Languages (Copenhagen, Denmark, June), ACM, New York.
33. LAUNCHBURY, J. 1995. Graph algorithms with a functional flavour. In Advanced Functional Programming, J. Jeuring and E. Meijer, Eds., LNCS 925, Springer-Verlag.
34. LAUNCHBURY, J. AND PEYTON JONES, S. L. 1994. Lazy functional state threads. In Conference on Programming Language Design and Implementation (Orlando, FL), ACM, New York.
35. LAUNCHBURY, J. AND SABRY, A. 1997. Monadic state: Axiomatization and type safety (ICFP 1997) In Second International Conference on Functional Programming (Amsterdam, The Netherlands, July), ACM, New York.
36. LIANG, S., HUDAK, P., AND JONES, M. P. 1995. Monad transformers and modular interpreters. In 22nd Symposium on Principles of Programming Languages, (San Francisco, CA, Jan.), ACM, New York.
37. LLOYD, J. W. 1995. Declarative programming in Escher. Tech. Rep. CSTR-95-013, Department of Computer Science, University of Bristol, June.
38. MACLANE, S. 1971. Categories for the Working Mathematician. Springer-Verlag.
39. MEIJER, E. AND JEURING, J. 1995. Merging monads and folds for functional programming. In Advanced Functional Programming, J. Jeuring and E. Meijer, Eds., LNCS 925, Springer-Verlag.
40. MILNER, R., TOFTE, M., AND HARPER, R. 1990. The Definition of Standard ML. MIT Press, Cambridge, MA.
41. MILNER, R., TOFTE, M., HARPER, R., AND MAC-QUEEN, D. 1997. The Definition of Standard ML (Revised). MIT Press, Cambridge, MA.
42. MOGGI, E. 1989. Computational lambda-calculus and monads. In Symposium on Logic in Computer Science, (Asilomar, CA, June), IEEE.
43. MOGGI, E. 1991. Notions of computation and monads. Inf. Comput. 93, 1.
44. ODERSKY, M., RABIN, D., AND HUDAK, P. 1993. Call-by-name, assignment, and the lambda calculus. In 20th Symposium on Principles of Programming Languages (Charleston, SC, Jan.), ACM, New York.
45. PAULSON, L. C. 1991. ML for the Working Programmer. Cambridge University Press, New York.
46. PERRY, N. 1989. I/O and inter-language calling for functional languages. In Proceedings of Ninth International Conference of the Chilean Computer Society and 15th Latin American Conference on Informatics (Chile). Also available at ftp://smis-asterix/pub/ResearchPapers/ FL_IO_IL_Chile_Jul89.ps.Z.
47. PETERSON, J. AND HAMMOND, K., Eds. 1996. Report on the programming language Haskell, a non-strict purely-functional programming language, Version 1.3. Tech. Rep., Yale University, May.
48. PEYTON JONES, S. L. AND FINNE, S. 1995. Composing Haggis. Manuscript.
49. PEYTON JONES, S. L. AND WADLER, P. 1993. Imperative functional programming. In 20th Symposium on Principles of Programming Languages, (Charleston, SC, Jan.), ACM, New York.
50. PEYTON JONES, S. L., GORDON, A., AND FINNE, S. 1996. Concurrent Haskell. In 23rd Symposium on Principles of Programming Languages (St. Petersburg, FL, Jan.), ACM, New York.
51. PLOTKIN, G. 1975. Call-by-name, call-by-value, and the λ-calculus. Theor. Comput. Sci. 1, 125-159.
52. REYNOLDS, J. C. 1993. The discoveries of continuations. Lisp Symbol. Comput. 6, 3/4, 233-247.
53. SABRY, A. AND WADLER, P. 1996. A reflection on call-by-value. In First International Conference on Functional Programming (Philadelphia, PA, May), ACM, New York.
54. SCHMIDT, D. A. 1985. Detecting global variables in denotational specifications. ACM Trans. Program. Lang. Syst. 7, 299-310.
55. SPIVEY, M. 1990. A functional theory of exceptions. Sci. Comput. Program. 14, 1 (June), 25-42.
56. STEELE, G. L., JR. 1994. Building interpreters by composing monads. In 21st Symposium on Principles of Programming Languages (Portland, OR, Jan.), ACM, New York.
57. STOYE, W. 1986. Message-based functional operating systems. Sci. Comput. Program. 6, 3, 291-311.
58. WADLER, P. 1985. How to replace failure by a list of successes. In Conference on Functional Programming Languages and Computer Architecture (Nancy, France, Sept.), LNCS 201, Springer-Verlag.
59. WADLER, P. 1990a. Comprehending monads. In Conference on Lisp and Functional Programming (Nice, France, June), ACM, New York.
60. WADLER, P. 1990b. Linear types can change the world! In Programming Concepts and Methods (Sea of Galilee, Israel, April), M. Broy and C. Jones, Eds., North Holland.
61. WADLER, P. 1992. The essence of functional programming (invited talk). In 19th Symposium on Principles of Programming Languages (Albuquerque, NM, Jan.), ACM, New York.
62. WADLER, P. 1993a. Monads for functional programming. In Program Design Calculi, M. Broy, Ed., NATO ASI Series, Springer-Verlag, 1993. Also in Advanced Functional Programming, J. Jeuring and E. Meijer, Eds., LNCS 925, Springer-Verlag, 1995.
63. WADLER, P. 1993a. Monads for functional programming. In Program Design Calculi, M. Broy, Ed., NATO ASI Series, Springer-Verlag, 1993. Also in Advanced Functional Programming, J. Jeuring and E. Meijer, Eds., LNCS 925, Springer-Verlag, 1995.
64. WADLER, P. 1993b. A taste of linear logic. (Invited talk). Mathematical Foundations of Computing Science (Gdansk, Poland, Aug.), LNCS 711, Springer-Verlag.
65. WADLER, P. 1994. Monads and composable continuations. Lisp Symbol. Comput. 7, 1 (Jan.), 39-55.
66. WADLER, P. 1995. How to declare an imperative. In International Logic Programming Symposium, (Dec.), John Lloyd, Ed., MIT Press, Cambridge, MA.
67. WARREN, D. H. D. 1981. Higher-order extensions to Prolog - are they needed? In Machine Intelligence 10, D, Michie, et al., Eds., Ellis Horwood, Chichester, UK.