{"id":13941151,"url":"https://github.com/samth/gradual-typing-bib","last_synced_at":"2026-01-27T17:37:31.952Z","repository":{"id":10415166,"uuid":"12573177","full_name":"samth/gradual-typing-bib","owner":"samth","description":"A bibliography on Gradual Typing","archived":false,"fork":false,"pushed_at":"2023-12-24T02:47:01.000Z","size":377,"stargazers_count":246,"open_issues_count":0,"forks_count":22,"subscribers_count":25,"default_branch":"master","last_synced_at":"2024-05-23T04:48:39.082Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"http://samth.github.io/gradual-typing-bib/","language":"Racket","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/samth.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null}},"created_at":"2013-09-03T19:45:29.000Z","updated_at":"2024-03-31T09:05:15.000Z","dependencies_parsed_at":"2023-12-24T03:24:12.829Z","dependency_job_id":"0a99bb24-148d-4cd6-9ed0-fba81fe3067c","html_url":"https://github.com/samth/gradual-typing-bib","commit_stats":{"total_commits":145,"total_committers":22,"mean_commits":6.590909090909091,"dds":0.6137931034482759,"last_synced_commit":"044828e011c1e5efaf6ba74ee1541a978393ad24"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samth%2Fgradual-typing-bib","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samth%2Fgradual-typing-bib/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samth%2Fgradual-typing-bib/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samth%2Fgradual-typing-bib/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/samth","download_url":"https://codeload.github.com/samth/gradual-typing-bib/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245458729,"owners_count":20618697,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-08-08T02:01:12.297Z","updated_at":"2026-01-27T17:37:31.920Z","avatar_url":"https://github.com/samth.png","language":"Racket","funding_links":[],"categories":["Racket"],"sub_categories":[],"readme":"This bibliography attempts to cover all of the literature on _gradual typing_, defined as safe interoperability between typed and untyped portions of a single program. It begins with the original work on gradual typing, which was independently presented by four sets of authors in between September 2006 and January 2007, and then covers the extensive subsequent literature, both theoretical and practical.\n\nThe latter sections cover related work. First, early work on safe interoperation, such as the work on contracts. Second, work on type systems (broadly defined) designed to work with existing untyped languages, including recent work done in the context of gradual typing. Work on type system design that also considers issues of interoperability with untyped programs appears in the main section of the bibliography.\n\n---\n\nFor papers written in [Scribble](http://docs.racket-lang.org/scribble/), this\nbibliography can be installed as a package and referenced directly from the\npaper. Use the following command to install:\n\n`raco pkg install git://github.com/samth/gradual-typing-bib`\n\nSample use:\n\n```\n#lang scribble/base\n\n@(require gradual-typing-bib\n          scriblib/autobib)\n\n@(define-cite ~cite citet generate-bibliography)\n\nOriginal gradual typing papers\n@~cite[st-sfp-2006 thf-dls-2006 mf-toplas-2007 gktff-sfp-2006].\n\n@generate-bibliography[]\n```\n\n# Gradual Typing\n\n## The original papers\n\nThese four papers all independently introduce the fundamental idea of gradual typing: dynamic enforcement of types using contracts.\n\n##### Gradual typing for functional languages.\n\nJeremy G. Siek and Walid Taha.  \nIn Seventh Workshop on Scheme and Functional Programming, University of Chicago Technical Report TR-2006-06, pages 81–92, September 2006.  \nhttp://ecee.colorado.edu/~siek/pubs/pubs/2006/siek06_gradual.pdf\n\n##### Interlanguage migration: from scripts to programs.\n\nSam Tobin-Hochstadt and Matthias Felleisen.  \nIn OOPSLA ’06: Companion to the 21st annual ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications, pages 964–974. ACM Press, 2006.  \nhttp://www.ccs.neu.edu/racket/pubs/dls06-tf.pdf\n\n##### Operational semantics for multi-language programs\n\nJacob Matthews and Robert Bruce Findler  \nPOPL 2007  \nSee subsequent version in TOPLAS 2009.  \nhttp://www.eecs.northwestern.edu/~robby/pubs/papers/toplas09-mf.pdf\n\n##### Sage: Hybrid Checking for Flexible Specifications\n\nJessica Gronski, Kenneth Knowles, Aaron Tomb, Stephen N. Freund, and Cormac Flanagan\nIn Seventh Workshop on Scheme and Functional Programming, University of Chicago Technical Report TR-2006-06, pages 93-104, September 2006.  \nhttp://users.soe.ucsc.edu/~atomb/gronski06sage.pdf\n\n## Subsequent work\n\nEvery paper below here cites at least one of the 4 original papers.\n\n##### Sage: Unified Hybrid Checking for First-Class Types, General Refinement Types, and Dynamic. (extended report)\n\nKenneth Knowles, Aaron Tomb, Jessica Gronski, Stephen N. Freund, Cormac Flanagan.\nTechnical report, May 2007  \nhttp://sage.soe.ucsc.edu/sage-tr.pdf\n\n##### Space-efficient gradual typing.\n\nDavid Herman, Aaron Tomb, and Cormac Flanagan.\nIn Proceedings of the Eighth Symposium on Trends in Functional Programming, TFP 2007, pages 1–18, 2008.\n(See subsequent journal version.)\n\n##### Gradual typing for objects.\n\nJeremy G. Siek and Walid Taha.  \nIn ECOOP 2007, volume 4609 of\nLCNS, pages 2–27. Springer Verlag, August 2007.  \nhttp://aszt.inf.elte.hu/~gsd/s/cikkek/concepts/2007/gradual-obj.pdf\n\n##### Advanced Macrology and the Implementation of Typed Scheme.\n\nRyan Culpepper, Sam Tobin-Hochstadt, and Matthew Flatt.  \nIn Proceedings of the 2007 Workshop on Scheme and Functional Programming, Universit́e Laval Technical Report DIUL-RT-0701, pages 1–13, 2007  \nhttp://www.ccs.neu.edu/racket/pubs/scheme2007-ctf.pdf\n\n##### Well-typed programs can’t be blamed\n\nPhilip Wadler and Robert Bruce Findler  \nIn Proceedings of the 2007 Workshop on Scheme and Functional Programming, Universit́e Laval Technical Report DIUL-RT-0701, pages 1–13, 2007  \nhttp://www.eecs.northwestern.edu/~robby/pubs/papers/scheme2007-wf.pdf\n\n##### Evolutionary Programming and Gradual Typing in ECMAScript 41\n\nLars T Hansen\nAdobe Systems Technical Report, November 2007  \nhttp://archives.ecma-international.org/2007/TG1/tc39-tg1-2007-045.pdf\n\n##### Status report: specifying JavaScript with ML\n\nDavid Herman, Cormac Flanagan\nProceedings of the 2007 workshop on Workshop on ML, Pages 47-52, 2007.  \nhttp://users.soe.ucsc.edu/~cormac/papers/ml07.pdf\n\n##### The design and implementation of Typed Scheme.\n\nSam Tobin-Hochstadt and Matthias Felleisen.  \nIn POPL ’08: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 395–406. ACM Press, 2008  \nhttp://www.ccs.neu.edu/racket/pubs/popl08-thf.pdf\n\n##### Safe Cross-Language Inheritance\n\nKathryn E. Gray  \nIn proceedings of ECOOP 2008  \nhttp://www.cl.cam.ac.uk/~keg29/inheritance-model/inheritance.pdf\n\n##### Gradual typing with unification-based inference\n\nJeremy G. Siek, Manish Vachharajani  \nDLS '08 Proceedings of the 2008 symposium on Dynamic languages, 2008  \nhttp://ecee.colorado.edu/~siek/dls08igtlc.pdf\n\n##### The Design and Implementation of Typed Scheme\n\nSam Tobin-Hochstadt and Matthias Felleisen.  \nTo appear in Higher-Order and Symbolic Computation.\n\n##### Well-typed programs can’t be blamed\n\nPhilip Wadler and Robert Bruce Findler  \nIn ESOP ’09: Proceedings of the Eighteenth European Symposium on Programming, volume 5502 of Lecture Notes in Computer Science, pages 1–16. Springer-Verlag, 2009.\n\n##### Exploring the Design Space of Higher-Order Casts\n\nJeremy Siek, Ronald Garcia, Walid Taha\nIn ESOP ’09: Proceedings of the Eighteenth European Symposium on Programming, volume 5502 of Lecture Notes in Computer Science, pages 17-31. Springer-Verlag, 2009.  \nhttp://ecee.colorado.edu/~siek/siek09esop.pdf\n\n##### A Model of Java/Scheme Interoperability\n\nKathryn E. Gray\nChapter of _Semantics Engineering with PLT Redex_\nEdited by Robert Bruce Findler, Matthew Flatt, and Matthias Felleisen. MIT Press 2009\n\n##### Operational semantics for multi-language programs\n\nJacob Matthews and Robert Bruce Findler  \nACM Transactions on Programming Languages and Systems, 31(3):1–44, 2009.  \nhttp://www.eecs.northwestern.edu/~robby/pubs/papers/toplas09-mf.pdf\n\n##### Gradual typing for Featherweight Java.\n\nLintaro Ina and Atsushi Igarashi.\nComputer Software, 26(2):18–40, 2009.\n\nIn Japanese:\nFeatherweight Java のための漸進的型付け\nhttps://www.jstage.jst.go.jp/article/jssst/26/2/26_2_2_18/_pdf\n\n##### Static type inference for Ruby\n\nMichael Furr, Jong-hoon (David) An, Jeffrey S. Foster, and Michael Hicks  \nIn SAC ’09: Proceedings of the 2009 ACM Symposium on Applied Computing, pages 1859–1866. ACM Press, 2009\n\n##### STOP ’09: Proceedings for the 1st workshop on Script to Program Evolution\n\nTobias Wrigstad, Nate Nystrom, and Jan Vitek, editors.  \nACM Press 2009\n\n###### From Soft Scheme to Typed Scheme: Experiences from 20 Years of Script Evolution, and Some Ideas on What Works (Talk)\n\nMatthias Felleisen\nInvited talk at STOP 2009\nhttp://www.ccs.neu.edu/home/matthias/Presentations/stop.html\n\n##### Towards gradual typing for generics\n\nLintaro Ina, Atsushi Igarashi  \nSTOP '09 Proceedings for the 1st workshop on Script to Program Evolution, 2009  \nSee subsequent version in OOPSLA 2011\n\n##### A theory of typed coercions and its applications\n\nNikhil Swamy, Michael Hicks, Gavin M. Bierman\nProceedings of the 14th ACM SIGPLAN international conference on Functional programming, Pages 329-340, 2009\n\n##### Threesomes, with and without blame\n\nJeremy G. Siek, Philip Wadler  \nSTOP '09 Proceedings for the 1st workshop on Script to Program Evolution, 2009  \nSee subsequent version in POPL 2010.\nhttp://homepages.inf.ed.ac.uk/wadler/papers/threesomes-stop/threesomes-stop.pdf\n\n##### Software Hardening: A Research Agenda\n\nWrigstad, Eugster, Field, Nystrom, Vitek  \nSTOP '09 Proceedings for the 1st workshop on Script to Program Evolution, 2009\n\n##### Cycles without pollution: a gradual typing poem.\n\nSam Tobin-Hochstadt and Robert Bruce Findler.  \nSTOP '09 Proceedings for the 1st workshop on Script to Program Evolution, 2009, pages 47–57\n\n##### Tests to the left of me, types to the right: how not to get stuck in the middle of a Ruby execution.\n\nMichael Furr, Jong-hoon (David) An, Jeffrey S. Foster, and Michael Hicks.  \nSTOP '09 Proceedings for the 1st workshop on Script to Program Evolution, 2009, pages 14–16.\n\n##### Thorn: Robust, Concurrent, Extensible Scripting on the JVM.\n\nBard Bloom, John Field, Nathaniel Nystrom, Johan Ostlund, Gregor Richards, Rok Strnisa, Jan Vitek, and Tobias Wrigstad.  \nIn OOPSLA, 2009.\n\n###### Of scripts and programs: tall tales, urban legends, and future prospects\n\nJan Vitek  \nInvited talk at DLS 2009\nhttp://dl.acm.org/citation.cfm?id=1640134.1640136\n\n##### Combining Static and Dynamic Typing in Ruby\n\nMichael Furr\nPh.D. Thesis, University of Maryland, 2009\n\n##### Extending Dylan’s Type System for Better Type Inference and Error Detection\n\nHannes Mehnert\nDiploma Thesis, Technische Universit ̈at Berlin, October 1, 2009\n\n##### Typed Scheme: From Scripts to Programs.\n\nSam Tobin-Hochstadt  \nPhD Dissertation, Northeastern University, January 2010.\n\n##### Integrating typed and untyped code in a scripting language.\n\nTobias Wrigstad, Francesco Zappa Nardelli, Sylvain Lebresne, Johan Ostlund, and Jan Vitek.  \nIn Symposium on Principles of Programming Languages, 2010.\n\n##### Threesomes, with and without blame.\n\nJeremy G. Siek and Philip Wadler.  \nIn Symposium on Principles of Programming Languages, 2010.\n\n##### Adding types to untyped languages\n\nMatthias Felleisen\nInvited talk at TLDI '10 Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation  \nhttp://dl.acm.org/citation.cfm?id=1708016.1708017\n\n##### Space-efficient gradual typing\n\nDavid Herman, Aaron Tomb, and Cormac Flanagan\nHigher-Order and Symbolic Computation, Vol. 23 No. 2, pages 167-189, 2010\n\n##### Adding dynamic types to C#.\n\nGavin Bierman, Erik Meijer, and Mads Torgersen.\nIn European Conference on Object-Oriented Programming, ECOOP’10. Springer-Verlag, 2010.\n\n##### Extending Dylan's type system for better type inference and error detection\n\nHannes Mehnert\nProceedings of the 2010 international conference on Lisp, Pages 1-10, 2010.\nhttps://doi.org/10.1145/1869643.1869645\n\n##### Interoperability in a Scripted World: Putting Inheritance and Prototypes Together\n\nKathryn E. Gray  \nFOOL 2010\n\n##### Blame for All.\n\nAmal Ahmed, Robert Bruce Findler, Jeremy G. Siek, and Philip Wadler.  \nIn Symposium on Principles of Programming Languages, January 2011.\nhttp://homepages.inf.ed.ac.uk/wadler/papers/blame-for-all/blame-for-all.pdf\n\n##### Proceedings of the Second Workshop on Script to Program Evolution.\n\nEdited by Robert Bruce Findler\nJanuary 2011\n\n##### Languages as Libraries\n\nSam Tobin-Hochstadt, Vincent St-Amour, Ryan Culpepper, Matthew Flatt, and Matthias Felleisen\nPLDI 2011\n\n##### Always-available static and dynamic feedback.\n\nM. Bayne, R. Cook, and M.D. Ernst.  \nIn International Conference on Software Engineering, 2011.\n\n##### Gradual typestate.\n\nRoger Wolff, Ronald Garcia, Éric Tanter, and Jonathan Aldrich.  \nIn European Conference on Object-Oriented Programming, ECOOP’11. Springer-Verlag, 2011.\nhttp://pleiad.dcc.uchile.cl/papers/2011/wolffAl-ecoop2011.pdf\n\n##### Gradual typing for generics.\n\nLintaro Ina and Atsushi Igarashi.  \nIn Proceedings of the 2011 ACM International conference on Object oriented programming systems languages and applications, OOPSLA ’11, 2011.\n\n##### The impact of optional type information on jit compilation of dynamically typed languages\n\nMason Chang, Bernd Mathiske, Edwin Smith, Avik Chaudhuri, Andreas Gal, Michael Bebenita, Christian Wimmer, Michael Franz\nProceedings of the 7th symposium on Dynamic languages, Pages 13-24, 2011\n\n##### Gradual Information Flow Typing\n\nTim Disney and Cormac Flanagan\nInternational Workshop on Scripts to Programs, 2011\n\n##### Language with a Pluggable Type System and Optional Runtime Monitoring of Type Errors\n\nJukka Lehtosalo and David J. Greaves\nInternational Workshop on Scripts to Programs, 2011\n\n##### Application optimization when using gradual typing\n\nEsteban Allende, Johan Fabry\nProceedings of the 6th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems, Article No. 3, 2011\n\n##### Foundations for Scripting Languages (Report from Dagstuhl Seminar 12011)\n\nEdited by Robert Hirschfeld, Shriram Krishnamurthi, and Jan Vitek\nhttp://www.cs.purdue.edu/homes/jv/pubs/dagstuhl12.pdf\n\n##### The ins and outs of gradual type inference.\n\nAseem Rastogi, Avik Chaudhuri, and Basil Hosmer.  \nIn Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL ’12, 2012.\n\n##### Complete Monitors for Behavioral Contracts.\n\nChristos Dimoulas, Sam Tobin-Hochstadt, and Matthias Felleisen.  \nEuropean Symposium on Programming (ESOP), March 2012.\n\n##### Gradual Ownership Types\n\nI. Sergey, D. Clarke\nIn ESOP 2012, LNCS, vol. 7211, pp. 579–599, 2012.\n\n##### JavaScript as an Embedded DSL\n\nGrzegorz Kossakowski, Nada Amin, Tiark Rompf, and Martin Odersky\nIn ESOP 2012, LNCS, vol. 7211, pp. 409–434, 2012.\n\n##### Practical Permissions for Race-Free Parallelism\n\nEdwin Westbrook, Jisheng Zhao, Zoran Budimli ́c, and Vivek Sarkar\nIn ESOP 2012, LNCS, vol. 7211, pp. 614–639, 2012.\n\n##### Modelyze: a Gradually Typed Host Language for Embedding Equation-Based Modeling Languages\n\nDavid Broman, Jeremy G. Siek\nEECS University of California at Berkeley Technical Report No. UCB/EECS-2012-173\n\n##### Type systems directed programming language evolution: overview and research trends\n\nJaime Niño  \nACM-SE '12 Proceedings of the 50th Annual Southeast Regional Conference\n\nA survey/overview paper\n\n##### Proceedings of the Third Workshop on Script to Program Evolution.\n\nEdited by Sam Tobin-Hochstadt  \nNU CCIS Technical Report NU-CCIS-12-02, June 2012.\n\n##### Towards Gradual Typing in Jython\n\nMichael M. Vitousek, Shashank Bharadwaj, Jeremy G. Siek  \nSTOP 2012\n\n##### Interpretations of the gradually-typed lambda calculus.\n\nJeremy G. Siek and Ronald Garcia.  \nIn Scheme and Functional Programming Workshop, 2012.\n\n##### Method Lookup Simulation with a Gradual Typing Language\n\nEsteban Allende, Johan Fabry\nIn 2012 31st International Conference of the Chilean Computer Science Society.\nhttps://doi.org/10.1109/SCCC.2012.7\n\n##### Gradual Typing for First-class Classes.\n\nAsumu Takikawa, T. Stephen Strickland, Christos Dimoulas, Sam Tobin-Hochstadt and Matthias Felleisen.  \nObject Oriented Programming, Systems, Languages and Applications (OOPSLA), October 2012.\n\n##### Chaperones and Impersonators: Runtime support for reasonable interposition\n\nT. Stephen Strickland, Sam Tobin-Hochstadt, Robert Bruce Findler and Matthew Flatt.  \nObject Oriented Programming, Systems, Languages and Applications (OOPSLA), October 2012.\n\n##### Optimizing Jython using invokedynamic and Gradual Typing\n\nShashank Bharadwaj.\nMaster's Thesis, Department of Electrical, Energy and Computer Engineering, University of Colorado 2012.\nhttps://scholar.colorado.edu/cgi/viewcontent.cgi?article=1056\u0026context=ecen_gradetds\n\n##### Gradual Typing for Mutable Objects\n\nJeremy G. Siek, Michael M. Vitousek, and Shashank Bharadwaj.  \nUnpublished manuscript, 2012.  \nhttp://ecee.colorado.edu/~siek/gtmo.pdf\n\n##### Constraining Delimited Control with Contracts\n\nAsumu Takikawa, T. Stephen Strickland, Sam Tobin-Hochstadt.  \nESOP 2013.\n\n##### The Blame Theorem for a Linear Lambda Calculus with Type Dynamic\n\nLuminous Fennell,Peter Thiemann\nTrends in Functional Programming, LNCS Volume 7829, 2013, pp 37-52\n\n##### The Ruby Type Checker\n\nBrianna M. Ren, John Toman, T. Stephen Strickland, Jeffrey S. Foster  \nOOPS 2013\n\n##### A Gradual Polymorphic Type System with Subtyping for Prolog\n\nSpyros Hadjichristodoulou and David Warren\nWorkshop on Logic-based Programming Environments (WLPE 2012)\n\n##### Gradual typing for Smalltalk\n\nEsteban Allende, Oscar Callaú, Johan Fabry, Éric Tanter, and Marcus Denker.  \nScience of Computer Programming (2013).\nhttp://pleiad.dcc.uchile.cl/papers/2013/allendeAl-scp2013.pdf\n\n##### Cast Insertion Strategies for Gradually-Typed Objects\n\nEsteban Allende, Johan Fabry, Éric Tanter\nProceedings of the 9th ACM Dynamic Languages Symposium (DLS 2013), Indianapolis, IN, USA, October 2013, ACM Press\nhttp://pleiad.dcc.uchile.cl/papers/2013/allendeAl-dls2013.pdf\n\n##### Gradual Security Typing with References\n\nLuminous Fennell, Peter Thiemann.\nComputer Security Foundations Symposium (CSF) 2013, IEEE, 224-239.\nhttps://doi.org/10.1109/CSF.2013.22\n\n##### Calculating threesomes, with blame\n\nRonald Garcia.\nICFP 2013, ACM, New York, NY, USA, 417-428.\nhttps://doi.org/10.1145/2500365.2500603\n\n##### Foundations of Typestate-Oriented Programming.\n\nRonald Garcia, Éric Tanter, Roger Wolff, Jonathan Aldrich:\nACM TOPLAS 36(4): 12:1-12:44 (2014)\nhttp://pleiad.dcc.uchile.cl/papers/2014/garciaAl-toplas2014.pdf\n\n##### Deriving interpretations of the gradually-typed lambda calculus\n\nÁlvaro García-Pérez, Pablo Nogueira, Ilya Sergey.\nPEPM 2014, ACM, 157-168.\nhttps://doi.org/10.1145/2543728.2543742\n\n##### The Problem of Structural Type Tests in a Gradual-Typed Language\n\nJohn Tang Boyland.\nFOOL 2014.\nhttp://www.cs.uwm.edu/faculty/boyland/papers/type-test.pdf\n\n##### Gradual Typing for Annotated Type Systems\n\nPeter Thiemann, Luminous Fennell\nESOP 2014, LNCS vol. 8410, Springer.\nhttps://doi.org/10.1007/978-3-642-54833-8_4\n\n##### A Theory of Gradual Effect Systems\n\nFelipe Bañados Schwerter, Ronald Garcia, Éric Tanter.\nInternational Conference on Functional Programming 2014.\nhttp://pleiad.dcc.uchile.cl/papers/2014/banadosAl-icfp2014.pdf\n\n##### Design and Evaluation of Gradual Typing for Python\n\nMichael M. Vitousek, Andrew Kent, Jeremy G. Siek, Jim Baker\nProceedings of the 10th ACM Dynamic Languages Symposium (DLS 2014), Portland, OR, USA, October 2014, ACM Press\n\n##### Understanding TypeScript\n\nGavin Bierman, Martín Abadi, Mads Torgersen.\nECOOP 2014, LNCS vol 8586, Springer.\nhttps://doi.org/10.1007/978-3-662-44202-9_11\n\n##### Gradual typing embedded securely in JavaScript\n\nNikhil Swamy, Cédric Fournet, Aseem Rastogi, Karthikeyan Bhargavan, Juan Chen, Pierre-Yves Strub, Gavin Bierman\nPOPL 2014, ACM, New York, NY, USA 425-437.\nhttps://doi.org/10.1145/2535838.2535889\n\n##### JavaScript with Blame\n\nJakub Zalewski\nMaster's Thesis, School of Informatics, University of Edinburgh.\nhttp://project-archive.inf.ed.ac.uk/msc/20141715/msc_proj.pdf\n\n##### Confined Gradual Typing\n\nEsteban Allende, Johan Fabry, Ronald Garcia, Éric Tanter.\nOOPSLA 2014\nhttp://pleiad.dcc.uchile.cl/papers/2014/allendeAl-oopsla2014.pdf\n\n##### Gradual evolution\n\nNeil Savage\nCommunications of the ACM, vol. 57 issue 10, 2014.\nhttps://doi.org/10.1145/2659764\n\n##### Safe \u0026 Efficient Gradual Typing for TypeScript\n\nAseem Rastogi, Nikhil Swamy, Cédric Fournet, Gavin Bierman, Panagiotis Vekris.\nIn Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '15). ACM, New York, NY, USA, 167-180.\nhttps://doi.org/10.1145/2775051.2676971\n\n##### Principal Type Schemes for Gradual Programs\n\nRonald Garcia, Matteo Cimini.\nPOPL 2015, ACM, New York, NY, USA, 303-315.\nhttps://doi.org/10.1145/2775051.2676992\n\n##### Monotonic References for Efficient Gradual Typing\n\nJeremy Siek, Michael M. Vitousek, Matteo Cimmini, Sam Tobin-Hochstadt, Ronald Garcia\nESOP 2015, LNCS Volume 9032, pp 432-456\n\n##### EMPIRICALLY-DRIVEN DESIGN AND IMPLEMENTATION OF GRADUALTALK\n\nOSCAR EDWIN ALVAREZ CALLAU ́\nPh.D. Thesis, University of Chile, 2015.\nhttp://repositorio.uchile.cl/bitstream/handle/2250/132889/Empirically-driven-design-and-implementation-of-Gradualtalk.pdf?sequence=1\n\n##### Towards Practical Gradual Typing\n\nAsumu Takikawa, Daniel Feltey, Earl Dean, Robert Bruce Findler, Matthew Flatt, Sam Tobin-Hochstadt, Matthias Felleisen\nECOOP 2015, LIPIcs Volume 37, pp 4-27\n\n##### Concrete Types for TypeScript\n\nGregor Richards, Francesco Zappa Nardelli, Jan Vitek\nECOOP 2015, LIPIcs Volume 37, pp 76-100\n\n##### Refined Criteria for Gradual Typing\n\nJeremy G. Siek, Michael M. Vitousek, Matteo Cimini, John Tang Boyland\nSNAPL 2015, LIPIcs Volume 32, pp 274-293\nhttp://drops.dagstuhl.de/opus/volltexte/2015/5031/\n\n##### Customizable Gradual Polymorphic Effects for Scala\n\nMatías Toro, Éric Tanter\nIn Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (pp. 935-953)\nhttp://pleiad.dcc.uchile.cl/papers/2015/toroTanter-oopsla2015.pdf\n\n##### Gradual Certified Programming in Coq\n\nÉric Tanter, Nicolas Tabareau\nProceedings of the 11th ACM Dynamic Languages Symposium (DLS 2015), pp.26-40, Pittsburgh, PA, USA, October 2015, ACM Press\nhttp://pleiad.dcc.uchile.cl/papers/2015/tanterTabareau-dls2015.pdf\n\n##### A Complement to Blame\n\nPhilip Wadler\nSNAPL 2015, LIPIcs vol. 32, 309-320.\nhttp://drops.dagstuhl.de/opus/volltexte/2015/5033/\n\n##### A formalization of typed lua\n\nAndré Murbach Maidl, Fabio Mascarenhas, Roberto Ierusalimschy\nDLS 2015, ACM, Pages 13-25.\nhttps://doi.org/10.1145/2816707.2816709\n\n##### Shifting the Blame\n\nT. Sekiyama, S. Ueda, A. Igarashi.\nAPLAS 2015. LNCS, vol 9458. Springer.\nhttps://doi.org/10.1007/978-3-319-26529-2_11\n\n##### LJGS: Gradual Security Types for Object-Oriented Languages\n\nLuminous Fennell and Peter Thiemann.\nECOOP 2016, Leibniz International Proceedings in Informatics (LIPIcs), Pages 9:1--9:26.\nhttp://drops.dagstuhl.de/opus/volltexte/2016/6103/\n\n##### Gradual type-and-effect systems\n\nFelipe Bañados Schwerter, Ronald Garcia, Éric Tanter.\nJournal of Functional Programming, vol. 26, 2016.\nhttps://doi.org/10.1017/S0956796816000162\n\n##### Abstracting Gradual Typing\n\nRonald Garcia, Alison M. Clark, Éric Tanter\nPOPL 2016, ACM, New York, NY, USA, 429-442.\nhttp://dl.acm.org/citation.cfm?id=2837670\nhttp://pleiad.dcc.uchile.cl/papers/2016/garciaAl-popl2016.pdf\n\n##### The Gradualizer: a methodology and algorithm for generating gradual type systems\n\nMatteo Cimini, Jeremy Siek\nPOPL 2016, ACM, New York, NY, USA, 443-455.\nhttp://cimini.info/publications/Gradualizer_Draft.pdf\n\n##### Is Sound Gradual Typing Dead?\n\nAsumu Takikawa, Daniel Feltey, Ben Greenman, Max New, Jan Vitek, Matthias Felleisen\nPOPL 2016, ACM, New York, NY, USA, 456-468.\nhttp://www.ccs.neu.edu/racket/pubs/popl16-tfgnvf.pdf\n\n##### The Design, Implementation, And Evaluation Of A Gradual Type System For Dynamic Class Composition\n\nAsumu Takikawa\nPh.D. Thesis, Northeastern University\nApril 2016\nhttp://hdl.handle.net/2047/D20213172\n\n##### Blame Tracking at Higher Fidelity\n\nJakub Zalewski\nMaster of Science by Research, School of Informatics, University of Edinburgh.\nhttps://project-archive.inf.ed.ac.uk/msc/20162082/msc_proj.pdf\n\n##### Gradual Pluggable Typing in Java\n\nDaniel Brotherston.\nMaster's Thesis, University of Waterloo.\nhttps://uwspace.uwaterloo.ca/handle/10012/10409\n\n##### Type Soundness in the Dart Programming Language\n\nFabio Strocco.\nPh.D. Thesis, Aarhus University, 2016.\nhttps://pure.au.dk/portal/files/108950717/Thesis_Fabio_Strocco.pdf\n\n##### Side effects take the blame\n\nFelipe Bañados Schwerter\nSLE 2016, ACM, Pages 195-206.\nhttps://doi.org/10.1145/2997364.2997381\n\n##### The recursive union of some gradual types\n\nJeremy G. Siek, Sam Tobin-Hochstadt.\nA List of Successes That Can Change the World (Wadler Fest), LNCS volume 9600, Springer, 2016, 388-410.\nhttps://doi.org/10.1007/978-3-319-30936-1_21\n\n##### Blame and coercion: Together again for the first time\n\nJeremy G. Siek, Peter Thiemann, Philip Wadler.\nPLDI 2016, ACM, New York, NY, USA, 425-435.\nhttps://doi.org/10.1145/2737924.2737968\n\n##### Partial Type Equivalences for Verified Dependent Interoperability\n\nPierre-Evariste Dagand, Nicolas Tabareau, Éric Tanter\nICFP 2016, ACM.\nhttp://pleiad.dcc.uchile.cl/papers/2016/dagandAl-icfp2016.pdf\nhttp://dx.doi.org/10.1145/2951913.2951933\n\n##### ALGT A Framework to Describe and Gradualize Programming Languages\n\nPieter Vander Vennet.\nMaster's Dissertation, Ghent University.\nhttp://lib.ugent.be/fulltxt/RUG01/002/376/271/RUG01-002376271_2017_0001_AC.pdf\n\n##### Theorems for free for free: Parametricity, with and without types\n\nAmal Ahmed, Dustin Jamner, Jeremy G. Siek, Philip Wadler\nICFP 2017, ACM, New York, NY, USA\nhttps://doi.org/10.1145/3110283\n\n##### Gradual Security Typing\n\nLuminous Fennell\nPh.D. Thesis, University of Freiburg\nOctober 2017\nhttps://d-nb.info/1174142367/34\n\n##### Gradual session types\n\nAtsushi Igarashi, Peter Thiemann, Vasco T. Vasconcelos, Philip Wadler\nICFP 2017, ACM, New York, NY, USA\nhttps://doi.org/10.1145/3110282\n\n##### On polymorphic gradual typing\n\nYuu Igarashi, Taro Sekiyama, Atsushi Igarashi\nICFP 2017, ACM, New York, NY, USA\nhttps://doi.org/10.1145/3110284\n\n##### Gradual typing with union and intersection types\n\nGiuseppe Castagna, Victor Lanvin\nICFP 2017, ACM, New York, NY, USA\nhttps://doi.org/10.1145/3110285\n\n##### Sound gradual typing: Only mostly dead\n\nSpenser A. Bauman, Sam Tobin-Hochstadt, Jeremy G. Siek, Carl Friedrich Bolz-Tereick\nOOPSLA 2017, ACM, New York, NY, USA\nhttps://doi.org/10.1145/3133878\n\n##### The VM already knew that: leveraging compile-time knowledge to optimize gradual typing\n\nGregor Richards, Ellen Arteca, Alexi Turcotte\nOOPSLA 2017, ACM, New York, NY, USA\nhttps://doi.org/10.1145/3133879\n\n##### Sound gradual typing is nominally alive and well\n\nFabian Muehlboeck, Ross Tate\nOOPSLA 2017, ACM, New York, NY, USA\nhttps://doi.org/10.1145/3133880\n\n##### A Gradual Interpretation of Union Types\n\nM. Toro, É Tanter.\nSAS 2017, LNCS vol. 10422, Springer.\nhttps://doi.org/10.1007/978-3-319-66706-5_19\n\n##### Mixed Messages: Measuring Conformance and Non-Interference in TypeScript\n\nJack Williams, J. Garrett Morris, Philip Wadler, Jakub Zalewski\nECOOP 2017, Leibniz International Proceedings in Informatics (LIPIcs), pages 28:1--28:29.\nhttp://drops.dagstuhl.de/opus/volltexte/2017/7264/\n\n##### Migratory Typing: Ten Years Later\n\nSam Tobin-Hochstadt, Matthias Felleisen, Robert Findler, Matthew Flatt, Ben Greenman, Andrew M. Kent, Vincent St-Amour, T. Stephen Strickland, Asumu Takikawa\nSNAPL 2017, Leibniz International Proceedings in Informatics (LIPIcs), pages 17:1--17:17.\nhttp://drops.dagstuhl.de/opus/volltexte/2017/7120/\n\n##### Big types in little runtime\n\nMichael M. Vitousek, Cameron Swords, and Jeremy G. Siek.\nPOPL 2017, ACM, New York, NY, USA, 762-774.\nhttps://doi.org/10.1145/3093333.3009849\n\n##### Gradual refinement types\n\nNico Lehmann, Éric Tanter.\nPOPL 2017, ACM, New York, NY, USA, 775-788.\nhttps://doi.org/10.1145/3093333.3009856\n\n##### Automatically generating the dynamic semantics of gradually typed languages\n\nMatteo Cimini, Jeremy G. Siek.\nPOPL 2017, ACM, New York, NY, USA, 789-803.\nhttps://doi.org/10.1145/3093333.3009863\n\n##### Sums of uncertainty: refinements go gradual\n\nKhurram A. Jafery, Joshua Dunfield.\nPOPL 2017, ACM, New York, NY, USA, 804-817.\nhttps://doi.org/10.1145/3093333.3009865\n\n##### Hazelnut: a bidirectionally typed structure editor calculus\n\nCyrus Omar, Ian Voysey, Michael Hilton, Jonathan Aldrich, Matthew A. Hammer.\nPOPL 2017, ACM, New York, NY, USA, 86-99.\nhttps://doi.org/10.1145/3009837.3009900\n\n##### Foundations of Dependent Interoperability\n\nPierre-Évariste Dagand, Nicolas Tabareau, Éric Tanter\nJFP 2018, Cambridge Univ. Press.\nhttp://pleiad.dcc.uchile.cl/papers/2018/dagandAl-jfp2018.pdf\nhttp://dx.doi.org/10.1017/S0956796818000011\n\n##### Gradually typed symbolic expressions\n\nDavid Broman, Jeremy G. Siek\nPEPM 2018, ACM, New York, NY, USA, 15–29.\nhttps://doi.org/10.1145/3162068\nhttps://people.kth.se/~dbro/papers/broman-siek-2018-gradually-typed-symbols.pdf\n\n##### Consistent Subtyping for All\n\nNingning Xie, Xuan Bi, Bruno C. d. S. Oliveira.\nESOP 2018, LNCS vol 10801, Springer.\nhttps://doi.org/10.1007/978-3-319-89884-1_1\n\n##### On the Cost of Type-Tag Soundness\n\nBen Greenman, Zeina Migeed.\nPEPM 2018, ACM, New York, NY, USA.\nhttps://doi.org/10.1145/3162066\n\n##### Graduality from embedding-projection pairs\n\nMax S. New, Amal Ahmed.\nICFP 2018, ACM, New York, NY, USA.\nhttps://doi.org/10.1145/3236768\n\n##### A spectrum of type soundness and performance\n\nBen Greenman, Matthias Felleisen.\nICFP 2018, ACM, New York, NY, USA.\nhttps://doi.org/10.1145/3236766\n\n##### Casts and costs: harmonizing safety and performance in gradual typing\n\nJohn Peter Campora, Sheng Chen, Eric Walkingshaw.\nICFP 2018, ACM, New York, NY, USA.\nhttps://doi.org/10.1145/3236793\n\n##### Migrating gradual types\n\nJohn Peter Campora, Sheng Chen, Martin Erwig, Eric Walkingshaw.\nPOPL 2018, ACM, New York, NY, USA.\nhttps://doi.org/10.1145/3158103\n\n##### Gradual Program Verification\n\nJohannes Bader, Jonathan Aldrich, Éric Tanter\nVMCAI 2018, Springer\nhttp://pleiad.dcc.uchile.cl/papers/2018/baderAl-vmcai2018.pdf\nhttps://doi.org/10.1007/978-3-319-73721-8_2\n\n##### Efficient Gradual Typing\n\nAndre Kuhlenschmidt and Deyaaeldeen Almahallawi and Jeremy G. Siek.\narXiv:1802.06375, February 2018.\nhttps://arxiv.org/abs/1802.06375\n(This is an earlier version of the PLDI 2019 paper below.)\n\n##### KafKa: Gradual Typing for Objects\n\nBenjamin Chung, Paley Li, Francesco Zappa Nardelli, Jan Vitek.\nECOOP 2018, Leibniz International Proceedings in Informatics (LIPIcs), Pages 12:1--12:24.\nhttp://drops.dagstuhl.de/opus/volltexte/2018/9217/\n\n##### Shallow Types for Insightful Programs: Grace is Optional, Performance is Not\n\nRichard Roberts, Stefan Marr, Michael Homer, James Noble.\narXiv:1807.00661\nhttps://arxiv.org/abs/1807.00661\n\n##### Gradual Liquid Type Inference\n\nNiki Vazou, Éric Tanter, David Van Horn.\nOOPSLA 2018, ACM.\nhttps://arxiv.org/abs/1807.02132\n\n##### Type-Driven Gradual Security with References\n\nMatías Toro, Ronald Garcia, Éric Tanter.\nTOPLAS 2018, ACM.\nhttp://pleiad.dcc.uchile.cl/papers/2018/toroAl-toplas2018.pdf\nhttps://doi.org/10.1145/3229061\n\n##### Collapsible Contracts: Fixing a Pathology of Gradual Typing\n\nDaniel Feltey, Ben Greenman, Christophe Scholliers, Robert Bruce Findler, Vincent St-Amour.\nOOPSLA 2018, ACM.\nhttps://www.eecs.northwestern.edu/~robby/pubs/papers/oopsla2018-fgsfs.pdf\nhttps://doi.org/10.1145/3276503\n\n##### Preemptive type checking\n\nGrech, Neville, Bernd Fischer, Julian Rathke.\nJournal of Logical and Algebraic Methods in Programming, Volume 101, 2018.\nhttps://eprints.soton.ac.uk/421793/1/Preemptive_type_checking.pdf\nhttps://doi.org/10.1016/j.jlamp.2018.08.003\n\n##### Gradual Parametricity, Revisited\n\nMatías Toro, Elizabeth Labrada, Éric Tanter.\nPOPL 2019, ACM.\nhttps://doi.org/10.1145/3290330\nhttps://arxiv.org/abs/1807.04596\n\n##### The Behavior of Gradual Types: A User Study\n\nPreston Tunnell Wilson, Justin Pombrio, Ben Greenman, Shriram Krishnamurthi.\nDLS 2018, ACM.\nhttp://www.ccis.northeastern.edu/~types/publications/apples-to-apples/tgpk-dls-2018.pdf\n\n##### Dynamic Type Inference for Gradual Hindley--Milner Typing\n\nYusuke Miyazaki, Taro Sekiyama, Atsushi Igarashi.\nPOPL 2019, ACM.\nhttps://doi.org/10.1145/3290331\narXiv:1810.12619\nOctober 2018\nhttps://arxiv.org/abs/1810.12619\n\n##### Gradual Intersection Types\n\nPedro Ângelo, Mário Florido.\nWorkshop on Intersection Types and Related Systems (ITRS) 2018.\nhttp://t-news.cn/Floc2018/FLoC2018-pages/proceedings_paper_216.pdf\n\n##### Monotonic gradual typing in a common calculus\n\nBenjamin Chung, Jan Vitek.\nISSTA 2018, ACM.\nhttps://doi.org/10.1145/3236454.3236475\n\n##### Gradual Type Theory\n\nMax S. New, Dan Licata, Amal Ahmed.\nPOPL 2019, ACM.\nhttps://doi.org/10.1145/3290328\n\n##### Gradual typing: a new perspective\n\nGiuseppe Castagna, Victor Lanvin, Tommaso Petrucciani, Jeremy G. Siek.\nPOPL 2019, ACM.\nhttps://doi.org/10.1145/3290329\n\n##### Live Functional Programming with Typed Holes\n\nCyrus Omar, Ian Voysey, Ravi Chugh, Matthew Hammer.\nPOPL 2019, ACM.\nhttps://doi.org/10.1145/3290327\n\n##### Toward Efficient Gradual Typing for Structural Types via Coercions\n\nAndre Kuhlenschmidt, Deyaaeldeen Almahallawi, Jeremy G. Siek.\nPLDI 2019, ACM.\nhttps://doi.org/10.1145/3314221.3314627\nhttps://akuhlens.github.io/paper/pldi19.pdf\n\n##### Complete Monitors for Gradual Types\n\nBen Greenman, Matthias Felleisen, Christos Dimoulas\nOOPSLA 2019, ACM.\nhttps://doi.org/10.1145/3360548\n\n##### Gradual C Programming for Typed Lua\n\nRafi Shan Turas\nMasters Thesis\n2019\nUniversity of Waterloo\n\n##### Optimizing and Evaluating Transient Gradual Typing\n\nMichael M. Vitousek, Jeremy G. Siek, Avik Chaudhuri.\narXiv:1902.07808\nFebruary 2019\nhttps://arxiv.org/abs/1902.07808\n(This is an earlier version of the DLS 2019 paper that appears below.)\n\n##### Gradual Typing for Python, Unguarded\n\nMichael M. Vitousek  \nPhD Dissertation, Indiana University, May 2019.  \nhttp://hdl.handle.net/2022/23172\n\n##### The Dynamic Practice and Static Theory of Gradual Typing\n\nMichael Greenberg.\nSNAPL 2019.\nhttp://dx.doi.org/10.4230/LIPIcs.SNAPL.2019.6\n\n##### Blame Tracking and Type Error Debugging\n\nSheng Chen, John Peter Campora III.\nSNAPL 2019.\nhttp://dx.doi.org/10.4230/LIPIcs.SNAPL.2019.2\n\n##### Towards a Type System for R\n\nAlexi Turcotte, Jan Vitek.\nICOOOLPS 2019, ACM.\nhttps://doi.org/10.1145/3340670.3342426\n\n##### Static TypeScript: An Implementation of a Static Compiler for the TypeScript Language\n\nThomas Ball, Peli de Halleux, Michal Moskal.\nMPLR 2019, ACM.\nhttps://doi.org/10.1145/3357390.3361032\n\n##### Space-Efficient Gradual Typing in Coercion-Passing Style\n\nYuya Tsuda, Atsushi Igarashi, Tomoya Tabuchi.\narXiv:1908.02414\nAugust 2019\nhttps://arxiv.org/abs/1908.02414\n\n##### Automated Techniques forCreation and Maintenance of TypeScript Declaration Files\n\nErik Krogh Kristensen.\nPh.D. Thesis\nAarhus University\nAugust 2019\nhttps://pure.au.dk/portal/files/161232639/thesis.pdf\n\n##### Optimizing and Evaluating Transient Gradual Typing\n\nMichael M. Vitousek, Jeremy G. Siek, Avik Chaudhuri.\nDLS 2019, ACM.\nhttps://doi.org/10.1145/3359619.3359742\n\n##### Abstracting gradual typing: Metatheory and applications\n\nMatias Toro Ipinza.\nPh.D. Thesis\nUniversity of Chile.\nhttp://repositorio.uchile.cl/handle/2250/170935\n\n##### Which of my transient type checks are not (almost) free?\n\nIsaac Oscar Gariano, Richard Roberts, Stefan Marr, Michael Homer, James Noble.\nVMIL 2019, ACM.\nhttps://doi.org/10.1145/3358504.3361232\n\n##### Approximate Normalization for Gradual Dependent Types\n\nJoseph Eremondi, Éric Tanter, and Ronald Garcia\nICFP 2019, ACM.\nhttps://dl.acm.org/doi/10.1145/3341692\n\n##### Towards Gradual Checking of Reference Capabilities\n\nKiko Fernandez-Reyes, Isaac Oscar Gariano, James Noble, Tobias Wrigstad.\narXiv:1909.01465\nSeptember 2019\nhttps://arxiv.org/abs/1909.01465\n\n##### Gradual Typing for Extensibility by Rows\n\nTaro Sekiyama, Atsushi Igarashi.\narXiv:1910.08480\nOctober 2019\nhttps://arxiv.org/abs/1910.08480\n\n##### Call-by-name Gradual Type Theory\n\nMax S. New, Daniel R. Licata\nLogical Methods in Computer Science\nJanuary 2020\nhttps://lmcs.episciences.org/6063\n\n##### Graduality and Parametricity: Together Again for the First Time\n\nMax S. New, Dustin Jamner, Amal Ahmed\nPOPL 2020, ACM\nhttps://dl.acm.org/doi/10.1145/3371114\n\n##### What is Decidable about Gradual Typing?\n\nZeina Migeed, Jens Palsberg\nPOPL 2020, ACM\nhttps://dl.acm.org/doi/10.1145/3371097\n\n##### Toward a Mechanized Compendium of Gradual Typing\n\nJeremy G. Siek\narXiv:2001.11560\nJanuary 2020\nhttps://arxiv.org/abs/2001.11560\n\n##### Gradual Typing as if Types Mattered\n\nRonald Garcia, Éric Tanter\nWorkshop on Gradual Typing\nJanuary 2020\nhttps://wgt20.irif.fr/wgt20-final28-acmpaginated.pdf\n\n##### Foreign Function Typing: Semantic Type Soundness for FFIs\n\nDaniel Patterson, Amal Ahmed\nWorkshop on Gradual Typing\nJanuary 2020\nhttps://wgt20.irif.fr/wgt20-final23-acmpaginated.pdf\n\n##### Gradual Verification of Recursive Heap Data Structures\n\nJ. Wise, B. Johannes, J. Aldrich, É. Tanter\nWorkshop on Gradual Typing\nJanuary 2020\nhttps://wgt20.irif.fr/wgt20-final10-acmpaginated.pdf\n\n##### Fully Abstract from Static to Gradual\n\nK. Jacobs, A. Timany, D. Devriese\nWorkshop on Gradual Typing\nJanuary 2020\nhttps://wgt20.irif.fr/wgt20-final46-acmpaginated.pdf\n\n##### Space-Efficient Monotonic References\n\nD. Almahallawi, Jeremy G. Siek\nWorkshop on Gradual Typing\nJanuary 2020\nhttps://wgt20.irif.fr/wgt20-final70-acmpaginated.pdf\n\n##### λdB: Blame tracking at higher fidelity\n\nJ. Zalewski, J. McKinna, J.G. Morris, P. Wadler\nWorkshop on Gradual Typing\nJanuary 2020\nhttps://wgt20.irif.fr/wgt20-final98-acmpaginated.pdf\n\n##### Hypercoercions and a Framework for Equivalence of Cast Calculi\n\nK. Lu, Jeremy G. Siek, A. Kuhlenschmidt\nWorkshop on Gradual Typing\nJanuary 2020\nhttps://wgt20.irif.fr/wgt20-final09-acmpaginated.pdf\n\n##### A gradually typed subset of a scripting language can be simple and efficient\n\nHugo Musso Gualandi, Roberto Ierusalimschy\nDraft\nJanuary 2020\nhttp://www.inf.puc-rio.br/~hgualandi/papers/manuscript-Gualandi-JFP-2020-01-30.pdf\n\n##### First-order Gradual Information Flow Types with Gradual Guarantees\n\nAbhishek Bichhawat, McKenna McCall, Limin Jia\narXiv:2003.12819\nMarch 2020\nhttps://arxiv.org/abs/2003.12819\n\n##### LambdaNet: Probabilistic Type Inference using Graph Neural Networks\n\nJiayi Wei, Maruth Goyal, Greg Durrett, Isil Dillig\narXiv:2005.02161\nApril 2020\nhttps://arxiv.org/abs/2005.02161\n\n##### Pallene: A companion language for Lua\n\nHugo Musso Gualandi, Roberto Ierusalimschy, 2020\nScience of Computer Programming\nApril 2020\nhttps://doi.org/10.1016/j.scico.2020.102393\n\n##### Reconciling Noninterference and Gradual Typing\n\nArthur Azevedo de Amorim, Matt Fredrikson, Limin Jia\nLogic in Computer Science (LICS)\nJuly 2020\nhttp://arthuraa.net/docs/glio.pdf\n\n##### Abstracting gradual references\n\nMatías Toro, Éric Tanter\nScience of Computer Programming\nVolume 197, 2020\nhttps://doi.org/10.1016/j.scico.2020.102496\n\n##### Abstracting Gradual Typing Moving Forward : Precise and Space-Efficient\n\nFelipe Bañados Schwerter, Alison M. Clark, Khurram A. Jafery, Ronald Garcia\nPOPL 2021\nhttps://dl.acm.org/doi/10.1145/3434342\n\n##### Corpse Reviver: Sound and Efficient Gradual Typing via Contract Verification\n\nCameron Moy, Phúc C. Nguyễn, Sam Tobin-Hochstadt, David Van Horn\nPOPL 2021\nhttps://dl.acm.org/doi/abs/10.1145/3434334\n\n##### Fully Abstract from Static to Gradual\n\nKoen Jacobs, Amin Timany, Dominique Devriese\nPOPL 2021\nhttps://dl.acm.org/doi/abs/10.1145/3434288\n\n##### Deep and Shallow Types\n\nBen Greenman\nPh.D. Thesis, Northeastern University\nNovember 2020\nhttp://ccs.neu.edu/home/types/resources/pdf/g-dissertation-2020.pdf\n\n##### Towards Efficient Gradual Typing Via Monotonic References And Coercions\n\nDeyaaeldeen Almahallawi\nPh.D. Thesis, Indiana University\nMay 2020\nhttps://www.dropbox.com/s/oiui3q0l76z5pbo/deyaa-dissertation.pdf?dl=1\n\n##### A Semantic Foundation for Sound Gradual Typing\n\nMax New\nPh.D. Thesis, Northeastern University\n2020\nhttp://maxsnew.com/docs/dissertation.pdf\n\n##### Taming type annotations in gradual typing\n\nJohn Peter Campora and Sheng Chen\nOOPSLA 2020\nhttps://doi.org/10.1145/3428259\n\n##### Gradual verification of recursive heap data structures\n\nJenna Wise, Johannes Bader, Cameron Wong, Jonathan Aldrich, Éric Tanter, Joshua Sunshine\nOOPSLA 2020\nhttps://doi.org/10.1145/3428296\n\n##### Where to Start: Studying Type Annotation Practices in Python\n\nW. Jin, D. Zhong, Z. Ding, M. Fan and T. Liu\nASE 2021\nhttps://doi.org/10.1109/ASE51524.2021.9678947\n\n##### Label dependent lambda calculus and gradual typing\n\nWeili Fu, Fabian Krause, Peter Thiemann\nOOPSLA 2021\nhttps://doi.org/10.1145/3485485\n\n##### GATE: Gradual Effect Types\n\nPhilip Wadler\nISoLA 2021: Leveraging Applications of Formal Methods, Verification and Validation\nhttps://doi.org/10.1007/978-3-030-89159-6_21\n\n##### A Transient Semantics for Typed Racket\n\nBen Greenman, Lukas Lazarek, Christos Dimoulas, Matthias Felleisen\n2021\nhttps://doi.org/10.48550/arXiv.2111.10411\n\n##### Transitioning from structural to nominal code with efficient gradual typing\n\nMuehlboeck, Fabian, and Ross Tate.\nOOPSLA 2021\nhttps://doi.org/10.1145/3485504\n\n##### Gradually structured data\n\nStefan Malewski, Michael Greenberg, Éric Tanter\nOOPSLA 2021\nhttps://doi.org/10.1145/3485503\n\n##### A Reasonably Gradual Type Theory\n\nKenji Maillard, Meven Lennon-Bertrand, Nicolas Tabareau, Éric Tanter\n2022\nhttps://hal.inria.fr/hal-03596652/\n\n# Early Work on Interoperation\n\nThese papers all consider the challenges of interoperability between typed and untyped languages, which is at the core of the gradual typing project. Papers about type checking untyped languages that do not consider interoperation appear in the next section.\n\n##### Quasi-static Typing\n\nSatish Thatte  \nIn Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL '90). ACM, New York, NY, USA, 367-381.\n\n##### Pluggable type systems.\n\nGilad Bracha.  \nIn OOPSLA Workshop on the Revival of Dynamic Languages, 2004.\n\n##### Contracts for higher-order functions\n\nRobert Bruce Findler and Matthias Felleisen  \nIn ICFP ’02: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, pages 48–59. ACM Press, 2002\n\n##### BabyJ: From Object Based to Class Based Programming via Types\n\nChristopher Anderson, Sophia Drossopoulou  \nProceedings of Workshop on Object Oriented Developments 2003, Electronic Notes in Theoretical Computer Science, Volume 82, Issue 8, October 2003, Pages 53–81\n\n##### Compiling Java to PLT Scheme\n\nKathryn E. Gray and Matthew Flatt.  \nIn Scheme Workshop 2004\n\n##### Fine-grained interoperability through mirrors and contracts.\n\nKathryn E. Gray, Robert Bruce Findler, and Matthew Flatt.  \nIn OOPSLA ’05: Proceedings of the 20th annual ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications, pages 231–245. ACM Press, 2005\n\n##### Hybrid type checking.\n\nCormac Flanagan.  \nIn Conference Record of POPL ’06: The 33th ACM SIGPLAN-SIGACT Symposium on Principles of Programming\nLanguages, pages 245–256. ACM Press, 2006.\n\n##### Towards Customizable Pedagogic Programming Languages\n\nKathryn E. Gray  \nPhD Dissertation, University of Utah, School of Computing, August 2006.\n\n##### Introducing safe unknown types in Java-like languages\n\nGiovanni Lagorio and Elena Zucca\nACM Symp. on Applied Computing (SAC 2006), Special Track on Object-Oriented Programming Languages and Systems, 2006\n\n##### Just: safe unknown types in Java-like languages\n\nGiovanni Lagorio and Elena Zucca\nJournal of Object Technology, Vol. 6, No. 2, Special Issue OOPS Track at SAC 2006, February 2007\n\n# Related\n\n## Contracts\n\n##### Unifying Hybrid Types and Contracts.\n\nJessica Gronski, Cormac Flanagan.\nTrends in Functional Programming, 2007.\n\n##### Polymorphic Contracts\n\nJoão Filipe Belo, Michael Greenberg, Atsushi Igarashi, Benjamin C. Pierce\nProgramming Languages and Systems, LNCS Volume 6602, 2011, pp 18-37\nhttp://www.seas.upenn.edu/~mgree/papers/esop2011sub_fh.pdf\n\n##### Manifest Contracts\n\nMichael Greenberg.\nPhD Dissertation, University of Pennsylvania, January 2013.\nhttps://repository.upenn.edu/cgi/viewcontent.cgi?article=1625\u0026context=edissertations\n\n##### Sound and Complete Models of Contracts\n\nMatthias Blume and David Mcallester.\nJournal of Functional Programming, vol 16, 2006.\nhttps://doi.org/10.1017/S0956796806005971\n\n##### On Contract Satisfaction in a Higher-order World\n\nChristos Dimoulas and Matthias Felleisen.\nACM Transactions on Programming Languages and Systems (TOPLAS), 33(5):1–29, 2011.\nhttps://doi.org/10.1145/2039346.2039348\n\n#### Does Blame Shifting Work?\n\nLukas Lazarek, Alexis King, Samanvitha Sundar, Robert Bruce Findler, Christos Dimoulas\nPOPL 2020, ACM\nhttps://dl.acm.org/doi/10.1145/3371133\n\n## Typing Untyped Languages\n\nThese papers address the challenges of type checking existing untyped programs and programming languages, but do not address the core gradual type checking concern of interoperability.\n\n##### User-defined data types as an aid to verifying LISP programs.\n\nRobert Cartwright.  \nIn International Conference on Automata, Languages and Programming, pages 228–256, 1976.\n\n##### Inferring types in Smalltalk\n\nNorihisa Suzuki  \nPOPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages\n\n##### Creating efficient systems for object-oriented languages\n\nNorihisa Suzuki and Minoru Terada  \nPOPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages\n\n##### TS: An Optimizing Compiler for Smalltalk\n\nRalph E. Johnson and Justin O. Graver and Lawrence W. Zurawski\nOOPSLA '88: Proceedings of the 3rd annual ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications, pages 18-26.\nhttp://dl.acm.org/citation.cfm?id=62086\n\n##### Static type inference in a dynamically typed language\n\nAlexander Aiken and Brian R. Murphy  \nIn POPL ’91: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 279–290. ACM Press, 1991.\n\n##### Soft typing.\n\nRobert Cartwright and Mike Fagan.  \nIn PLDI ’91: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation, pages 278–292. ACM Press, 1991.\n\n##### Strongtalk: typechecking Smalltalk in a production environment.\n\nGilad Bracha and David Griswold.  \nIn OOPSLA ’93: Proceedings of the 8th annual ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications, pages 215–230. ACM Press, 1993.\n\n##### Strong Static Type Checking for Functional Common Lisp\n\nRobert Akers  \nUniversity of Texas Dissertation, also Computational Logic Inc Technical Report 96  \nftp://ftp.cs.utexas.edu/pub/boyer/diss/akers.pdf\n\n##### Soft typing with conditional types.\n\nAlexander Aiken, Edward L. Wimmers, and T. K. Lakshman  \nIn POPL ’94: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 163–173. ACM Press, 1994\n\n##### Dynamic typing: Syntax and proof theory.\n\nFritz Henglein.  \nScience of Computer Programming, 22(3):197–230, 1994.\n\n##### Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML.\n\nFritz Henglein and Jakob Rehof.  \nIn FPCA ’95: Proceedings of the Seventh International Conference on Functional Programming Languages and Computer Architecture, pages 192–203. ACM Press, 1995.\n\n##### Infer: A statically-typed dialect of Scheme.\n\nChristopher T. Haynes  \nTechnical Report 367, Indiana University, 1995.\n\n##### Catching bugs in the web of program invariants\n\nCormac Flanagan, Matthew Flatt, Shriram Krishnamurthi, Stephanie Weirich, and Matthias Felleisen  \nIn Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation (PLDI '96)  \nhttp://www.ccs.neu.edu/racket/pubs/#pldi96-ffkwf\n\n##### The Strongtalk Type System for Smalltalk.\n\nGilad Bracha  \nOOPSLA96 Workshop on Extending the Smalltalk Language, 1996  \nhttp://www.bracha.org/nwst.html\n\n##### Program Verification through Soft Typing\n\nRobert Cartwright and Matthias Felleisen  \nACM Computing Surveys 28, 2 (June 1996)  \nhttp://www.ccs.neu.edu/racket/pubs/#cs96-cf\n\n##### Componential set-based analysis\n\nCormac Flanagan and Matthias Felleisen  \nIn Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation (PLDI '97)  \nhttp://www.ccs.neu.edu/racket/pubs/#pldi97-ff\n\n##### A practical subtyping system for Erlang.\n\nSimon Marlow and Philip Wadler.  \nIn ICFP ’97: Proceedings of the Second ACM SIGPLAN International Conference\non Functional Programming, pages 136–149. ACM Press, 1997.\nhttp://homepages.inf.ed.ac.uk/wadler/topics/erlang.html\n\n##### A practical soft type system for Scheme.\n\nAndrew K. Wright and Robert Cartwright.\nACM Transactions on Programming Languages and Systems, 19(1):87–152, 1997\n\n##### A New Way of Debugging LISP Programs\n\nCormac Flanagan and Matthias Felleisen  \nIn Lisp in the Mainstream: The 40th Annniversary Conference of Lisp Users.  \nBerkeley, November 1998.  \nhttp://www.ccs.neu.edu/racket/pubs/#lugm98-ff\n\n##### Componential set-based analysis\n\nCormac Flanagan and Matthias Felleisen  \nACM Trans. Program. Lang. Syst. 21, 2 (March 1999), 370-416  \nhttp://www.ccs.neu.edu/racket/pubs/#toplas99-ff\n\n##### Revised NISP manual.\n\nDrew McDermott.  \nTechnical Report YALE/DCS/RR-642, Yale University, Department of Computer Science, 2004\n\n##### Starkiller: A static type inferencer and compiler for Python.\n\nMichael Salib.  \nMaster’s thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 2004.\n\n##### A Type Notation for Scheme.\n\nGary T. Leavens, Curtis Clifton, and Brian Dorn.  \nTechnical Report 05-18a, Iowa State University, 2005.\n\n##### Practical Type Inference Based on Success Typings\n\nTobias Lindahl and Konstantinos Sagonas\nInternational Symposium on Principles and Practice of Declarative Programming (PPDP), 2006.\nhttp://www.it.uu.se/research/group/hipe/papers/succ_types.pdf\n\n## Type Systems for Gradual-typing\n\nThis work presents type systems for untyped languages, influenced by gradual typing work on interoperation, but doesn't explicitly deal with typed/untyped interoperation.\n\n##### Practical Variable-Arity Polymorphism\n\nT. Stephen Strickland, Sam Tobin-Hochstadt, and Matthias Felleisen.  \nEuropean Symposium on Programming (ESOP), March 2009.\n\n##### Static Type Inference for Ruby\n\nMichael Furr, Jong-hoon (David) An, Jeffrey S. Foster, and Michael Hicks  \nIn Object-Oriented Program Languages and Systems (OOPS) Track at ACM Symposium on Applied Computing (SAC), pages 1859–1866, Honolulu, Hawaii, March 2009.\n\n##### Tests to the Left of Me, Types to the Right: How Not to Get Stuck in the Middle of a Ruby Execution (A Demo of Diamondback Ruby)\n\nMichael Furr, Jong-hoon (David) An, Jeffrey S. Foster, and Michael Hicks  \nIn 1st International Workshop on Script to Program Evolution (STOP), Genova, Italy, July 2009.\n\n##### Profile-Guided Static Typing for Dynamic Scripting Languages\n\nMichael Furr, Jong-hoon (David) An, and Jeffrey S. Foster  \nIn ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), pages 283–300, Orlando, Floria, October 2009.\n\n##### Work In Progress: an Empirical Study of Static Typing in Ruby\n\nMark T. Daly, Vibha Sazawal, and Jeffrey S. Foster  \nIn Workshop on Evaluation and Usability of Programming Languages and Tools (PLATEAU), Orlando, Florida, October 2009.\n\n##### Static Typing for Ruby on Rails\n\nJong-hoon (David) An, Avik Chaudhuri, and Jeffrey S. Foster  \nIn IEEE/ACM International Conference on Automated Software Engineering (ASE), pages 590–594, Auckland, New Zealand, November 2009. Short paper.\n\n##### Logical Types for Untyped Languages\n\nSam Tobin-Hochstadt and Matthias Felleisen  \nInternational Conference on Functional Programming (ICFP), September 2010.\n\n##### Dynamic Inference of Static Types for Ruby\n\nJong-hoon (David) An, Avik Chaudhuri, Jeffrey S. Foster, and Michael Hicks  \nIn ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 459–472, Austin, TX, USA, January 2011.\n\n##### Position Paper: Dynamically Inferred Types for Dynamic Languages\n\nJong-hoon (David) An, Avik Chaudhuri, Jeffrey S. Foster, and Michael Hicks  \nIn 2nd International Workshop on Script to Program Evolution (STOP), Austin, TX, USA, January 2011.\n\n##### Typing the Numeric Tower\n\nVincent St-Amour, Sam Tobin-Hochstadt, Matthew Flatt and Matthias Felleisen  \nSymposium on Practical Aspects of Declarative Languages (PADL), January 2012.\n\n##### Nested Refinements: A Logic for Duck Typing\n\nRavi Chugh, Patrick M. Rondon, and Ranjit Jhala  \nIn Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 231-244, Philadelphia, PA, January 2012.\n\n##### Status Report: Dependent Types for JavaScript\n\nRavi Chugh, David Herman, Ranjit Jhala\nSTOP 2012\nSee subsequent OOPSLA paper.\n\n##### Minigrace: A progress report\n\nMichael Homer and James Noble  \nSTOP 2012\n\n##### Dependent Types for JavaScript\n\nRavi Chugh, David Herman, and Ranjit Jhala  \nIn Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 587-606, Tucson, AZ, October 2012.\n\n##### Progressive Types\n\nJoe Gibbs Politz, Hannah Quay-de la Vallee, Shriram Krishnamurthi  \nIn Proceedings of the ACM international symposium on New ideas, new paradigms, and reflections on programming and software (Onward! '12)  \nhttp://cs.brown.edu/~sk/Publications/Papers/Published/pqk-progressive-types/\n\n##### A Practical Optional Type System for Clojure\n\nAmbrose Bonnaire-Sergeant  \nHonours thesis, University of Western Australia, 2012\nhttp://cloud.github.com/downloads/frenchy64/papers/ambrose-honours.pdf\n\n##### Typed Lua: An Optional Type System for Lua\n\nAndré Murbach Maidl, Fabio Mascarenhas, Roberto Ierusalimschy.\nDyla 2014.\nhttp://www.lifl.fr/dyla14/papers/dyla14-4-typed-lua-an-optional-type-system.pdf\n\n##### Practical Optional Types for Clojure\n\nAmbrose Bonnaire-Sergeant, Rowan Davies, and Sam Tobin-Hochstadt.  \nIn ESOP 2016: Proceedings of the 25th European Symposium on Programming Languages and Systems, volume 9632 of Lecture Notes in Computer Science, pages 68-94. Springer-Verlag, 2016.  \nhttp://frenchy64.github.io/papers/esop16-short.pdf\n\n##### Occurrence Typing Modulo Theories\n\nAndrew M. Kent, David Kempe, and Sam Tobin-Hochstadt.\nIn Proceedings of the ACM SIGPLAN 2016 conference on Programming Language Design and Implementation (PLDI '16)\n\n##### A Gradual Type System for Elixir\n\nMauricio Cassola, Agustín Talagorria, Alberto Pardo, Marcos Viera\nIn SBLP '20: Proceedings of the 24th Brazilian Symposium on Context-Oriented Programming and Advanced Modularity, October 2020, Pages 17–24\nhttps://doi.org/10.1145/3427081.3427084\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamth%2Fgradual-typing-bib","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsamth%2Fgradual-typing-bib","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamth%2Fgradual-typing-bib/lists"}