Walid at 13:31, 16 December 2011

2011-12-16T13:31:44Z

← Older revision		Revision as of 15:31, 16 December 2011
Line 1:		Line 1:
	[[Category:WG211]]		[[Category:WG211]]

			Walid Taha
	~~<HTML>~~
	~~<HEAD>~~
	~~<title>~~Walid Taha~~</title>~~
	~~</head>~~

	~~<body bgcolor="white">~~

	Title:		Title:
Line 13:		Line 7:
	<br>Speaker: [[http://www.cs.rice.edu/~taha/ Walid Taha]]		<br>Speaker: [[http://www.cs.rice.edu/~taha/ Walid Taha]]
	<p>		<p>
	Slides: [[~~http~~:~~//pub.smart-generators.org/M3Schedule/~~MonadsforCodeDuplication.pdf .pdf]]		Slides: [[Media:MonadsforCodeDuplication.pdf\| MonadsforCodeDuplication.pdf]]
	<p>		<br>
	Abstract:<br>		Abstract:<br>
	Building program generators that do not duplicate generated code can		Building program generators that do not duplicate generated code can
Line 30:		Line 24:

	For more information, please see the [[http://www.cs.rice.edu/~taha/publications/conference/pepm06.pdf PEPM 2006 paper]] describing this approach.		For more information, please see the [[http://www.cs.rice.edu/~taha/publications/conference/pepm06.pdf PEPM 2006 paper]] describing this approach.

	~~</BODY>~~

	~~</html>~~

Admin: 1 revision

2011-12-12T10:06:26Z

1 revision

New page

[[Category:WG211]]

<HTML>
<HEAD>
<title>Walid Taha</title>
</head>

<body bgcolor="white">

Title:
A monadic approach to avoiding code duplication
<br>Speaker: [[http://www.cs.rice.edu/~taha/ Walid Taha]]
<p>
Slides: [[http://pub.smart-generators.org/M3Schedule/MonadsforCodeDuplication.pdf .pdf]]
<p>
Abstract:<br>
Building program generators that do not duplicate generated code can
be challenging. At the same time, code duplication can easily increase
both generation time and runtime of generated programs by an
exponential factor. We identify an instance of this problem that can
arise when memoized functions are staged. Without addressing this
problem, it would be impossible to effectively stage dynamic programming algori
thms. Intuitively, direct staging undoes the effect
of memoization. To solve this problem once and for all, and for any
function that uses memoization, we propose a staged
monadic combinator library. Experimental results confirm that the
library works as expected. Preliminary results also indicate that
the library is useful even when memoization is not used.

For more information, please see the [[http://www.cs.rice.edu/~taha/publications/conference/pepm06.pdf PEPM 2006 paper]] describing this approach.

</BODY>

</html>

WG211/M3Taha - Revision history

Walid at 13:31, 16 December 2011

Admin: 1 revision