Interlanguage migration: from scripts to programs. - Sam Tobin-Hochstadt; Matthias Felleisen (OOPSLA Companion, 2006)

The design and implementation of typed scheme. - Sam Tobin-Hochstadt; Matthias Felleisen (POPL, 2008)

Cycles without pollution: a gradual typing poem. - Sam Tobin-Hochstadt; Robert Bruce Findler (STOP@ECOOP, 2009)

Practical Variable-Arity Polymorphism. - T. Stephen Strickland; Sam Tobin-Hochstadt; Matthias Felleisen (ESOP, 2009)

Logical types for untyped languages. - Sam Tobin-Hochstadt; Matthias Felleisen (ICFP, 2010)

Languages as libraries. - Sam Tobin-Hochstadt; Vincent St-Amour; Ryan Culpepper; Matthew Flatt; Matthias Felleisen (PLDI, 2011)

Modular Analysis via Specifications as Values - Sam Tobin-Hochstadt; David Van Horn (CoRR, 2011)

Semantic Solutions to Program Analysis Problems - Sam Tobin-Hochstadt; David Van Horn (CoRR, 2011)

The Design and Implementation of Typed Scheme: From Scripts to Programs - Sam Tobin-Hochstadt; Matthias Felleisen (CoRR, 2011)

Extensible Pattern Matching in an Extensible Language - Sam Tobin-Hochstadt (CoRR, 2011)

Complete Monitors for Behavioral Contracts. - Christos Dimoulas; Sam Tobin-Hochstadt; Matthias Felleisen (ESOP, 2012)

Optimization coaching: optimizers learn to communicate with programmers. - Vincent St-Amour; Sam Tobin-Hochstadt; Matthias Felleisen (OOPSLA, 2012)

Chaperones and impersonators: run-time support for reasonable interposition. - T. Stephen Strickland; Sam Tobin-Hochstadt; Robert Bruce Findler; Matthew Flatt (OOPSLA, 2012)

Gradual typing for first-class classes. - Asumu Takikawa; T. Stephen Strickland; Christos Dimoulas; Sam Tobin-Hochstadt; Matthias Felleisen (OOPSLA, 2012)

Higher-order symbolic execution via contracts. - Sam Tobin-Hochstadt; David Van Horn (OOPSLA, 2012)

Typing the Numeric Tower. - Vincent St-Amour; Sam Tobin-Hochstadt; Matthew Flatt; Matthias Felleisen (PADL, 2012)

Run your research: on the effectiveness of lightweight mechanization. - Casey Klein; John Clements; Christos Dimoulas; Carl Eastlund; Matthias Felleisen; Matthew Flatt; Jay A. McCarthy; Jon Rafkind; Sam Tobin-Hochstadt; Robert Bruce Findler (POPL, 2012)

Tutorial: Typed Racket. - Sam Tobin-Hochstadt (ELS, 2013)

Constraining Delimited Control with Contracts. - Asumu Takikawa; T. Stephen Strickland; Sam Tobin-Hochstadt (ESOP, 2013)

Static Contract Checking for Scripting Languages. - Phuc C. Nguyen; Sam Tobin-Hochstadt; David Van Horn (CoRR, 2013)

From Principles to Practice with Class in the First Year. - Sam Tobin-Hochstadt; David Van Horn (TFPIE, 2013)

The Network as a Language Construct. - Tony Garnock-Jones; Sam Tobin-Hochstadt; Matthias Felleisen (ESOP, 2014)

Soft contract verification. - Phuc C. Nguyen; Sam Tobin-Hochstadt; David Van Horn (ICFP, 2014)

Taming the parallel effect zoo: extensible deterministic parallelism with LVish. - Lindsey Kuper; Aaron Todd; Sam Tobin-Hochstadt; Ryan R. Newton (PLDI, 2014)

Towards Practical Gradual Typing. - Asumu Takikawa; Daniel Feltey; Earl Dean; Matthew Flatt; Robert Bruce Findler; Sam Tobin-Hochstadt; Matthias Felleisen (ECOOP, 2015)

Monotonic References for Efficient Gradual Typing. - Jeremy G. Siek; Michael M. Vitousek; Matteo Cimini; Sam Tobin-Hochstadt; Ronald Garcia (ESOP, 2015)

Pycket: a tracing JIT for a functional language. - Spenser Bauman; Carl Friedrich Bolz; Robert Hirschfeld; Vasily Kirilichev; Tobias Pape; Jeremy G. Siek; Sam Tobin-Hochstadt (ICFP, 2015)

Expressing contract monitors as patterns of communication. - Cameron Swords; Amr Sabry; Sam Tobin-Hochstadt (ICFP, 2015)

The Racket Manifesto. - Matthias Felleisen; Robert Bruce Findler; Matthew Flatt; Shriram Krishnamurthi; Eli Barzilay; Jay A. McCarthy; Sam Tobin-Hochstadt (SNAPL, 2015)

The Recursive Union of Some Gradual Types. - Jeremy G. Siek; Sam Tobin-Hochstadt (A List of Successes That Can Change the World, 2016)

Practical Optional Types for Clojure. - Ambrose Bonnaire-Sergeant; Rowan Davies; Sam Tobin-Hochstadt (ESOP, 2016)

Occurrence typing modulo theories. - Andrew M. Kent; David Kempe 002; Sam Tobin-Hochstadt (PLDI, 2016)

Parallel type-checking with haskell using saturating LVars and stream generators. - Ryan R. Newton; Ömer S. Agacan; Peter P. Fogg; Sam Tobin-Hochstadt (PPoPP, 2016)

Compiling Tree Transforms to Operate on Packed Representations. - Michael Vollmer 003; Sarah Spall; Buddhika Chamith; Laith Sakka; Chaitanya Koparkar; Milind Kulkarni 001; Sam Tobin-Hochstadt; Ryan Newton (ECOOP, 2017)

Migratory Typing: Ten Years Later. - Sam Tobin-Hochstadt; Matthias Felleisen; Robert Bruce Findler; Matthew Flatt; Ben Greenman; Andrew M. Kent; Vincent St-Amour; T. Stephen Strickland; Asumu Takikawa (SNAPL, 2017)

Higher order symbolic execution for contract verification and refutation. - Phuc C. Nguyen; Sam Tobin-Hochstadt; David Van Horn (J. Funct. Program., 2017)

Sound gradual typing: only mostly dead. - Spenser Bauman; Carl Friedrich Bolz-Tereick; Jeremy G. Siek; Sam Tobin-Hochstadt (Proc. ACM Program. Lang., 2017)

A programmable programming language. - Matthias Felleisen; Robert Bruce Findler; Matthew Flatt; Shriram Krishnamurthi; Eli Barzilay; Jay A. McCarthy; Sam Tobin-Hochstadt (Commun. ACM, 2018)

Efficient compilation of array probabilistic programs. - Rajan Walia; Jacques Carette; Praveen Narayanan; Chung-chieh Shan; Sam Tobin-Hochstadt (CoRR, 2018)

Size-Change Termination as a Contract. - Phuc C. Nguyen; Thomas Gilray; Sam Tobin-Hochstadt; David Van Horn (CoRR, 2018)

An extended account of contract monitoring strategies as patterns of communication. - Cameron Swords; Amr Sabry; Sam Tobin-Hochstadt (J. Funct. Program., 2018)

Soft contract verification for higher-order stateful programs. - Phuc C. Nguyen; Thomas Gilray; Sam Tobin-Hochstadt; David Van Horn (Proc. ACM Program. Lang., 2018)

Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs. - Phuc C. Nguyen; Thomas Gilray; Sam Tobin-Hochstadt; David Van Horn (PLDI, 2019)

Rebuilding racket on chez scheme (experience report). - Matthew Flatt; Caner Derici; R. Kent Dybvig; Andrew W. Keep; Gustavo E. Massaccesi; Sarah Spall; Sam Tobin-Hochstadt; Jon Zeppieri (Proc. ACM Program. Lang., 2019)

From high-level inference algorithms to efficient code. - Rajan Walia; Praveen Narayanan; Jacques Carette; Sam Tobin-Hochstadt; Chung-chieh Shan (Proc. ACM Program. Lang., 2019)

Build scripts with perfect dependencies. - Sarah Spall; Neil Mitchell; Sam Tobin-Hochstadt (Proc. ACM Program. Lang., 2020)

Corpse reviver: sound and efficient gradual typing via contract verification. - Cameron Moy; Phuc C. Nguyen; Sam Tobin-Hochstadt; David Van Horn (Proc. ACM Program. Lang., 2021)

Forward build systems, formally. - Sarah Spall; Neil Mitchell; Sam Tobin-Hochstadt (CPP, 2022)

Type Checking Extracted Methods. - Yuquan Fu; Sam Tobin-Hochstadt (Art Sci. Eng. Program., 2022)

Sham: A DSL for Fast DSLs. - Rajan Walia; Chung-chieh Shan; Sam Tobin-Hochstadt (Art Sci. Eng. Program., 2022)

Rhombus: A New Spin on Macros without All the Parentheses. - Matthew Flatt; Taylor Allred; Nia Angle; Stephen De Gabrielle; Robert Bruce Findler; Jack Firth; Kiran Gopinathan; Ben Greenman; Siddhartha Kasivajhula; Alex Knauth; Jay A. McCarthy; Sam Phillips; et al. (Proc. ACM Program. Lang., 2023)

Garbage Collection for Mostly Serialized Heaps. - Chaitanya S. Koparkar; Vidush Singhal; Aditya Gupta; Mike Rainey; Michael Vollmer 003; Artem Pelenitsyn; Sam Tobin-Hochstadt; Milind Kulkarni 001; Ryan R. Newton (ISMM, 2024)