From Stack Traces to Lazy Rewriting Sequences Stephen Chang1 , Eli Barzilay1 , John Clements2 , and Matthias Felleisen1 1 2

First Page		Document Content
Date: 2012-08-23 01:56:39 Software engineering Computer programming Computing Functional languages Evaluation strategy Computability theory Lambda calculus Theoretical computer science Lazy evaluation Functional programming ALGOL 68 Racket		From Stack Traces to Lazy Rewriting Sequences Stephen Chang1 , Eli Barzilay1 , John Clements2 , and Matthias Felleisen1 1 2 Add to Reading List Source URL: www.ccs.neu.edu Download Document from Source Website File Size: 559,48 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document