The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

Source

Medium: Hardcover

Year of Publication: 1987

ISBN:013453333X

Author

Simon L. Peyton Jones

Publisher

Prentice-Hall, Inc. Upper Saddle River, NJ, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 139

Additional Information:

cited by index terms collaborative colleagues

Tools and Actions:	Review this Book Save this Book to a Binder Display Formats: BibTeX EndNote ACM Ref

CITED BY 139

	Massimo Marchiori, The functional side of logic programming, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.55-65, June 26-28, 1995, La Jolla, California, United States
	Lal George, An abstract machine for parallel graph reduction, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.214-229, September 11-13, 1989, Imperial College, London, United Kingdom
	Samson Abramsky , Thomas P. Jensen, A relational approach to strictness analysis for higher-order polymorphic functions, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-54, January 21-23, 1991, Orlando, Florida, United States
	Guillermo Juan Rozas, Taming the Y operator, ACM SIGPLAN Lisp Pointers, v.V n.1, p.226-234, Jan. 1992
	Simon L. Peyton Jones , Jon Salkild, The spineless tagless G-machine, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.184-201, September 11-13, 1989, Imperial College, London, United Kingdom
	Cordelia V. Hall , Kevin Hammond , Simon L. Peyton Jones , Philip L. Wadler, Type classes in Haskell, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.2, p.109-138, March 1996
	Shinn-Der Lee , Daniel P. Friedman, Quasi-static scoping: sharing variable bindings across multiple lexical scopes, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.479-492, March 1993, Charleston, South Carolina, United States
	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, An analysis of ML typability, Journal of the ACM (JACM), v.41 n.2, p.368-398, March 1994
	P. J. Koopman, Jr. , P. Lee, A fresh look at combinator graph reduction, ACM SIGPLAN Notices, v.24 n.7, p.110-119, July 1989
	Olivier Danvy , John Hatcliff, CPS-transformation after strictness analysis, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.3, p.195-212, Sept. 1992
	Hanne Riis Nielson , Flemming Nielson, Context information for lazy code generation, Proceedings of the 1990 ACM conference on LISP and functional programming, p.251-263, June 27-29, 1990, Nice, France
	Leonidas Fegaras , David Maier, Optimizing object queries using an effective calculus, ACM Transactions on Database Systems (TODS), v.25 n.4, p.457-516, Dec. 2000
	Ian Mackie, The geometry of interaction machine, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.198-208, January 23-25, 1995, San Francisco, California, United States
	Luc Maranget, Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.255-269, January 21-23, 1991, Orlando, Florida, United States
	Norman Ramsey, Relocating machine instructions by currying, ACM SIGPLAN Notices, v.31 n.5, p.226-236, May 1996
	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, A proper extension of ML with an effective type-assignment, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.58-69, January 10-13, 1988, San Diego, California, United States
	John Field , Tim Teitelbaum, Incremental reduction in the lambda calculus, Proceedings of the 1990 ACM conference on LISP and functional programming, p.307-322, June 27-29, 1990, Nice, France
	Barrett R. Bryant , Daniel T. Chang , Prakash K. Muthukrishnan , Viswanathan Vaidyanathan, Automatic parallelization of object-oriented programming languages using tuple space, Proceedings of the 1995 ACM 23rd annual conference on Computer science, p.89-96, February 28-March 02, 1995, Nashville, Tennessee, United States
	Pieter H. Hartel , Koen G. Langendoen, Benchmarking implementations of lazy functional languages, Proceedings of the conference on Functional programming languages and computer architecture, p.341-349, June 09-11, 1993, Copenhagen, Denmark
	Simon Peyton Jones , Will Partain , André Santos, Let-floating: moving bindings to give faster programs, ACM SIGPLAN Notices, v.31 n.6, p.1-12, June 15, 1996
	Arne Kutzner , Manfred Schmidt-Schauß, A non-deterministic call-by-need lambda calculus, ACM SIGPLAN Notices, v.34 n.1, p.324-335, Jan. 1999
	Rémi Douence , Pascal Fradet, A systematic study of functional language implementations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.2, p.344-387, March 1998
	N. Raja , R. K. Shyamasundar, Combinatory formulations of concurrent languages, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.6, p.899-915, Nov. 1997
	Peter J. Thiemann, Unboxed values and polymorphic typing revisited, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.24-35, June 26-28, 1995, La Jolla, California, United States
	Peter Sestoft, Replacing function parameters by global variables, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.39-53, September 11-13, 1989, Imperial College, London, United Kingdom
	Leonidas Fegaras, Query unnesting in object-oriented databases, ACM SIGMOD Record, v.27 n.2, p.49-60, June 1998
	Pascal Fradet, Collecting more garbage, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.24-33, July-Sept. 1994
	David R. Lester, Stacklessness: compiling recursion for a distributed architecture, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.116-128, September 11-13, 1989, Imperial College, London, United Kingdom
	Keith Hanna, Interactive visual functional programming, ACM SIGPLAN Notices, v.37 n.9, p.145-156, September 2002
	Olivier Danvy , Ulrik P. Schultz, Lambda-dropping: transforming recursive equations into programs with block structure, ACM SIGPLAN Notices, v.32 n.12, p.90-106, Dec. 1997
	Arvind , Rishiyur S. Nikhil , Keshav K. Pingali, I-structures: data structures for parallel computing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.598-632, Oct. 1989
	Simon Marlow , Philip Wadler, A practical subtyping system for Erlang, ACM SIGPLAN Notices, v.32 n.8, p.136-149, Aug. 1997
	Ian Mackie, YALE: yet another lambda evaluator based on interaction nets, ACM SIGPLAN Notices, v.34 n.1, p.117-128, Jan. 1999
	Tim Sheard, Automatic generation and use of abstract structure operators, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.4, p.531-557, Oct. 1991
	Julian R. Dermoudy, A novel approach to parenting in functional program evaluation, Proceedings of the twenty-sixth Australasian conference on Computer science: research and practice in information technology, p.217-226, February 01, 2003, Adelaide, Australia
	Thérèse Hardin , Luc Maranget , Bruno Pagano, Functional back-ends within the lambda-sigma calculus, ACM SIGPLAN Notices, v.31 n.6, p.25-33, June 15, 1996
	Franklyn Turbak, First-class synchronization barriers, ACM SIGPLAN Notices, v.31 n.6, p.157-168, June 15, 1996
	Chris Hanson, Efficient stack allocation for tail-recursive languages, Proceedings of the 1990 ACM conference on LISP and functional programming, p.106-118, June 27-29, 1990, Nice, France
	Alberto Paoluzzi , Valerio Pascucci , Michele Vicentino, Geometric programming: a programming approach to geometric design, ACM Transactions on Graphics (TOG), v.14 n.3, p.266-306, July 1995
	William M. Farmer , John D. Ramsdell , Ronald J. Watro, A correctness proof for combinator reduction with cycles, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.123-134, Jan. 1990
	Anders Sandholm , Michael I. Schwartzbach, A type system for dynamic Web documents, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.290-301, January 19-21, 2000, Boston, MA, USA
	Niklas Röjemo, Highlights from nhc—a space-efficient Haskell compiler, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.282-292, June 26-28, 1995, La Jolla, California, United States
	Chris Clack , Simon L. Peyton Jones, The four-stroke reduction engine, Proceedings of the 1986 ACM conference on LISP and functional programming, p.220-232, August 1986, Cambridge, Massachusetts, United States
	María Alpuente , Michael Hanus , Salvador Lucas , Germán Vidal, Specialization of inductively sequential functional logic programs, ACM SIGPLAN Notices, v.34 n.9, p.273-283, Sept. 1999
	Shinn-Der Lee , Daniel P. Friedman, Enriching the lambda calculus with contexts: toward a theory of incremental program construction, ACM SIGPLAN Notices, v.31 n.6, p.239-250, June 15, 1996
	Brian T. Howard , John C. Mitchell, Operational and axiomatic semantics of PCF, Proceedings of the 1990 ACM conference on LISP and functional programming, p.298-306, June 27-29, 1990, Nice, France
	John Field, On laziness and optimality in lambda interpreters: tools for specification and analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-15, December 1989, San Francisco, California, United States
	Paul A. Bailes , Dan Johnston , Eric Salzman , Li Wang, Full functional programming in a declarative Ada dialect, Proceedings of the conference on TRI-Ada '92, p.350-358, November 16-20, 1992, Orlando, Florida, United States
	Massimo Marchiori, Light analysis of complex systems, Proceedings of the 1998 ACM symposium on Applied Computing, p.18-22, February 27-March 01, 1998, Atlanta, Georgia, United States
	Philip J. Koopman, Jr. , Peter Lee , Daniel P. Siewiorek, Cache behavior of combinator graph reduction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.14 n.2, p.265-297, April 1992
	Jozef De Man, Making languages more powerful by removing limitations, ACM SIGSOFT Software Engineering Notes, v.15 n.4, p.18-24, Sep. 1990
	David Sands, Total correctness by local improvement in the transformation of functional programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.2, p.175-234, March 1996
	Frank S. K. Silbermann , Bharat Jayaraman, Set abstraction in functional and logic programming, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.313-326, September 11-13, 1989, Imperial College, London, United Kingdom
	Zena M. Ariola, A syntactic approach to program transformations, ACM SIGPLAN Notices, v.26 n.9, p.116-129, Sept. 1991
	Patrick M. Sansom , Simon L. Peyton Jones, Generational garbage collection for Haskell, Proceedings of the conference on Functional programming languages and computer architecture, p.106-116, June 09-11, 1993, Copenhagen, Denmark
	Marcel Beemster, Strictness optimization for graph reduction machines (why id might not be strict), ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.5, p.1449-1466, Sept. 1994
	Mark P. Jones, Using parameterized signatures to express modular structure, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.68-78, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	K. Pingali, Lazy evaluation and the logic variable, Proceedings of the 2nd international conference on Supercomputing, p.560-572, June 1988, St. Malo, France
	Erik Johansson , Mikael Pettersson , Konstantinos Sagonas, A high performance Erlang system, Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.32-43, September 20-23, 2000, Montreal, Quebec, Canada
	Edward Cherlin, Pure functions in APL and J, ACM SIGAPL APL Quote Quad, v.21 n.4, p.88-93, Aug. 1991
	Klaus E. Schauser , Seth C. Goldstein, How much non-strictness do lenient programs require?, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.216-225, June 26-28, 1995, La Jolla, California, United States
	Peter Sestoft, Demonstrating lambda calculus reduction, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Mark P. Jones, First-class polymorphism with type inference, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.483-496, January 15-17, 1997, Paris, France
	Colin Runciman , Ian Toyn, Retrieving re-usable software components by polymorphic type, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.166-173, September 11-13, 1989, Imperial College, London, United Kingdom
	Timothy A. Budd , Rajeev K. Pandey, Compiling APL for parallel and vector execution, ACM SIGAPL APL Quote Quad, v.21 n.4, p.80-87, Aug. 1991
	Jan Sparud, Fixing some space leaks without a garbage collector, Proceedings of the conference on Functional programming languages and computer architecture, p.117-122, June 09-11, 1993, Copenhagen, Denmark
	Craig Chambers , Weimin Chen, Efficient multiple and predicated dispatching, ACM SIGPLAN Notices, v.34 n.10, p.238-255, Oct. 1999
	J. A. Bergstra , T. B. Dinesh , J. Field , J. Heering, Toward a complete transformational toolkit for compilers, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.5, p.639-684, Sept. 1997
	Wan Fokkink , Jasper Kamperman , Pum Walters, Lazy rewriting on eager machinery, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.45-86, Jan. 2000
	Zhenjiang Hu , Hideya Iwasaki , Masato Takeichi , Akihiko Takano, Tupling calculation eliminates multiple data traversals, ACM SIGPLAN Notices, v.32 n.8, p.164-175, Aug. 1997
	Barton C. Massey , Evan Tick, Demand-Driven Dataflow for Concurrent Committed-Choice Code, Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, p.215-224, August 24-26, 1994
	Panos Rondogiannis , William W. Wadge, Compiling Higher-Order Functions for Tagged-Dataflow, Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, p.269-278, August 24-26, 1994
	Cem Bozsahin, Deriving the predicate-argument structure for a free word order language, Proceedings of the 17th international conference on Computational linguistics, August 10-14, 1998, Montreal, Quebec, Canada
	Annika Aasa , Kent Petersson , Dan Synek, Concrete syntax for data objects in functional languages, Proceedings of the 1988 ACM conference on LISP and functional programming, p.96-105, July 25-27, 1988, Snowbird, Utah, United States
	Claus Assmann , Andreas Huth, Compiling C on a Multiple-Stack Architecture, IEEE Micro, v.16 n.5, p.60-67, October 1996
	Matthias Blume , Andrew W. Appel, Lambda-splitting: a higher-order approach to cross-module optimizations, ACM SIGPLAN Notices, v.32 n.8, p.112-124, Aug. 1997
	Paul Hudak, Conception, evolution, and application of functional programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.359-411, Sep. 1989
	Nadia Nedjah, Minimal deterministic left-to-right pattern-matching automata, ACM SIGPLAN Notices, v.33 n.1, January 1998
	P. V. R. Murthy , V. Rajaraman, Implementation of Speculative Parallelism in Functional Languages, IEEE Transactions on Parallel and Distributed Systems, v.5 n.11, p.1197-1205, November 1994
	Kevin Backhouse , Roland Backhouse, Safety of abstract interpretations for free, via logical relations and Galois connections, Science of Computer Programming, v.51 n.1-2, p.153-196, May 2004
	Luigi Liquori , Bernard Paul Serpette, iRho: an imperative rewriting calculus, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.167-178, August 24-26, 2004, Verona, Italy
	Leonidas Fegaras, Optimizing Queries with Object Updates, Journal of Intelligent Information Systems, v.12 n.2-3, p.219-242, March 1999
	Bernd Grobauer , Julia L. Lawall, Partial evaluation of pattern matching in strings, revisited, Nordic Journal of Computing, v.8 n.4, p.437-462, December 2001
	F. Warren Burton , John (Yannis) G. Kollias, Functional Programming with Quadtrees, IEEE Software, v.6 n.1, p.90-97, January 1989
	Bharat Jayaraman , Gopal Gupta, EQL: The Language and its Implementation, IEEE Transactions on Software Engineering, v.15 n.6, p.771-779, June 1989
	Olivier Danvy , Lasse R. Nielsen, Defunctionalization at work, Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.162-174, September 05-07, 2001, Florence, Italy
	Gilles Barthe , Horatiu Cirstea , Claude Kirchner , Luigi Liquori, Pure patterns type systems, ACM SIGPLAN Notices, v.38 n.1, p.250-261, January 2003
	Samson Abramsky, A structural approach to reversible computation, Theoretical Computer Science, v.347 n.3, p.441-464, 1 December 2005
	Jan-Willem Maessen, Eager Haskell: resource-bounded execution yields efficient iteration, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.38-50, October 03, 2002, Pittsburgh, Pennsylvania
	James Bailey , Alexandra Poulovassilis, Abstract Interpretation for Termination Analysis in Functional Active Databases, Journal of Intelligent Information Systems, v.12 n.2-3, p.243-273, March 1999
	Paul Hudak , Simon Peyton Jones , Philip Wadler , Brian Boutel , Jon Fairbairn , Joseph Fasel , María M. Guzmán , Kevin Hammond , John Hughes , Thomas Johnsson , Dick Kieburtz , Rishiyur Nikhil , Will Partain , John Peterson, Report on the programming language Haskell: a non-strict, purely functional language version 1.2, ACM SIGPLAN Notices, v.27 n.5, p.1-164, May 1992
	Michał Walicki , Magne Haveraaen , Sigurd Meldal, Computation Algebras, Mathematical Structures in Computer Science, v.11 n.5, p.597-636, October 2001
	J. R. Kennaway , J. W. Klop , M. R. Sleep , F. J. de Vries, On the adequacy of graph rewriting for simulating term rewriting, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.493-523, May 1994
	G. L. Burn , S. L. Peyton Jones , J. D. Robson, The spineless G-machine, Proceedings of the 1988 ACM conference on LISP and functional programming, p.244-258, July 25-27, 1988, Snowbird, Utah, United States
	Melissa E. O'Neill , F. Warren Burton, Smarter garbage collection with simplifiers, Proceedings of the 2006 workshop on Memory system performance and correctness, October 22-22, 2006, San Jose, California
	Horatiu Cirstea , Germain Faure , Maribel Fernández , Ian Mackie , François-Régis Sinot, From Functional Programs to Interaction Nets via the Rewriting Calculus, Electronic Notes in Theoretical Computer Science (ENTCS), v.174 n.10, p.39-56, July, 2007
	Vincent Simonet , François Pottier, A constraint-based approach to guarded algebraic data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.1, p.1-es, January 2007
	Muck van Weerdenburg, An Account of Implementing Applicative Term Rewriting, Electronic Notes in Theoretical Computer Science (ENTCS), v.174 n.10, p.139-155, July, 2007
	Eugenio Moggi, Structuring Operational Semantics: Simplification and Computation, Electronic Notes in Theoretical Computer Science (ENTCS), 172, p.479-497, April, 2007
	Hugh Osborne , Jiří Mencák, Update plans: pointers in teaching computer architecture, Proceedings of the 2002 workshop on Computer architecture education: Held in conjunction with the 29th International Symposium on Computer Architecture, May 26, 2002, Anchorage, Alaska
	Simon Peyton Jones , Dimitrios Vytiniotis , Stephanie Weirich , Geoffrey Washburn, Simple unification-based type inference for GADTs, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Paul Hudak , John Hughes , Simon Peyton Jones , Philip Wadler, A history of Haskell: being lazy with class, Proceedings of the third ACM SIGPLAN conference on History of programming languages, p.12-1-12-55, June 09-10, 2007, San Diego, California
	S. E. Bazhanov , V. P. Kutepov , D. A. Shestakov, Functional Parallel Typified Language and Its Implementation on Clusters, Programming and Computing Software, v.31 n.5, p.237-269, September 2005
	Henrik Nilsson , Jan Sparud, The Evaluation Dependence Tree as a Basis for Lazy FunctionalDebugging, Automated Software Engineering, v.4 n.2, p.121-150, April 1997
	L. A. Dennis , A. Bundy , I. Green, Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts, Annals of Mathematics and Artificial Intelligence, v.29 n.1-4, p.99-138, 2000
	F.-R. Sinot, Call-by-need in token-passing nets, Mathematical Structures in Computer Science, v.16 n.4, p.639-666, August 2006
	Alexandra Poulovassilis , Carol Small, A Domain-theoretic Approach to Integrating Functional and Logic Database Languages, Proceedings of the 19th International Conference on Very Large Data Bases, p.416-428, August 24-27, 1993
	Choun Tong Lieu , Djamil Sarni, O.LISP theoretical basis and description, ACM SIGPLAN Notices, v.25 n.12, p.37-44, Dec. 1990
	Mário Florido , Luís Damas, Linearization of the lambda-calculus and its relation with intersection type systems, Journal of Functional Programming, v.14 n.5, p.519-546, September 2004
	Sandra Alves , Mário Florido , Ian Mackie , François-Régis Sinot, Minimality in a Linear Calculus with Iteration, Electronic Notes in Theoretical Computer Science (ENTCS), 204, p.163-179, April, 2008
	Apostolos Syropoulos, A note on type checking linear functional languages, ACM SIGPLAN Notices, v.31 n.8, p.60-63, August 1996
	S. L. Payton Jones, FLIC—a functional language intermediate code, ACM SIGPLAN Notices, v.23 n.8, p.30-48, August 1988
	Alessandro Contessa, An approach to fault tolerance and error recovery in a parallel graph reduction machine: MaRS—a case study, ACM SIGARCH Computer Architecture News, v.16 n.3, p.25-32, June 1988
	Henry G. Baker, CONS should not CONS its arguments, part II: Cheney on the M.T.A., ACM SIGPLAN Notices, v.30 n.9, p.17-20, Sept. 1995
	Ernie G. Manes, Implementing collection classes with monads, Mathematical Structures in Computer Science, v.8 n.3, p.231-276, June 1998
	Michael L. Nelson, Concurrency & object-oriented programming, ACM SIGPLAN Notices, v.26 n.10, p.63-72, Oct. 1991
	Gad Aharoni , Amnon Barak , Amir Ronen, A competitive algorithm for managing sharing in the distributed execution of functional programs, Journal of Functional Programming, v.7 n.4, p.421-440, July 1997
	David A. Rosenblueth, Chain programs for writing deterministic metainterpreters, Theory and Practice of Logic Programming, v.2 n.2, p.203-232, March 2002
	Peter Sestoft, Deriving a lazy abstract machine, Journal of Functional Programming, v.7 n.3, p.231-264, May 1997
	Zena M. Ariola , Matthias Felleisen, The call-by-need lambda calculus, Journal of Functional Programming, v.7 n.3, p.265-301, May 1997
	David Wakeling, Compiling lazy functional programs for the Java Virtual Machine, Journal of Functional Programming, v.9 n.6, p.579-603, November 1999
	Michael Hanus , Christian Prehofer, Higher-order narrowing with definitional trees, Journal of Functional Programming, v.9 n.1, p.33-75, January 1999
	David Wakeling, The dynamic compilation of lazy functional programs, Journal of Functional Programming, v.8 n.1, p.61-81, January 1998
	Thérèse Hardin , Luc Maranget , Bruno Pagano, Functional runtime systems within the lambda-sigma calculus, Journal of Functional Programming, v.8 n.2, p.131-176, March 1998
	Henrik Nilsson, How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger, Journal of Functional Programming, v.11 n.6, p.629-671, November 2001
	Nigel W. O. Hutchison , Ute Neuhaus , Manfred Schmidt-Schauss , Cordy V. Hall, NATURAL EXPERT: a commercial functional programming environment, Journal of Functional Programming, v.7 n.2, p.163-182, March 1997
	Simon Peyton Jones, Bibliography, Journal of Functional Programming, v.13 n.1, p.241-255, January 2003
	Simon Peyton Jones , Simon Marlow, Secrets of the Glasgow Haskell Compiler inliner, Journal of Functional Programming, v.12 n.5, p.393-434, July 2002
	Sven-Bodo Scholz, Single Assignment C: efficient support for high-level array operations in a functional setting, Journal of Functional Programming, v.13 n.6, p.1005-1059, November 2003
	Gilles Barthe , John Hatcliff , Morten Heine B. Sørensen, CPS Translations and Applications: The Cube and Beyond, Higher-Order and Symbolic Computation, v.12 n.2, p.125-170, September 1999
	John Maraist , Martin Odersky , Philip Wadler, The call-by-need lambda calculus, Journal of Functional Programming, v.8 n.3, p.275-317, May 1998
	Adam Fischbach , John Hannan, Specification and correctness of lambda lifting, Journal of Functional Programming, v.13 n.3, p.509-543, May 2003
	John W. Lloyd, Declarative programming for artificial intelligence applications, ACM SIGPLAN Notices, v.42 n.9, p.123-124, September 2007
	François-Régis Sinot, Complete Laziness: a Natural Semantics, Electronic Notes in Theoretical Computer Science (ENTCS), 204, p.129-145, April, 2008
	Jan Willem Klop , Vincent van Oostrom , Roel de Vrijer, Lambda calculus with patterns, Theoretical Computer Science, v.398 n.1-3, p.16-31, May, 2008
	Forrest Briggs , Melissa O'Neill, Functional genetic programming and exhaustive program search with combinator expressions, International Journal of Knowledge-based and Intelligent Engineering Systems, v.12 n.1, p.47-68, January 2008
	Colin Runciman , Matthew Naylor , Fredrik Lindblad, Smallcheck and lazy smallcheck: automatic exhaustive testing for small values, Proceedings of the first ACM SIGPLAN symposium on Haskell, September 25-25, 2008, Victoria, BC, Canada
	Barry Jay , Delia Kesner, First-class patterns, Journal of Functional Programming, v.19 n.2, p.191-225, March 2009
	Petr Krajca , Vilem Vychodil, Data parallel dialect of scheme: outline of the formal model, implementation, performance, Proceedings of the 2009 ACM symposium on Applied Computing, March 08-12, 2009, Honolulu, Hawaii