Course Literature

Abadi et al. (POPL 1999)
Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. A core calculus of dependency. In POPL '99, Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 20–22, 1999, San Antonio, TX, pages 147–160. ACM Press, 1999.

Aspinall et al. (CASSIS 2004)
David Aspinall, Stephen Gilmore, Martin Hofmann, Donald Sannella, and Ian Stark. Mobile resource guarantees for smart devices. In Gilles Barthe, Lilian Burdy, Marieke Huisman, Jean-Louis Lanet, and Traian Muntean, editors, Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, International Workshop, CASSIS 2004, Marseille, France, March 10–14, 2004, Revised Selected Papers, volume 3362 of Lecture Notes in Computer Science, pages 1–26. Springer-Verlag, 2005.

Birkedal and Welinder (LSC 1995)
Lars Birkedal and Morten Welinder. Binding-time analysis for Standard ML. Lisp and Symbolic Computation, 8(3):191–208, 1995.

Bondorf (LFP 1992)
Anders Bondorf. Improving binding times without explicit CPS-conversion. In Proceedings of the Conference on Lisp and Functional Programming, San Francisco, California, USA, 22–24 June 1992, pages 1–10. ACM Press, 1992.

Cheney et al. (DBPL 2007)
James Cheney, Amal Ahmed, and Umut A. Acar. Provenance as dependency analysis. In Marcelo Arenas and Michael I. Schwartzbach, editors, Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23–24, 2007, Revised Selected Papers, volume 4797 of Lecture Notes in Computer Science, pages 138–152. Springer-Verlag, 2007.

Chin et al. (PLDI 2004)
Wei-Ngan Chin, Florin Cracjun, Qin Shangchao, and Martin C. Rinard. Region inference for an object-oriented language. In William Pugh and Craig Chambers, editors, Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation, Washington, DC, USA, June 9 –11, 2004, pages 243–254. ACM Press, 2004.

Condit et al. (ESOP 2007)
Jeremy Condit, Matthew Harren, Zachary R. Anderson, David Gay and George C. Necula. Dependent types for low-level programming. In Rocco Di Nicola, editor, Programming Languages and Systems, 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24–April 1, 2007, Proceedings, volume 4421 of Lecture Notes in Computer Science, pages 520–535. Springer-Verlag, 2007.

Consel and Danvy (POPL 1993)
Charles Consel and Olivier Danvy. Tutorial notes on partial evaluation. In Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, January 1993, pages 493–501. ACM Press, 1993.

Danvy (POPL 1996)
Olivier Danvy. Type-directed partial evaluation. In Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, St. Petersburg Beach, Florida, 21–24 January 1996, pages 242–257. ACM Press, 1996.

Danvy et al. (LSC 1995)
Olivier Danvy, Karoline Malmkjær, and Jens Palsberg. The essence of eta-expansion in partial evaluation. Lisp and Symbolic Computation, 8(3):209–227, 1995.

Danvy and Palsberg (TOPLAS 1996)
Eta-expansion does the trick. ACM Transactions on Programming Languages and Systems (TOPLAS), 18(6):730–751, 1996.

Dean et al. (ECOOP 1995)
Jeffrey Dean, David Grove, and Craig Chambers. Optimization of object-oriented programs using static class hierarchy analysis. In Walter G. Olthoff, editor, ECOOP'95, Object-Oriented Programming, 9th European Conference, Åarhus, Denmark, August 7–11, 1995, Proceedings, volume 952 of Lecture Notes in Computer Science, pages 77–101. Springer-Verlag, 1995.

Dietl et al. (CASSIS 2004)
Werner Dietl, Peter Müller, and Arnd Poetzsch-Heffter. A type system for checking applet isolation in Java Card. In Gilles Barthe, Lilian Burdy, Marieke Huisman, Jean-Louis Lanet, and Traian Muntean, editors, Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, International Workshop, CASSIS 2004, Marseille, France, March 10–14, 2004, Revised Selected Papers, volume 3362 of Lecture Notes in Computer Science, pages 129–150. Springer-Verlag, 2005.

Dussart et al. (SAS 1995)
Dirk Dussart, Fritz Henglein, and Christian Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Alan Mycroft, editor, Static Analysis, Second International Symposium, SAS'95, Glasgow, UK, September 27, 1995, Proceedings, volume 983 of Lecture Notes in Computer Science, pages 118–135. Springer-Verlag, 1995.

Filinksi (PPDP 1999)
Andrzej Filinski. A semantic account of type-directed partial evaluation. In Gopalan Nadathur, editor, Principles and Practice of Declarative Programming, International Conference, PPDP'99, Paris, France, September 29–October 1, 1999, Proceedings, volume 1702 of Lecture Notes in Computer Science, pages 378–385. Springer-Verlag, 1999.

Glew et al. (SAS 2005)
Neal Glew, Jens Palsberg, and Christian Grothoff. Type-safe optimisation of plugin architectures. In Chris Hankin and Igor Siveroni, editors, Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7–9, 2005, Proceedings, volume 3672 of Lecture Notes in Computer Science, pages 135–154. Springer-Verlag, 2005.

Grothoff et al. (OOPSLA 2001)
Christian Grothoff, Jens Palsberg, and Jan Vitek. Encapsulating objects with confined types. In Proceedings of the 2001 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, OOPSLA 2001, October 14–18, 2001, Tampa, Florida, USA, pages 241–253. ACM Press, 2001.

Gustavsson and Sands (ENTCS 26)
Jörgen Gustavsson and David Sands. A foundation for space-safe transformations of call-by-need programs. Electronic Notes in Theoretical Computer Science, 26:69–86, 1999.

Hage and Holdermans (PEPM 2008)
Jurriaan Hage and Stefan Holdermans. Heap recycling for lazy languages. In John Hatcliff, Robert Glück, and Oege de Moor, editors, Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'08, San Francisco, California, USA, January 7–8, 2008, pages 189–197. ACM Press, 2008.

Hage et al. (ICFP 2007)
Jurriaan Hage, Stefan Holdermans, and Arie Middelkoop. A generic usage analysis with subeffect qualifiers. In Ralf Hinze and Norman Ramsey, editors, Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007, Freiburg, Germany, October 1–3, 2007, pages 235–246. ACM Press, 2007.

Harren and Necula (SAS 2005)
Matthew Harren and George C. Necula. Using dependent types to certify the safety of assembly code. In Chris Hankin and Igor Siveroni, editors, Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7–9, 2005, Proceedings, volume 3672 of Lecture Notes in Computer Science, pages 155–170. Springer-Verlag, 2005.

Heldal and Hughes (Theor. Comput. Sci. 2000)
Rogardt Heldal and John Hughes. Extending a partial evaluator which supports separate compilation. Theoretical Computer Science, 248(1–2):99–145, 2000.

Heldal and Hughes (PSI 2001)
Rogardt Heldal and John Hughes. Binding-time analysis for polymorphic types. In Dines Bjørner, Manfred Broy, and Alexandre V. Zamulin, editors, Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, PSI 2001, Akademgorodok, Novosibirsk, Russia, July 2–6, 2001, Revised Papers, volume 2244 of Lecture Notes in Computing Science, pages 188–205. Springer-Verlag, 2001.

Jensen (NDJ 2002)
Thomas Jensen. Types in program analysis. In Torben Æ. Mogensen, David A. Schmidt, and Ivan Hal Sudborough, editors, The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday], volume 2566 of Lecture Notes in Computer Science, pages 204–222. Springer-Verlag, 2002.

Jones (ESOP 1992)
Mark P. Jones. A theory of qualified types. In Bernd Krieg-Brückner, editor, ESOP ’92, 4th European Symposium on Programming, Rennes, France, February 26–28, 1992, Proceedings, volume 582 of Lecture Notes in Computer Science, pages 287–306. Springer-Verlag, 1992.

Jones (LSC 1995)
Mark P. Jones. Dictionary-free overloading by partial evaluation. Lisp and Symbolic Computation, 8(3):229–248, 1995.

Necula (POPL 1997)
George C. Necula. Proof-carrying code. In Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, Paris, France, 15–17 January 1997, pages 106–119. ACM Press, 1997.

Nielson and Nielson (HL 1999)
Flemming Nielson and Hanne Riis Nielson. Type and effect systems. In Ernst-Rüdiger Olderog and Bernhard Steffen, editors, Correct System Design, Recent Insights and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel), volume 1710 of Lecture Notes in Computer Science, pages 114–136. Springer-Verlag, 1999.

Nielson et al. (NNH)
Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, Berlin, 1999.

Palsberg (PASTE 2001)
Jens Palsberg. Type-based analysis and applications. In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE'01, Snowbird, Utah, USA, June 18–19, 2001, pages 20–27. ACM Press, 2001.

Solberg Gasser et al. (SAS 1994)
Kirsten Lackner Solberg Gasser, Hanne Riis Nielson, and Flemming Nielson. Strictness and totality analysis. In Baudouin Le Charlier, editor, Static Analysis, First International Static Analysis Symposium, SAS'94, Namur, Belgium, September 28–30, 1994, Proceedings, volume 864 of Lecture Notes in Computer Science, pages 408–422. Springer-Verlag, 1994.

Tofte and Talpin (POPL 1994)
Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value λ-calculus using a stack of regions. In Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, January 17–21, 1994, pages 188–201. ACM Press, 1994.

Turner et al. (FPCA 1995)
David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. In Conference Record of FPCA '95 SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture. La Jolla, CA, USA, 25–28 June 1995, pages 1–11. ACM Press, 1995.

Volpano and Smith (TAPSOFT 1997)
Dennis M. Volpano and Geoffrey Smith. A type-based approach to program security. In Michel Bidoit and Max Dauchet, editors, TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14–18, 1997, Proceedings, volume 1214 of Lecture Notes in Computer Science, pages 607–621. Springer-Verlag, 1997.

De Vries et al. (IFL 2006)
Edsko de Vries, Rinus Plasmeijer, and David Abrahamson. Uniqueness typing redefined. In Zoltán Horváth, Viktória Zsók, and Andrew Butterfield, editors, Implementation and Application of Functional Languages, 18th International Workshop, IFL 2006, Budapest, Hungary, September 4–6, 2006, Revised Selected Papers, volume 4449 of Lecture Notes in Computer Science, pages 181–198. Springer-Verlag, 2007.

De Vries et al. (IFL 2007)
Edsko de Vries, Rinus Plasmeijer, and David Abrahamson. Uniqueness typing simplified. In Olaf Chitil, Zoltán Horváth, and Viktória Zsók, editors, Implementation and Application of Functional Languages, 19th International Symposium, IFL 2007, Freiburg, Germany, September 2007, Revised Selected Papers, volume 5083 of Lecture Notes in Computer Science, pages 201–218. Springer-Verlag, 2008.

Wansbrough and Peyton Jones (POPL 1999)
Keith Wansbrough and Simon Peyton Jones. Once upon a polymorphic type. In POPL '99, Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 20–22, 1999, San Antonio, TX, pages 15–28. ACM Press, 1999.