A fold for all seasons

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A fold for all seasons

Full text

Pdf (999 KB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the conference on Functional programming languages and computer architecture table of contents

Copenhagen, Denmark

Pages: 233 - 242

Year of Publication: 1993

ISBN:0-89791-595-X

Authors

Tim Sheard
Leonidas Fegaras

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 23, Citation Count: 31

Additional Information:

references cited by index terms collaborative colleagues

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

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165180.165216 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Wei-Ngan Chin, Safe fusion of functional expressions, Proceedings of the 1992 ACM conference on LISP and functional programming, p.11-20, June 22-24, 1992, San Francisco, California, United States
	2	J. Cockett and D. Spencer. :Strong Categorical Datatypes I. In R. Seely, editor, International Meetin9 on Category Theory 1991, Can~vdian Mathematical Society Proceedings, Vol. 13, pp 141-169. AMS, Montreal, 1992.
	3	J. Cockett and T. Fukushima. About Charity The University of Calgary, Department of Computer Science, Research Report No. 92/480/18. June 1992.
	4	:I. Daxlington and R. Burstall. A System which Automatically Improves Programs. Acts In.formatica, 6(1):41-60, 1976.
	5	H. Dybkjeer. Category Theory, Types, and Programming Languages. Ph.D. thesis, Department of Compurer Science, University of Copenhagen (DIKU), May 1991.
	6	Leonidas Fegaras, A transformational approach to database system implementation, University of Massachusetts, Amherst, MA, 1993
	7	Leonidas Fegaras , Tim Sheard , David W. Stemple, Uniform Traversal Combinators: Definition, Use and Properties, Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction, p.148-162, June 15-18, 1992
	8	A. Ferguson, and P. Wadler. When will Deforestation Stop. In Proc. of 1988 Glasgow Workshop on Func. tional Programming (also as research report 89/R4 of Glasgow University), pp 39-56, Rothesay, Isle of Bute, August 1988.
	9	Tatsuya Hagino, A categorical programming language, 1987
	10	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]
	11	:I. Hook, R. Kieburtz, and T. Sheard. Generating Programs by Reflection. Oregon Graduate Institute Technical Report 92-015, submitted to Journal of Functional Programming.
	12	Grant Malcolm, Homomorphisms and Promotability, Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University, p.335-347, June 26-30, 1989
	13	Erik Meijer , Maarten Fokkinga , Ross Paterson, Functional programming with bananas, lenses, envelopes and barbed wire, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.124-144, June 1991, Cambridge, Massachusetts, United States
	14	Philip Wadler, Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.45-52, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802020]
	15	Philip Wadler, Deforestation: transforming programs to eliminate trees, Proceedings of the Second European Symposium on Programming, p.231-248, January 1988, Nancy, France
	16	P. Wadler. Editorial- Lazy Functional Programming The Computer Journal, Vol. 32, No. 2, 1989, p. 97.
	17	Mitchell Wand, Continuation-Based Program Transformation Strategies, Journal of the ACM (JACM), v.27 n.1, p.164-180, Jan. 1980 [doi>10.1145/322169.322183]
	18	Richard C. Waters, Automatic transformation of series expressions into loops, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.52-98, Jan. 1991 [doi>10.1145/114005.102806]

CITED BY 31

	John Launchbury , Tim Sheard, Warm fusion: deriving build-catas from recursive definitions, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.314-323, June 26-28, 1995, La Jolla, California, United States
	Akihiko Takano , Zhenjiang Hu , Masato Takeichi, Program transformation in calculational form, ACM Computing Surveys (CSUR), v.30 n.3es, Sept. 1998
	Leonidas Fegaras , Tim Sheard, Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space), Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.284-294, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Zhenjiang Hu , Masato Takeichi , Wei-Ngan Chin, Parallelization in calculational forms, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.316-328, January 19-21, 1998, San Diego, California, United States
	Graham Hutton, Fold and unfold for program semantics, ACM SIGPLAN Notices, v.34 n.1, p.280-288, Jan. 1999
	H. Seidl , M. H. Sørensen, Constraints to stop higher-order deforestation, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.400-413, January 15-17, 1997, Paris, France
	Zhenjiang Hu , Hideya Iwasaki , Masato Takeichi, Deriving structural hylomorphisms from recursive definitions, ACM SIGPLAN Notices, v.31 n.6, p.73-82, June 15, 1996
	Isao Sasano , Zhenjiang Hu , Masato Takeichi , Mizuhito Ogawa, Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems, ACM SIGPLAN Notices, v.35 n.9, p.137-149, Sept. 2000
	Andres Löh , Dave Clarke , Johan Jeuring, Dependency-style generic haskell, ACM SIGPLAN Notices, v.38 n.9, p.141-152, September 2003
	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
	Ralf Lämmel , Simon Peyton Jones, Scrap your boilerplate: a practical design pattern for generic programming, ACM SIGPLAN Notices, v.38 n.3, March 2003
	Josef Svenningsson, Shortcut fusion for accumulating parameters & zip-like functions, ACM SIGPLAN Notices, v.37 n.9, p.124-132, September 2002
	Akihiko Takano , Erik Meijer, Shortcut deforestation in calculational form, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.306-313, June 26-28, 1995, La Jolla, California, United States
	Martin Erwig, Functional programming with graphs, ACM SIGPLAN Notices, v.32 n.8, p.52-65, Aug. 1997
	Susumu Nishimura, Fusion with stacks and accumulating parameters, Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.101-112, August 24-25, 2004, Verona, Italy
	Patricia Johann, A Generalization of Short-Cut Fusion and its Correctness Proof, Higher-Order and Symbolic Computation, v.15 n.4, p.273-300, December 2002
	Neil Ghani , Patricia Johann , Tarmo Uustalu , Varmo Vene, Monadic augment and generalised short cut fusion, ACM SIGPLAN Notices, v.40 n.9, September 2005
	Tarmo Uustalu , Varmo Vene, Least and greatest fixed points in intuitionistic natural deduction, Theoretical Computer Science, v.272 n.1-2, p.315-339, February 6, 2002
	J. Bell , F. Bellegarde , J. Hook , R. B. Kieburtz , A. Kotov , J. Lewis , L. McKinney , D. P. Oliva , T. Sheard , L. Tong , L. Walton , T. Zhou, Software design for reliability and reuse: a proof-of-concept demonstration, Proceedings of the conference on TRI-Ada '94, p.396-404, November 06-11, 1994, Baltimore, Maryland, United States
	Atsushi Ohori , Isao Sasano, Lightweight fusion by fixed point promotion, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Shin-ya Katsumata , Susumu Nishimura, Algebraic fusion of functions with an accumulating parameter and its improvement, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Deling Ren , Martin Erwig, A generic recursion toolbox for Haskell or: scrap your boilerplate systematically, Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, September 17-17, 2006, Portland, Oregon, USA
	Patricia Johann, Testing and enhancing a prototype program fusion engine, ACM SIGSOFT Software Engineering Notes, v.25 n.1, p.60-61, Jan 2000
	Patricia Johann , Eelco Visser, Warm fusion in Stratego: A case study in generation of program transformation systems, Annals of Mathematics and Artificial Intelligence, v.29 n.1-4, p.1-34, 2000
	Alcino Cunha , Jorge Sousa Pinto, Point-free Program Transformation, Fundamenta Informaticae, v.66 n.4, p.315-352, December 2005
	Geoff W. Hamilton, Higher Order Deforestation, Fundamenta Informaticae, v.69 n.1-2, p.39-61, January 2006
	Janis Voigtländer , Armin Kühnemann, Composition of functions with accumulating parameters, Journal of Functional Programming, v.14 n.3, p.317-363, May 2004
	Graham Hutton, A tutorial on the universality and expressiveness of fold, Journal of Functional Programming, v.9 n.4, p.355-372, July 1999
	Peter Thiemann, Combinators for program generation, Journal of Functional Programming, v.9 n.5, p.483-525, September 1999
	Patricia Johann, Short cut fusion is correct, Journal of Functional Programming, v.13 n.4, p.797-814, July 2003
	Shin-ya Katsumata , Susumu Nishimura, Algebraic fusion of functions with an accumulating parameter and its improvement, Journal of Functional Programming, v.18 n.5-6, p.781-819, September 2008