Warm fusion

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Warm fusion: deriving build-catas from recursive definitions

Full text

Pdf (963 KB)

Source

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

La Jolla, California, United States

Pages: 314 - 323

Year of Publication: 1995

ISBN:0-89791-719-7

Authors

John Launchbury	Oregon Graduate Institute of Science & Technology, P.O. Box 91000, Portland, OR
Tim Sheard	Oregon Graduate Institute of Science & Technology, P.O. Box 91000, Portland, OR

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 20, Citation Count: 25

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/224164.224223 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.

	DB76	J.Darlington and R.Burstall, A System which Automatically Improves Programs. Acta Inforrnatica, 6(1), pp 41-60, 1976.
	FW89	A.Ferguson and P. Wadler, When will deforestation stop?. Proc. Glasgow workshop on Func~ tional Programming, Rothesay, Scotland, Dept. of CS, Glasgow, 1989.
	GLPJ93	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]
	KL95	David J. King , John Launchbury, Structuring depth-first search algorithms in Haskell, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.344-354, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199530]
	Mal89	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
	MFR91	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
	MH95	E.Meijer and G.Hutton, Bananas in Space: Extending Squiggol to Function-Space Types. Proc. FPCA 95,
	PJL91	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, June 1991, Cambridge, Massachusetts, United States
	SF93	Tim Sheard , Leonidas Fegaras, A fold for all seasons, Proceedings of the conference on Functional programming languages and computer architecture, p.233-242, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165216]
	SF93	T. Sheard, L. Fegaras and T. Zhou, Improving Programs Which Induct Over Multiple Inductive Structures. ACM SiGPLAN workshop on Partial Evaluation and Semantic's Based Program Manipulation, PEPM'94. Orlando Florida. June 1994.
	Tur86	Valentin F. Turchin, The concept of a supercompiler, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.3, p.292-325, July 1986 [doi>10.1145/5956.5957]
	Wad84	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]
	Wad90	Philip Wadler, Deforestation: transforming programs to eliminate trees, Theoretical Computer Science, v.73 n.2, p.231-248, June 22, 1990

CITED BY 25

	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
	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
	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
	Graham Hutton, Fold and unfold for program semantics, ACM SIGPLAN Notices, v.34 n.1, p.280-288, Jan. 1999
	Martin Erwig, Functional programming with graphs, ACM SIGPLAN Notices, v.32 n.8, p.52-65, Aug. 1997
	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
	Michael Sperber , Peter Thiemann, Two for the price of one: composing partial evaluation and compilation, ACM SIGPLAN Notices, v.32 n.5, p.215-225, May 1997
	Olaf Chitil, Typer inference builds a short cut to deforestation, ACM SIGPLAN Notices, v.34 n.9, p.249-260, Sept. 1999
	Torsten Grust , Marc H. Scholl, How to Comprehend Queries Functionally, Journal of Intelligent Information Systems, v.12 n.2-3, p.191-218, March 1999
	Olivier Danvy , Mayer Goldberg, There and back again, ACM SIGPLAN Notices, v.37 n.9, p.230-234, September 2002
	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
	Olin Shivers , Matthew Might, Continuations and transducer composition, ACM SIGPLAN Notices, v.41 n.6, June 2006
	Atsushi Ohori , Isao Sasano, Lightweight fusion by fixed point promotion, ACM SIGPLAN Notices, v.42 n.1, January 2007
	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
	Duncan Coutts , Roman Leshchinskiy , Don Stewart, Stream fusion: from lists to streams to nothing at all, ACM SIGPLAN Notices, v.42 n.9, September 2007
	João Paulo Fernandes , Alberto Pardo , João Saraiva, A shortcut fusion rule for circular program calculation, Proceedings of the ACM SIGPLAN workshop on Haskell workshop, September 30-30, 2007, Freiburg, Germany
	Graham Hutton, A tutorial on the universality and expressiveness of fold, Journal of Functional Programming, v.9 n.4, p.355-372, July 1999
	Claus Jürgensen , Heiko Vogler, Syntactic composition of top-down tree transducers is short cut fusion, Mathematical Structures in Computer Science, v.14 n.2, p.215-282, April 2004
	Olivier Danvy , Kevin Millikin, On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion, Information Processing Letters, v.106 n.3, p.100-109, April, 2008
	Andy Gill , Graham Hutton, The worker/wrapper transformation, Journal of Functional Programming, v.19 n.2, p.227-251, March 2009