A history of Haskell: being lazy with class

ABSTRACT

This paper describes the history of Haskell, including its genesis and principles, technical contributions, implementations and tools, and applications and impact.

REFERENCES

• 1: Peter Achten , Simon L. Peyton Jones, Porting the Clean Object I/O Library to Haskell, Selected Papers from the 12th International Workshop on Implementation of Functional Languages, p.194-213, September 04-07, 2000
• 2: Achten, P. and Plasmeijer, R. (1995). The ins and outs of clean I/O. Journal of Functional Programming, 5(1):81--110.
• 3: 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
• 4: Krasimir Angelov , Simon Marlow, Visual haskell: a full-featured haskell development environment, Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, p.5-16, September 30-30, 2005, Tallinn, Estonia [doi>10.1145/1088348.1088350]
• 5: Andrew W. Appel , David B. MacQueen, A standard ML compiler, Proc. of a conference on Functional programming languages and computer architecture, p.301-324, October 1987, Portland, Oregon, United States
• 6: Thomas Arts , John Hughes , Joakim Johansson , Ulf Wiger, Testing telecoms software with quviq QuickCheck, Proceedings of the 2006 ACM SIGPLAN workshop on Erlang, September 16-16, 2006, Portland, Oregon, USA [doi>10.1145/1159789.1159792]
• 7: Arvind , R S Nikhil, Executing a program on the MIT tagged-token dataflow architecture, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.1-29, March 1987, Eindhoven, The Netherlands
• 8: David L. Atkins , Thomas Ball , Glenn Bruns , Kenneth Cox, Mawl: A Domain-Specific Language for Form-Based Services, IEEE Transactions on Software Engineering, v.25 n.3, p.334-346, May 1999 [doi>10.1109/32.798323 ]
• 9: Lennart Augustsson, A compiler for lazy ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.218-227, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802038]
• 10: Lennart Augustsson, Cayenne—a language with dependent types, Proceedings of the third ACM SIGPLAN international conference on Functional programming, p.239-250, September 26-29, 1998, Baltimore, Maryland, United States
• 11: Arthur I. Baars , Andres Löh , S. Doaitse Swierstra, Parsing permutation phrases, Journal of Functional Programming, v.14 n.6, p.635-646, November 2004 [doi>10.1017/S0956796804005143]
• 12: Arthur I. Baars , S. Doaitse Swierstra, Typing dynamic typing, Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, p.157-166, October 04-06, 2002, Pittsburgh, PA, USA
• 13: John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
• 14: John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
• 15: Barendsen, E. and Smetsers, S. (1996). Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science, 6:579--612.
• 16: Barron, D., Buxton, J., Hartley, D., Nixon, E., and Strachey, C. (1963). The main features of cpl. The Computer Journal, 6(2): 134--143.
• 17: Paul S. Barth , Rishiyur S. Nikhil , Arvind, M-Structures: Extending a Parallel, Non-strict, Functional Language with State, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, p.538-568, August 26-30, 1991
• 18: Barton, D. (1995). Advanced modeling features of MHDL. In Proceedings of International Conference on Electronic Hardware Description Languages.
• 19: Richard S. Bird , Ross Paterson, de Bruijn notation as a nested datatype, Journal of Functional Programming, v.9 n.1, p.77-91, January 1999 [doi>10.1017/S0956796899003366]
• 20: Richard Bird , Philip Wadler, An introduction to functional programming, Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1988
• 21: Per Bjesse , Koen Claessen , Mary Sheeran , Satnam Singh, Lava: hardware design in Haskell, Proceedings of the third ACM SIGPLAN international conference on Functional programming, p.174-184, September 26-29, 1998, Baltimore, Maryland, United States
• 22: Bloss, A. (1988). Path Analysis: Using Order-of-Evaluation Information to Optimize Lazy Functional Languages. PhD thesis, Yale University, Department of Computer Science.
• 23: Bloss, A., Hudak, P., and Young, J. (1988a). Code optimizations for lazy evaluation. Lisp and Symbolic Computation: An International Journal, 1(2): 147--164.
• 24: Adrienne Bloss , P. Hudak , J. Young, An optimising compiler for a modern functional language, The Computer Journal, v.32 n.2, p.152-161, April 1989 [doi>10.1093/comjnl/32.2.152]
• 25: Blott, S. (1991). Type Classes. PhD thesis, Department of Computing Science, Glasgow University.
• 26: Robert D. Blumofe , Christopher F. Joerg , Bradley C. Kuszmaul , Charles E. Leiserson , Keith H. Randall , Yuli Zhou, Cilk: an efficient multithreaded runtime system, Journal of Parallel and Distributed Computing, v.37 n.1, p.55-69, Aug. 25, 1996 [doi>10.1006/jpdc.1996.0107 ]
• 27: Boquist, U. (1999). Code Optimisation Techniques for Lazy Functional Languages. PhD thesis, Chalmers University of Technology, Sweden.
• 28: Gilad Bracha , Martin Odersky , David Stoutamire , Philip Wadler, Making the future safe for the past: adding genericity to the Java programming language, Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, p.183-200, October 18-22, 1998, Vancouver, British Columbia, Canada
• 29: T. H. Brus , C. J. D. van Eekelen , M. O. van Leer , M. J. Plasmeijer, CLEAN: A language for functional graph rewriting, Proc. of a conference on Functional programming languages and computer architecture, p.364-384, October 1987, Portland, Oregon, United States
• 30: Burge, W. (1975). Recursive Programming Techniques. Addison Wesley.
• 31: Burstall, R. (1969). Proving properties of programs by structural induction. The Computer Journal, pages 41--48.
• 32: Burstall, R. (1977). Design considerations for a functional programming language. In The Software Revolution. Infotech.
• 33: R. M. Burstall , John Darlington, A Transformation System for Developing Recursive Programs, Journal of the ACM (JACM), v.24 n.1, p.44-67, Jan. 1977 [doi>10.1145/321992.321996]
• 34: R. M. Burstall , D. B. MacQueen , D. T. Sannella, HOPE: An experimental applicative language, Proceedings of the 1980 ACM conference on LISP and functional programming, p.136-143, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802799]
• 35: Burton, W., Meijer, E., Sansom, P., Thompson, S., and Wadler, P. (1996). Views: An extension to Haskell pattern matching, http://haskell.org/development/views.html.
• 36: Callaghan, P. (1998). An Evaluation of LOLITA and Related Natural Language Processing Systems. PhD thesis, Department of Computer Science, University of Durham.
• 37: Carlier, S. and Bobbio, J. (2004). hop.
• 38: Carlson, W., Hudak, P., and Jones, M. (1993). An experiment using Haskell to prototype "geometric region servers" for Navy command and control. Research Report 1031, Department of Computer Science, Yale University.
• 39: Magnus Carlsson , Thomas Hallgren, FUDGETS: a graphical user interface in a lazy functional language, Proceedings of the conference on Functional programming languages and computer architecture, p.321-330, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165228]
• 40: Manuel M. T. Chakravarty, C -> HASKELL, or Yet Another Interfacing Tool, Selected Papers from the 11th International Workshop on Implementation of Functional Languages, p.131-148, September 07-10, 1999
• 41: Manuel M. T. Chakravarty, Lazy Lexing is Fast, Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming, p.68-84, November 11-13, 1999
• 42: Chakravarty, M., editor (2002). Proceedings of the 2002 Haskell Workshop, Pittsburgh.
• 43: Manuel M. T. Chakravarty , Gabriele Keller , Simon Peyton Jones, Associated type synonyms, Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, September 26-28, 2005, Tallinn, Estonia
• 44: Manuel M. T. Chakravarty , Gabriele Keller , Simon Peyton Jones , Simon Marlow, Associated types with class, Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-13, January 12-14, 2005, Long Beach, California, USA
• 45: Kung Chen , Paul Hudak , Martin Odersky, Parametric type classes, Proceedings of the 1992 ACM conference on LISP and functional programming, p.170-181, June 22-24, 1992, San Francisco, California, United States
• 46: Cheney, J. and Hinze, R. (2003). First-class phantom types. CUCIS TR2003--1901, Cornell University.
• 47: Cheong, M. H. (2005). Functional Programming and 3D Games. Undergraduate thesis, University of New South Wales.
• 48: Alonzo Church, The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies), Princeton University Press, Princeton, NJ, 1985
• 49: Koen Claessen, Parallel Parsing Processes, Journal of Functional Programming, v.14 n.6, p.741-757, November 2004 [doi>10.1017/S0956796804005192]
• 50: Koen Claessen , John Hughes, QuickCheck: a lightweight tool for random testing of Haskell programs, Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, p.268-279, September 2000
• 51: Claessen, K. and Hughes, J. (2002). Testing monadic code with QuickCheck. In (Chakravarty, 2002).
• 52: Koen Claessen , David Sands, Observable Sharing for Functional Circuit Description, Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science, p.62-73, December 10-12, 1999
• 53: Cooper, G. and Krishnamurthi, S. (2006). Embedding dynamic dataflow in a call-by-value language. In 15th European Symposium on Programming, volume 3924 of LNCS. Springer-Verlag.
• 54: Antony Alexander Courtney , Paul Hudak, Modeling user interfaces in a functional language, Yale University, New Haven, CT, 2004
• 55: Courtney, A. and Elliott, C. (2001). Genuinely functional user interfaces. In Proc. of the 2001 Haskell Workshop, pages 41--69.
• 56: Curry, H. and Feys, R. (1958). Combinatory Logic, Vol. 1. North-Holland, Amsterdam.
• 57: Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
• 58: Nils Anders Danielsson , John Hughes , Patrik Jansson , Jeremy Gibbons, Fast and loose reasoning is morally correct, ACM SIGPLAN Notices, v.41 n.1, p.206-217, January 2006
• 59: J. Darlington , D. Turner , P. Henderson, Functional Programming and Its Applications: An Advanced Course, Cambridge University Press, New York, NY, 1982
• 60: John Darlington , Mike Reeve, ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.65-76, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806764]
• 61: Davis, A. (1977). The architecture of ddm 1: a recursively structured data driven machine. Technical Report UUCS-77-113, University of Utah.
• 62: María J. García de la Banda , Bart Demoen , Kim Marriott , Peter J. Stuckey, To the Gates of HAL: A HAL Tutorial, Proceedings of the 6th International Symposium on Functional and Logic Programming, p.47-66, September 15-17, 2002
• 63: Iavor S. Diatchki , Mark P. Jones , Thomas Hallgren, A formal specification of the Haskell 98 module system, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.17-28, October 03, 2002, Pittsburgh, Pennsylvania [doi>10.1145/581690.581692]
• 64: Dijkstra, E. (1981). Trip report E. W Dijkstra, Newcastle, 19--25 July 1981. Dijkstra working note EWD798.
• 65: Peter Dybjer, Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics, Logical frameworks, Cambridge University Press, New York, NY, 1991
• 66: Dybvig, K., Peyton Jones, S., and Sabry, A. (2005). A monadic framework for delimited continuations. To appear in the Journal of Functional Programming.
• 67: Elliott, C. (1996). A brief introduction to activevrml. Technical Report MSR-TR-96-05, Microsoft Research.
• 68: Conal Elliott, Modeling interactive 3D and multimedia animation with an embedded language, Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997, p.22-22, October 15-17, 1997, Santa Barbara, California
• 69: Conal Elliott , Paul Hudak, Functional reactive animation, Proceedings of the second ACM SIGPLAN international conference on Functional programming, p.263-273, June 09-11, 1997, Amsterdam, The Netherlands
• 70: Conal Elliott , Greg Schechter , Ricky Yeung , Salim Abi-Ezzi, TBAG: a high level framework for interactive, animated 3D graphics applications, Proceedings of the 21st annual conference on Computer graphics and interactive techniques, p.421-434, July 1994 [doi>10.1145/192161.192276]
• 71: Robert Ennals , Simon Peyton Jones, Optimistic evaluation: an adaptive evaluation strategy for non-strict programs, Proceedings of the eighth ACM SIGPLAN international conference on Functional programming, p.287-298, August 25-29, 2003, Uppsala, Sweden
• 72: Arthur Evans, Jr., PAL—a language designed for teaching programming linguistics, Proceedings of the 1968 23rd ACM national conference, p.395-403, August 27-29, 1968 [doi>10.1145/800186.810604]
• 73: Fairbairn, J. (1982). Ponder and its type system. Technical Report TR-31, Cambridge University Computer Lab.
• 74: Fairbairn, J. (1985). Design and implementation of a simple typed language based on the lambda-calculus. Technical Report 75, University of Cambridge Computer Laboratory.
• 75: Karl-Filip Faxén, A static semantics for Haskell, Journal of Functional Programming, v.12 n.5, p.295-357, July 2002 [doi>10.1017/S0956796802004380]
• 76: Field, A., Hunt, L., and While, R. (1992). The semantics and implementation of various best-fit pattern matching schemes for functional languages. Technical Report Doc 92/13, Dept of Computing, Imperial College.
• 77: Sigbjorn Finne , Daan Leijen , Erik Meijer , Simon Peyton Jones, H/Direct: a binary foreign language interface for Haskell, Proceedings of the third ACM SIGPLAN international conference on Functional programming, p.153-162, September 26-29, 1998, Baltimore, Maryland, United States
• 78: Finne, S. and Peyton Jones, S. (1995). Composing Haggis. In Proc 5th Eurographics Workshop on Programming Paradigms in Graphics, Maastricht.
• 79: Bryan Ford, Packrat parsing:: simple, powerful, lazy, linear time, functional pearl, Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, p.36-47, October 04-06, 2002, Pittsburgh, PA, USA
• 80: FPCA93 (1993). ACM Conference on Functional Programming and Computer Architecture (FPCA'93), Cophenhagen. ACM.
• 81: FPCA95 (1995). ACM Conference on Functional Programming and Computer Architecture (FPCA'95), La Jolla, California. ACM.
• 82: Friedman, D. and Wise, D. (1976). CONS should not evaluate its arguments. Automata, Languages, and Programming, pages 257--281.
• 83: Richard A. Frost, Realization of natural language interfaces using lazy functional programming, ACM Computing Surveys (CSUR), v.38 n.4, p.11-es, 2006 [doi>10.1145/1177352.1177353]
• 84: Gaster, B. (1998). Records, Variants, and Qualified Types. PhD thesis, Department of Computer Science, University of Nottingham.
• 85: Gaster, B. R. and Jones, M. P. (1996). A polymorphic type system for extensible records and variants. Technical Report TR-96-3, Department of Computer Science, University of Nottingham.
• 86: Gill, A. (2000). Debugging Haskell by observing intermediate data structures. In Haskell Workshop. ACM SIGPLAN.
• 87: Andrew Gill , John Launchbury , Simon L. Peyton Jones, A short cut to deforestation, Proceedings of the conference on Functional programming languages and computer architecture, p.223-232, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165214]
• 88: Jean-Yves Girard, The system f of variable types, 15 years later, Logical foundations of functional programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 89: Glynn, K., Stuckey, P., and Sulzmann, M. (2000). Type classes and constraint handling rules. In First Workshop on Rule-Based Constraint Reasoning and Programming.
• 90: Gödel, K. (1931). Über formal unentscheidbare sätze der principia mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38:173--198. Pages 596--616 of (van Heijenoort, 1967).
• 91: Gordon, M., Milner, R., and Wadsworth, C. (1979). Edinburgh LCF. Springer Verlag LNCS 78.
• 92: Graham, P. (2004). Beating the averages. In Hackers and Painters. O'Reilly.
• 93: Paul T. Graunke , Shriram Krishnamurthi , Steve Van Der Hoeven , Matthias Felleisen, Programming the Web with High-Level Programming Languages, Proceedings of the 10th European Symposium on Programming Languages and Systems, p.122-136, April 02-06, 2001
• 94: Cordelia V. Hall , John T. O'Donnell, Debugging in a side effect free programming environment, Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments, p.60-68, June 25-28, 1985, Seattle, Washington, United States
• 95: Hallgren, T. (2001). Fun with functional dependencies. In Proc Joint CS/CE Winter Meeting, Chalmers Univerity, Varberg, Sweden.
• 96: Thomas Hallgren , Mark P. Jones , Rebekah Leslie , Andrew Tolmach, A principled approach to operating system construction in Haskell, Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, September 26-28, 2005, Tallinn, Estonia
• 97: Hanus, M., Kuchen, H., and Moreno-Navarro, J. (1995). Curry: A truly functional logic language. In Proceedings of the ILPS '95 Postconference Workshop on Visions for the Future of Logic Programming.
• 98: Tim Harris , Simon Marlow , Simon Peyton-Jones , Maurice Herlihy, Composable memory transactions, Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, June 15-17, 2005, Chicago, IL, USA [doi>10.1145/1065944.1065952]
• 99: William L. Harrison , Samuel N. Kamin, Modular Compilers Based on Monad Transformers, Proceedings of the 1998 International Conference on Computer Languages, p.122, May 14-16, 1998
• 100: Hartel, P., Feeley, M., Alt, M., Augustsson, L., Bauman, P., Weis, P., and Wentworth, P. (1996). Pseudoknot: a float-intensive benchmark for functional compilers. Journal of Functional Programming, 6(4).
• 101: Haskell01 (2001). Proceedings of the 2001 Haskell Workshop, Florence.
• 102: Haskell04 (2004). Proceedings of ACM Workshop on Haskell, Snowbird, Snowbird, Utah. ACM.
• 103: Bastiaan Heeren , Jurriaan Hage , S. Doaitse Swierstra, Scripting the type inference process, Proceedings of the eighth ACM SIGPLAN international conference on Functional programming, p.3-13, August 25-29, 2003, Uppsala, Sweden
• 104: Bastiaan Heeren , Daan Leijen , Arjan van IJzendoorn, Helium, for learning Haskell, Proceedings of the 2003 ACM SIGPLAN workshop on Haskell, p.62-71, August 28-28, 2003, Uppsala, Sweden [doi>10.1145/871895.871902]
• 105: Peter Henderson, Functional geometry, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.179-187, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802148]
• 106: Peter Henderson , James H. Morris, Jr., A lazy evaluator, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.95-103, January 19-21, 1976, Atlanta, Georgia [doi>10.1145/800168.811543]
• 107: Herington, D. (2002). Hunit home page. http://hunit.sourceforge.net.
• 108: Ralf Hinze, A new approach to generic functional programming, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.119-132, January 19-21, 2000, Boston, MA, USA [doi>10.1145/325694.325709]
• 109: Ralf Hinze, Manufacturing datatypes, Journal of Functional Programming, v.11 n.5, p.493-524, September 2001 [doi>10.1017/S095679680100404X]
• 110: Hinze, R. (2003). Fun with phantom types. In Gibbons, J. and de Moor, O., editors, The Fun of Programming, pages 245--262. Palgrave.
• 111: Ralf Hinze, Generics for the masses, Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, September 19-21, 2004, Snow Bird, UT, USA
• 112: Hinze, R., Jeuring, J., and Lh, A. (2006). Comparing approaches to generic programming in Haskell. In Generic Programming, Advanced Lectures, LNCS. Springer-Verlag.
• 113: Hinze, R. and Peyton Jones, S. (2000). Derivable type classes. In Hutton, G., editor, Proceedings of the 2000 Haskell Workshop, Montreal. Nottingham University Department of Computer Science Technical Report NOTTCS-TR-00-1.
• 114: Hudak, P. (1984a). ALFL Reference Manual and Programmer's Guide. Research Report YALEU/DCS/RR-322, Second Edition, Yale University, Dept. of Computer Science.
• 115: Hudak, P. (1984b). Distributed applicative processing systems - project goals, motivation and status report. Research Report YALEU/DCS/RR-317, Yale University, Dept. of Computer Science.
• 116: Paul Hudak, Conception, evolution, and application of functional programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.359-411, Sep. 1989 [doi>10.1145/72551.72554]
• 117: Paul Hudak, Building domain-specific embedded languages, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996 [doi>10.1145/242224.242477]
• 118: Paul Hudak, Haskore Music Tutorial, Advanced Functional Programming, Second International School-Tutorial Text, p.38-67, August 26-30, 1996
• 119: P. Hudak, Modular Domain Specific Languages and Tools, Proceedings of the 5th International Conference on Software Reuse, p.134, June 02-05, 1998
• 120: Paul Hudak, The Haskell school of expression: learning functional programming through multimedia, Cambridge University Press, New York, NY, 2000
• 121: Hudak, P. (2003). Describing and interpreting music in Haskell. In Gibbons, J. and de Moor, O., editors, The Fun of Programming, chapter 4. Palgrave.
• 122: Hudak, P. (2004). Polymorphic temporal media. In Proceedings of PADL'04: 6th International Workshop on Practical Aspects of Declarative Languages. Springer Verlag LNCS.
• 123: Hudak, P., Courtney, A., Nilsson, H., and Peterson, J. (2003). Arrows, robots, and functional reactive programming. In Jeuring, J. and Jones, S. P., editors, Advanced Functional Programming, 4th International School, volume 2638 of Lecture Notes in Computer Science. Springer-Verlag.
• 124: Hudak, P., Makucevich, T., Gadde, S., and Whong, B. (1996). Haskore music notation - an algebra of music. Journal of Functional Programming, 6(3):465--483.
• 125: Hudak, P. and Sundaresh, R. (1989). On the expressiveness of purely-functional I/O systems. Research Report YALEU/DCS/RR-665, Department of Computer Science, Yale University.
• 126: Paul Hudak , Jonathan Young, Higher-order strictness analysis in untyped lambda calculus, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-109, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512653]
• 127: Huet, G. (1975). A unification algorithm for typed lambda-calculus. Theoretical Computer Science, 1:22--58.
• 128: Huet, G. and Levy, J. (1979). Call by need computations in non-ambiguous linear term-rewriting systems. Report 359, INRIA.
• 129: J. Hughes, Why functional programming matters, The Computer Journal, v.32 n.2, p.98-107, April 1989 [doi>10.1093/comjnl/32.2.98]
• 130: John Hughes, The Design of a Pretty-printing Library, Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text, p.53-96, May 24-30, 1995
• 131: John Hughes, Generalising monads to arrows, Science of Computer Programming, v.37 n.1-3, p.67-111, May 2000 [doi>10.1016/S0167-6423(99)00023-4 ]
• 132: Hughes, R. (1983). The Design and Implementation of Programming Languages. Ph.D. thesis, Programming Research Group, Oxford University.
• 133: Graham Hutton , Erik Meijer, Monadic parsing in Haskell, Journal of Functional Programming, v.8 n.4, p.437-444, July 1998 [doi>10.1017/S0956796898003050]
• 134: ICFP00 (2000). ACM SIGPLAN International Conference on Functional Programming (ICFP'00), Montreal. ACM.
• 135: ICFP02 (2002). ACM SIGPLAN International Conference on Functional Programming (ICFP'02), Pittsburgh. ACM.
• 136: ICFP03 (2003). ACM SIGPLAN International Conference on Functional Programming (ICFP'03) Uppsala, Sweden. ACM.
• 137: ICFP97 (1997). ACM SIGPLAN International Conference on Functional Programming (ICFP'97), Amsterdam. ACM.
• 138: ICFP98 (1998). ACM SIGPLAN International Conference on Functional Programming (ICFP'98), volume 34(1) of ACM SIGPLAN Notices, Baltimore. ACM.
• 139: ICFP99 (1999). ACM SIGPLAN International Conference on Functional Programming (ICFP'99), Paris. ACM.
• 140: Patrik Jansson , Johan Jeuring, PolyP—a polytypic programming language extension, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.470-482, January 15-17, 1997, Paris, France [doi>10.1145/263699.263763]
• 141: Patrik Jansson , Johan Jeuring, Polytypic Compact Printing and Parsing, Proceedings of the 8th European Symposium on Programming Languages and Systems, p.273-287, March 22-28, 1999
• 142: Patricia Johann , Janis Voigtländer, Free theorems in the presence of seq, Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.99-110, January 14-16, 2004, Venice, Italy
• 143: Steven Dexter Johnson, Synthesis of digital designs from recursion equations, Indiana University, Indianapolis, IN, 1983
• 144: Thomas Johnsson, Efficient compilation of lazy evaluation, Proceedings of the 1984 SIGPLAN symposium on Compiler construction, p.58-69, June 17-22, 1984, Montreal, Canada
• 145: Jones, M. (1991). Type inference for qualified types. PRG-TR-10-91, Programming Research Group, Oxford, Oxford University.
• 146: Mark P. Jones, A theory of qualified types, Symposium proceedings on 4th European symposium on programming, p.287-306, January 1992, Rennes, France
• 147: Mark P. Jones, A system of constructor classes: overloading and implicit higher-order polymorphism, Proceedings of the conference on Functional programming languages and computer architecture, p.52-61, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165190]
• 148: Mark P. Jones, Qualified types: theory and practice, Cambridge University Press, New York, NY, 1995
• 149: Mark P. Jones, Simplifying and improving qualified types, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.160-169, June 26-28, 1995, La Jolla, California, United States [doi>10.1145/224164.224198]
• 150: Jones, M. (1999). Typing Haskell in Haskell. In (Meijer, 1999). Available at ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1999/1999-28.pdf.
• 151: Mark P. Jones, Type Classes with Functional Dependencies, Proceedings of the 9th European Symposium on Programming Languages and Systems, p.230-244, April 02, 2000
• 152: Jones, M. and Duponcheel, L. (1994). Composing monads. Technical Report YALEU/DCS/RR-1004, Yale University.
• 153: Proc. of a conference on Functional programming languages and computer architecture, January 1985
• 154: Stefan Kaes, Parametric Overloading in Polymorphic Programming Languages, Proceedings of the 2nd European Symposium on Programming, p.131-144, March 21-24, 1988
• 155: Keller, R., Lindstrom, G., and Patil, S. (1979). A loosely coupled applicative multiprocessing system. In AFIPS Conference Proceedings, pages 613--622.
• 156: N. I. Adams, IV , D. H. Bartley , G. Brooks , R. K. Dybvig , D. P. Friedman , R. Halstead , C. Hanson , C. T. Haynes , E. Kohlbecker , D. Oxley , K. M. Pitman , G. J. Rozas , G. L. Steele, Jr. , G. J. Sussman , M. Wand , H. Abelson, Revised5 report on the algorithmic language scheme, ACM SIGPLAN Notices, v.33 n.9, p.26-76, Sept. 1, 1998 [doi>10.1145/290229.290234]
• 157: Oleg Kiselyov , Ralf Lämmel , Keean Schupke, Strongly typed heterogeneous collections, Proceedings of the 2004 ACM SIGPLAN workshop on Haskell, September 22-22, 2004, Snowbird, Utah, USA [doi>10.1145/1017472.1017488]
• 158: Oleg Kiselyov , Chung-chieh Shan, Functional pearl: implicit configurations--or, type classes reflect the values of types, Proceedings of the 2004 ACM SIGPLAN workshop on Haskell, September 22-22, 2004, Snowbird, Utah, USA [doi>10.1145/1017472.1017481]
• 159: Donald E. Knuth, Literate programming, The Computer Journal, v.27 n.2, p.97-111, May 1984 [doi>10.1093/comjnl/27.2.97]
• 160: David Kranz , Norman Adams , Richard Kelsey , Jonathan Rees , Paul Hudak , James Philbin, ORBIT: an optimizing compiler for scheme, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.219-233, June 25-27, 1986, Palo Alto, California, United States
• 161: David Kranz , Richard Kelsey , Jonathan Rees , Paul Hudak , James Philbin , Norman Adams, Orbit: an optimizing compiler for scheme, ACM SIGPLAN Notices, v.39 n.4, April 2004 [doi>10.1145/989393.989414]
• 162: Ralf Lämmel , Simon Peyton Jones, Scrap your boilerplate: a practical design pattern for generic programming, Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation, January 18-18, 2003, New Orleans, Louisiana, USA
• 163: Ralf Lämmel , Simon Peyton Jones, Scrap your boilerplate with class: extensible generic functions, Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, September 26-28, 2005, Tallinn, Estonia
• 164: P. J. Landin, The next 700 programming languages, Communications of the ACM, v.9 n.3, p.157-166, March 1966 [doi>10.1145/365230.365257]
• 165: Landin, P. J. (1964). The mechanical evaluation of expressions. Computer Journal, 6(4):308--320.
• 166: Läufer, K. (1996). Type classes with existential types. Journal of Functional Programming, 6(3):485--517.
• 167: Konstantin Läfer , Martin Odersky, Polymorphic type inference and abstract data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.5, p.1411-1430, Sept. 1994 [doi>10.1145/186025.186031]
• 168: Launchbury, J. (1993). Lazy imperative programming. In Proc ACMSigplan Workshop on State in Programming Languages, Copenhagen (available as YALEU/DCS/RR-968, Yale University), pages pp46--56.
• 169: John Launchbury , Simon L. Peyton Jones, State in Haskell, Lisp and Symbolic Computation, v.8 n.4, p.293-341, Dec. 1995 [doi>10.1007/BF01018827]
• 170: John Launchbury , Amr Sabry, Monadic state: axiomatization and type safety, Proceedings of the second ACM SIGPLAN international conference on Functional programming, p.227-238, June 09-11, 1997, Amsterdam, The Netherlands
• 171: Proceedings of the 1992 Glasgow Workshop on Functional Programming, July 1992
• 172: Daan Leijen , Erik Meijer, Domain specific embedded compilers, Proceedings of the 2nd conference on Domain-specific languages, p.109-122, October 03-06, 1999, Austin, Texas, United States
• 173: Jeffrey R. Lewis , John Launchbury , Erik Meijer , Mark B. Shields, Implicit parameters: dynamic scoping with static types, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.108-118, January 19-21, 2000, Boston, MA, USA [doi>10.1145/325694.325708]
• 174: LFP84 (1984). ACM Symposium on Lisp and Functional Programming (LFP'84). ACM.
• 175: Huiqing Li , Claus Reinke , Simon Thompson, Tool support for refactoring functional programs, Proceedings of the 2003 ACM SIGPLAN workshop on Haskell, p.27-38, August 28-28, 2003, Uppsala, Sweden [doi>10.1145/871895.871899]
• 176: Sheng Liang , Paul Hudak , Mark Jones, Monad transformers and modular interpreters, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-343, January 23-25, 1995,