8 citations · 12 across the 4 of their papers we have counts for
4 papers
Dependent Type Systems as Macros
Stephen Chang, Michael Ballantyne, Milo Turner +1
We present Turnstile+, a high-level, macros-based metaDSL for building dependently typed languages. With it, programmers may rapidly prototype and iterate on the design of new depe…
The Call-by-need Lambda Calculus, Revisited
Stephen Chang, Matthias Felleisen
The existing call-by-need lambda calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equi…
Stepping Lazy Programs
Stephen Chang, John Clements, Eli Barzilay +1
Debugging lazy functional programs poses serious challenges. In support of the "stop, examine, and resume" debugging style of imperative languages, some debugging tools abandon laz…
Evaluating Call-By-Need on the Control Stack
Stephen Chang, David Van Horn, Matthias Felleisen
Ariola and Felleisen's call-by-need λ-calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substitution, function a…