default search action
Sam Tobin-Hochstadt
Person information
- affiliation: Indiana University, School of Informatics & Computing, Bloomington, IN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c33]Chaitanya S. Koparkar, Vidush Singhal, Aditya Gupta, Mike Rainey, Michael Vollmer, Artem Pelenitsyn, Sam Tobin-Hochstadt, Milind Kulkarni, Ryan R. Newton:
Garbage Collection for Mostly Serialized Heaps. ISMM 2024: 1-14 - 2023
- [j12]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, Sorawee Porncharoenwase, Jens Axel Søgaard, Sam Tobin-Hochstadt:
Rhombus: A New Spin on Macros without All the Parentheses. Proc. ACM Program. Lang. 7(OOPSLA2): 574-603 (2023) - 2022
- [j11]Rajan Walia, Chung-chieh Shan, Sam Tobin-Hochstadt:
Sham: A DSL for Fast DSLs. Art Sci. Eng. Program. 6(1): 4 (2022) - [j10]Yuquan Fu, Sam Tobin-Hochstadt:
Type Checking Extracted Methods. Art Sci. Eng. Program. 6(2): 6 (2022) - [c32]Sarah Spall, Neil Mitchell, Sam Tobin-Hochstadt:
Forward build systems, formally. CPP 2022: 130-142 - [i16]Sarah Spall, Neil Mitchell, Sam Tobin-Hochstadt:
Forward Build Systems, Formally. CoRR abs/2202.05328 (2022) - 2021
- [j9]Cameron Moy, Phuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn:
Corpse reviver: sound and efficient gradual typing via contract verification. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - 2020
- [j8]Sarah Spall, Neil Mitchell, Sam Tobin-Hochstadt:
Build scripts with perfect dependencies. Proc. ACM Program. Lang. 4(OOPSLA): 169:1-169:28 (2020) - [i15]Rajan Walia, Chung-chieh Shan, Sam Tobin-Hochstadt:
Sham: A DSL for Fast DSLs. CoRR abs/2005.09028 (2020) - [i14]Cameron Moy, Phuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn:
Corpse Reviver: Sound and Efficient Gradual Typing via Contract Verification. CoRR abs/2007.12630 (2020) - [i13]Sarah Spall, Neil Mitchell, Sam Tobin-Hochstadt:
Build Scripts with Perfect Dependencies. CoRR abs/2007.12737 (2020) - [i12]Yuquan Fu, Sam Tobin-Hochstadt:
Type checking extracted methods. CoRR abs/2010.03608 (2020)
2010 – 2019
- 2019
- [j7]Matthew Flatt, Caner Derici, R. Kent Dybvig, Andrew W. Keep, Gustavo E. Massaccesi, Sarah Spall, Sam Tobin-Hochstadt, Jon Zeppieri:
Rebuilding racket on chez scheme (experience report). Proc. ACM Program. Lang. 3(ICFP): 78:1-78:15 (2019) - [j6]Rajan Walia, Praveen Narayanan, Jacques Carette, Sam Tobin-Hochstadt, Chung-chieh Shan:
From high-level inference algorithms to efficient code. Proc. ACM Program. Lang. 3(ICFP): 98:1-98:30 (2019) - [c31]Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn:
Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs. PLDI 2019: 845-859 - 2018
- [j5]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi, Eli Barzilay, Jay A. McCarthy, Sam Tobin-Hochstadt:
A programmable programming language. Commun. ACM 61(3): 62-71 (2018) - [j4]Cameron Swords, Amr Sabry, Sam Tobin-Hochstadt:
An extended account of contract monitoring strategies as patterns of communication. J. Funct. Program. 28: e4 (2018) - [j3]Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn:
Soft contract verification for higher-order stateful programs. Proc. ACM Program. Lang. 2(POPL): 51:1-51:30 (2018) - [i11]Rajan Walia, Jacques Carette, Praveen Narayanan, Chung-chieh Shan, Sam Tobin-Hochstadt:
Efficient compilation of array probabilistic programs. CoRR abs/1805.06562 (2018) - [i10]Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn:
Size-Change Termination as a Contract. CoRR abs/1808.02101 (2018) - [i9]Ambrose Bonnaire-Sergeant, Rowan Davies, Sam Tobin-Hochstadt:
Practical Optional Types for Clojure. CoRR abs/1812.03571 (2018) - 2017
- [j2]Phuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn:
Higher order symbolic execution for contract verification and refutation. J. Funct. Program. 27: e3 (2017) - [j1]Spenser Bauman, Carl Friedrich Bolz-Tereick, Jeremy G. Siek, Sam Tobin-Hochstadt:
Sound gradual typing: only mostly dead. Proc. ACM Program. Lang. 1(OOPSLA): 54:1-54:24 (2017) - [c30]Michael Vollmer, Sarah Spall, Buddhika Chamith, Laith Sakka, Chaitanya Koparkar, Milind Kulkarni, Sam Tobin-Hochstadt, Ryan Newton:
Compiling Tree Transforms to Operate on Packed Representations. ECOOP 2017: 26:1-26:29 - [c29]Sam Tobin-Hochstadt, Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Ben Greenman, Andrew M. Kent, Vincent St-Amour, T. Stephen Strickland, Asumu Takikawa:
Migratory Typing: Ten Years Later. SNAPL 2017: 17:1-17:17 - [i8]Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn:
Soft Contract Verification for Higher-Order Stateful Programs. CoRR abs/1711.03620 (2017) - 2016
- [c28]Jeremy G. Siek, Sam Tobin-Hochstadt:
The Recursive Union of Some Gradual Types. A List of Successes That Can Change the World 2016: 388-410 - [c27]Ambrose Bonnaire-Sergeant, Rowan Davies, Sam Tobin-Hochstadt:
Practical Optional Types for Clojure. ESOP 2016: 68-94 - [c26]Andrew M. Kent, David Kempe, Sam Tobin-Hochstadt:
Occurrence typing modulo theories. PLDI 2016: 296-309 - [c25]Ryan R. Newton, Ömer S. Agacan, Peter P. Fogg, Sam Tobin-Hochstadt:
Parallel type-checking with haskell using saturating LVars and stream generators. PPoPP 2016: 6:1-6:12 - 2015
- [c24]Asumu Takikawa, Daniel Feltey, Earl Dean, Matthew Flatt, Robert Bruce Findler, Sam Tobin-Hochstadt, Matthias Felleisen:
Towards Practical Gradual Typing. ECOOP 2015: 4-27 - [c23]Jeremy G. Siek, Michael M. Vitousek, Matteo Cimini, Sam Tobin-Hochstadt, Ronald Garcia:
Monotonic References for Efficient Gradual Typing. ESOP 2015: 432-456 - [c22]Spenser Bauman, Carl Friedrich Bolz, Robert Hirschfeld, Vasily Kirilichev, Tobias Pape, Jeremy G. Siek, Sam Tobin-Hochstadt:
Pycket: a tracing JIT for a functional language. ICFP 2015: 22-34 - [c21]Cameron Swords, Amr Sabry, Sam Tobin-Hochstadt:
Expressing contract monitors as patterns of communication. ICFP 2015: 387-399 - [c20]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi, Eli Barzilay, Jay A. McCarthy, Sam Tobin-Hochstadt:
The Racket Manifesto. SNAPL 2015: 113-128 - [i7]Phuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn:
Higher-order symbolic execution for contract verification and refutation. CoRR abs/1507.04817 (2015) - [i6]Andrew M. Kent, David Kempe, Sam Tobin-Hochstadt:
Occurrence Typing Modulo Theories. CoRR abs/1511.07033 (2015) - 2014
- [c19]Tony Garnock-Jones, Sam Tobin-Hochstadt, Matthias Felleisen:
The Network as a Language Construct. ESOP 2014: 473-492 - [c18]Phuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn:
Soft contract verification. ICFP 2014: 139-152 - [c17]Lindsey Kuper, Aaron Todd, Sam Tobin-Hochstadt, Ryan R. Newton:
Taming the parallel effect zoo: extensible deterministic parallelism with LVish. PLDI 2014: 2-14 - [e1]Sam Tobin-Hochstadt:
Proceedings of the 26th 2014 International Symposium on Implementation and Application of Functional Languages, IFL '14, Boston, MA, USA, October 1-3, 2014. ACM 2014, ISBN 978-1-4503-3284-2 [contents] - 2013
- [c16]Sam Tobin-Hochstadt:
Tutorial: Typed Racket. ELS 2013: 26 - [c15]Asumu Takikawa, T. Stephen Strickland, Sam Tobin-Hochstadt:
Constraining Delimited Control with Contracts. ESOP 2013: 229-248 - [c14]Sam Tobin-Hochstadt, David Van Horn:
From Principles to Practice with Class in the First Year. TFPIE 2013: 1-15 - [i5]Phuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn:
Static Contract Checking for Scripting Languages. CoRR abs/1307.6239 (2013) - 2012
- [c13]Christos Dimoulas, Sam Tobin-Hochstadt, Matthias Felleisen:
Complete Monitors for Behavioral Contracts. ESOP 2012: 214-233 - [c12]Vincent St-Amour, Sam Tobin-Hochstadt, Matthias Felleisen:
Optimization coaching: optimizers learn to communicate with programmers. OOPSLA 2012: 163-178 - [c11]Sam Tobin-Hochstadt, David Van Horn:
Higher-order symbolic execution via contracts. OOPSLA 2012: 537-554 - [c10]Asumu Takikawa, T. Stephen Strickland, Christos Dimoulas, Sam Tobin-Hochstadt, Matthias Felleisen:
Gradual typing for first-class classes. OOPSLA 2012: 793-810 - [c9]T. Stephen Strickland, Sam Tobin-Hochstadt, Robert Bruce Findler, Matthew Flatt:
Chaperones and impersonators: run-time support for reasonable interposition. OOPSLA 2012: 943-962 - [c8]Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Flatt, Matthias Felleisen:
Typing the Numeric Tower. PADL 2012: 289-303 - [c7]Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay A. McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, Robert Bruce Findler:
Run your research: on the effectiveness of lightweight mechanization. POPL 2012: 285-296 - 2011
- [c6]Sam Tobin-Hochstadt, Vincent St-Amour, Ryan Culpepper, Matthew Flatt, Matthias Felleisen:
Languages as libraries. PLDI 2011: 132-141 - [i4]Sam Tobin-Hochstadt, David Van Horn:
Modular Analysis via Specifications as Values. CoRR abs/1103.1362 (2011) - [i3]Sam Tobin-Hochstadt, David Van Horn:
Semantic Solutions to Program Analysis Problems. CoRR abs/1105.0106 (2011) - [i2]Sam Tobin-Hochstadt, Matthias Felleisen:
The Design and Implementation of Typed Scheme: From Scripts to Programs. CoRR abs/1106.2575 (2011) - [i1]Sam Tobin-Hochstadt:
Extensible Pattern Matching in an Extensible Language. CoRR abs/1106.2578 (2011) - 2010
- [c5]Sam Tobin-Hochstadt, Matthias Felleisen:
Logical types for untyped languages. ICFP 2010: 117-128
2000 – 2009
- 2009
- [c4]Sam Tobin-Hochstadt, Robert Bruce Findler:
Cycles without pollution: a gradual typing poem. STOP@ECOOP 2009: 47-57 - [c3]T. Stephen Strickland, Sam Tobin-Hochstadt, Matthias Felleisen:
Practical Variable-Arity Polymorphism. ESOP 2009: 32-46 - 2008
- [c2]Sam Tobin-Hochstadt, Matthias Felleisen:
The design and implementation of typed scheme. POPL 2008: 395-406 - 2006
- [c1]Sam Tobin-Hochstadt, Matthias Felleisen:
Interlanguage migration: from scripts to programs. OOPSLA Companion 2006: 964-974
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint