16 citations · 17 across the 3 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2011★ 16 cited
Extensible Pattern Matching in an Extensible Language
Sam Tobin-Hochstadt
Pattern matching is a widely used technique in functional languages, especially those in the ML and Haskell traditions, where it is at the core of the semantics. In languages in th…
cs.PL2011★ 1 cited
The Design and Implementation of Typed Scheme: From Scripts to Programs
Sam Tobin-Hochstadt, Matthias Felleisen
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of explicit type annotations in typical scripting languages forces programmer…
cs.PL2011
Semantic Solutions to Program Analysis Problems
Sam Tobin-Hochstadt, David Van Horn
Problems in program analysis can be solved by developing novel program semantics and deriving abstractions conventionally. For over thirty years, higher-order program analysis has…