Stephen Chang

308 West Village H
stchang at ccs dot neu dot edu

Lecturer, Researcher [cv]
Northeastern University
College of Computer and Information Science
Programming Research Lab

I am teaching CS5010 this semester (Spring 2015)

Research Interests | Papers | Dissertation | Other Talks | Teaching

Research interests

I'm interested in the design of practical programming languages.

My dissertation explored lazy evaluation from both a theoretical and a practical perspective.

I also hack on Racket.


Profiling For Laziness. With Matthias Felleisen.
41st Symposium on Principles of Programming Languages (POPL 2014), San Diego, CA, USA, January 2014.
[  PDF  | Abstract  ]

Laziness By Need.
22rd European Symposium on Programming (ESOP 2013), Rome, Italy, March 2013.
[  PDF  | Abstract  | Slides  ]

The Call-by-need Lambda Calculus, Revisited. With Matthias Felleisen.
21st European Symposium on Programming (ESOP 2012), Tallinn, Estonia, March 2012.
[  PDF  | Abstract  | Slides  | arXiv  ]

From Stack Traces to Lazy Rewriting Sequences. With Eli Barzilay, John Clements, and Matthias Felleisen.
Symposium on Implementation and Application of Functional Languages (IFL 2011), Lawrence, Kansas, USA, October 2011.
[  PDF  | Abstract  | Slides  | arXiv (previous version)  ]

Evaluating Call By Need on the Control Stack. With David Van Horn and Matthias Felleisen.
11th Symposium on Trends in Functional Programming (TFP 2010), Norman, Oklahoma, USA, May 2010.
Best Student Paper award
[  PDF  | Abstract  | Slides  | arXiv  ]


On the Relationship Between Laziness and Strictness. Northeastern University, May 2014.
[  PDF  ]

Other Talks

A Boost-Inspired Graph Library for Racket. fourth RacketCon, St. Louis, MO, September 2014.
[  Abstract  | Slides  | Video  ]