16 citations · 16 across the 1 of their papers we have counts for
4 papers · 1 filter
FreezeML: Complete and Easy Type Inference for First-Class Polymorphism
Frank Emrich, Sam Lindley, Jan Stolarek +2
ML is remarkable in providing statically typed polymorphism without the programmer ever having to write any type annotations. The cost of this parsimony is that the programmer is l…
Verified Self-Explaining Computation
Jan Stolarek, James Cheney
Common programming tools, like compilers, debuggers, and IDEs, crucially rely on the ability to analyse program code to reason about its behaviour and properties. There has been a…
Language-integrated provenance in Haskell
Jan Stolarek, James Cheney
Scientific progress increasingly depends on data management, particularly to clean and curate data so that it can be systematically analyzed and reused. A wealth of techniques for…
Imperative Functional Programs that Explain their Work
Wilmer Ricciotti, Jan Stolarek, Roly Perera +1
Program slicing provides explanations that illustrate how program outputs were produced from inputs. We build on an approach introduced in prior work by Perera et al., where dynami…