Imperative functional programming

ABSTRACT

We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language working and in-place array updates.

REFERENCES

• 1: S Abramsky{1990}, "Computational interpretations of linear logic," DOC 90/20, Dept of Computing, Imperial College.
• 2: Peter Achten , John H. G. van Groningen , Rinus Plasmeijer, High Level Specification of I/O in Functional Languages, Proceedings of the 1992 Glasgow Workshop on Functional Programming, p.1-17, July 06-08, 1992
• 3: Adrienne Bloss, Update analysis and the efficient implementation of functional aggregates, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.26-38, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99373]
• 4: Andrew Dwelly, Functions and dynamic user interfaces, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.371-381, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99407]
• 5: David K. Gifford , John M. Lucassen, Integrating functional and imperative programming, Proceedings of the 1986 ACM conference on LISP and functional programming, p.28-38, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319848]
• 6: Jean-Yves Girard, Linear logic, Theoretical Computer Science, v.50 n.1, p.1-102, Jan. 30, 1987 [doi>10.1016/0304-3975(87)90045-4]
• 7: A Gordon{Feb 1989}, "PFL+: a kernel scheme for functional I/O," TR 160, Computer Lab, University of Cambridge.
• 8: JC Guzman & P Hudak{1990}, "Single-threaded polymorphic lambda calculus," in Proc 5th Annual IEEE Symposium on Logic in Computer Science.
• 9: K Hammond, PL Wadler & D Brady {1991}, "Imperate: be imperative," Department of Computer Science, Univ of Glasgow.
• 10: P Hudak{July 1992}, "Continuation-based mutable abstract datatypes, or how to have your state and munge it too," YALEU/DCS/RR-914, Department of Computer Science, Yale University.
• 11: P Hudak, SL Peyton Jones, PL Wadler, Arvind, B Boutel, J Fairbairn, J Fasel, lVt Guzman, K ttammond, J Hughes, T Johnsson, R. Kieburtz, RS Nikhil, W Partain &: J Paterson {May 1992}, "Report on the functional programming language Haskell, Version 1.2," SIGPLAN Notices 27.
• 12: P Hudak & RS Sundaresh{March 1989}, "On the expressiveness of purely-functional I/O systems." YALEU/DCS/RR-665, Department of Computer Science, Yale University.
• 13: Paul Hudak, A semantic model of reference counting and its abstraction (detailed summary), Proceedings of the 1986 ACM conference on LISP and functional programming, p.351-363, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319876]
• 14: E Ireland{March 1989}, "Writing interactive and fileprocessing functional programs," MSc thesis, Victoria University of Wellington.
• 15: Pierre Jouvelot , David Gifford, Algebraic reconstruction of types and effects, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.303-310, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99623]
• 16: Kent Karlsson{1982}, "Nebula- a functional operating system," Chalmers Inst, Goteborg.
• 17: B. W. Kernighan , D. M. Ritchie, The C programming language, Prentice-Hall, Inc., Upper Saddle River, NJ, 1978
• 18: E. Moggi, Computational lambda-calculus and monads, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.14-23, June 1989, Pacific Grove, California, United States
• 19: John T. O'Donnell, Dialogues: A basis for constructing programming environments, Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments, p.19-27, June 25-28, 1985, Seattle, Washington, United States
• 20: N Perry {1991}, "The implementation of prac.~ical fun,> tional programming languages," PhD thesis, Inlperial College, London.
• 21: SL Peyton Jones{1992}, "Implementing lazy functional languages on stock hardware: the SpirMess Tagless G-machine," JournM of Functionaj Progranlruing (to appear).
• 22: SL Peyton Jones {Oct 1988}, "Converting streams to continuations and vice versa," Electronic mail on Haskell mailing list.
• 23: Simon L. Peyton Jones , John Launchbury, Unboxed Values as First Class Citizens in a Non-Strict Functional Language, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, p.636-666, August 26-30, 1991
• 24: J Reynolds {1981}, "The essence of Algol," in Algorithmic Languages, de Bakker & van Vliet, ads., North Holland, 345-372.
• 25: John C. Reynolds, Syntactic Control of Inference, Part 2, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, p.704-722, July 11-15, 1989
• 26: David A. Schmidt, Detecting global variables in denotational specifications, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.2, p.299-310, April 1985 [doi>10.1145/3318.3323]
• 27: Vipin Swarup , Uday S. Reddy , Evan Ireland, Assignments for applicative languages, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.192-214, June 1991, Cambridge, Massachusetts, United States
• 28: SJ Thompson {1989}, "Interactive funciional programs- a method and a formal semantics," in Declaratiw~. Programming, DA Turner, ed., Addison Wesley.
• 29: Mads Tofte, Type inference for polymorphic references, Information and Computation, v.89 n.1, p.1-34, Nov. 1990 [doi>10.1016/0890-5401(90)90018-D]
• 30: PL Wadler {1990}, "Linear types can change the world!," in Programming concepts and methods, M Bro3" & C Jones, ads., North Holland.
• 31: Philip Wadler, The essence of functional programming, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-14, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143169]
• 32: Philip Wadler, Comprehending monads, Proceedings of the 1990 ACM conference on LISP and functional programming, p.61-78, June 27-29, 1990, Nice, France [doi>10.1145/91556.91592]
• 33: D Wakeling{Nov 1990}, "Linearity alld laziness," Phi) thesis, Department of Computer Scie~me, University of York.

INDEX TERMS

Primary Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: C; Haskell
      D.3.3 Language Constructs and Features
          Subjects: Procedures, functions, and subroutines

  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.3 Studies of Program Constructs
          Subjects: Control primitives

General Terms:
Algorithms, Languages