Optimizing Ackermann’s Function by Incrementalization∗ Yanhong A. Liu

First Page		Document Content
Date: 2006-12-05 12:57:55 Recursion Computability theory Theory of computation Subroutines Programming idioms Primitive recursive function Aall Tail call Dynamic programming Computer programming Computing Software engineering		Optimizing Ackermann’s Function by Incrementalization∗ Yanhong A. Liu Add to Reading List Source URL: www.cs.stonybrook.edu Download Document from Source Website File Size: 89,40 KB Share Document on Facebook

	Under consideration for publication in J. Functional Programming 1 FUNCTIONAL PEARL Idioms: applicative programming with effects DocID: 1tDqD - View Document
	How to Twist Pointers without Breaking Them Satvik Chauhan ∗ Piyush P. Kurur Brent A. Yorgey DocID: 1rpNK - View Document
	Curriculum and Course Syllabi for a High-School Program in Computer Science1 Judith Gal-Ezer2 David Harel3 DocID: 1rozw - View Document
	Overview Problem Solving, Programming, and Calculation Basic concepts of functional programming: computation by calculation, values, expressions, types, declarations DocID: 1rio2 - View Document
	Problem Solving, Programming, and Calculation Björn Lisper School of Innovation, Design, and Engineering Mälardalen University http://www.idt.mdh.se/˜blr/ DocID: 1qLWC - View Document