Bibliography

[1] Martín Abadi and Luca Cardelli. A theory of primitive objects: Second-order systems. Science of Computer Programming, 25(2-3):81-116, December 1995. [ bib | .pdf ]
[2] Martín Abadi and Luca Cardelli. A theory of primitive objects: Untyped and first-order systems. Information and Computation, 125(2):78-102, March 1996. [ bib | .pdf ]
[3] Martín Abadi and Marcelo P. Fiore. Syntactic considerations on recursive types. In Logic in Computer Science (LICS), pages 242-252, July 1996. [ bib | .ps ]
[4] Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. A core calculus of dependency. In Principles of Programming Languages (POPL), pages 147-160, January 1999. [ bib | .ps ]
[5] Martín Abadi and Bruno Blanchet. Secrecy types for asymmetric communication. In Foundations of Software Science and Computation Structures (FOSSACS), volume 2030 of Lecture Notes in Computer Science, pages 25-41. Springer, April 2001. [ bib | .html ]
[6] Martín Abadi, Butler Lampson, and Jean-Jacques Lévy. Analysis and caching of dependencies. In International Conference on Functional Programming (ICFP), pages 83-91, May 1996. [ bib | .ps ]
[7] Martín Abadi, Benjamin Pierce, and Gordon Plotkin. Faithful ideal models for recursive polymorphic types. International Journal of Foundations of Computer Science, 2(1):1-21, March 1991. [ bib | .ps ]
[8] Andreas Abel. Termination checking with types. RAIRO Theoretical Informatics and Applications, 38(4):277-319, 2004. [ bib | .pdf ]
[9] Andreas Abel. MiniAgda: Integrating sized and dependent types. In Workshop on Partiality And Recursion in Interactive Theorem Provers (PAR), July 2010. [ bib | .pdf ]
[10] Andreas Abel, Marcin Benke, Ana Bove, John Hughes, and Ulf Norell. Verifying Haskell programs using constructive type theory. In Haskell workshop, pages 62-73, September 2005. [ bib | .pdf ]
[11] Samson Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51:1-77, 1991. [ bib | .ps.gz ]
[12] Samson Abramsky, Kohei Honda, and Guy McCusker. A fully abstract game semantics for general references. In Logic in Computer Science (LICS), pages 334-344, 1998. [ bib | .ps.gz ]
[13] Peter Achten and Marinus J. Plasmeijer. The ins and outs of Clean I/O. Journal of Functional Programming, 5(1):81-110, 1995. [ bib | http ]
[14] Sten Agerholm. A HOL basis for reasoning about functional programs. Technical Report RS-94-44, BRICS, December 1994. [ bib | .ps.gz ]
[15] Sten Agerholm. LCF examples in HOL. Technical Report RS-94-18, BRICS, June 1994. [ bib | .ps.gz ]
[16] Amal Ahmed, Andrew W. Appel, Christopher D. Richards, Kedar N. Swadi, Gang Tan, and Daniel C. Wang. Semantic foundations for typed assembly languages. ACM Transactions on Programming Languages and Systems, 32(3), 2010. [ bib | .pdf ]
[17] Amal Ahmed and Matthias Blume. Typed closure conversion preserves observational equivalence. In International Conference on Functional Programming (ICFP), pages 157-168, September 2008. [ bib | .pdf ]
[18] Amal Ahmed, Derek Dreyer, and Andreas Rossberg. State-dependent representation independence. In Principles of Programming Languages (POPL), pages 340-353, January 2009. [ bib | .pdf ]
[19] Amal Ahmed, Matthew Fluet, and Greg Morrisett. L3: A linear language with locations. Fundamenta Informaticæ, 77(4):397-449, 2007. [ bib | .pdf ]
[20] Amal J. Ahmed, Andrew W. Appel, and Roberto Virga. A stratified semantics of general references embeddable in higher-order logic. In Logic in Computer Science (LICS), pages 75-86, July 2002. [ bib | .pdf ]
[21] Amal J. Ahmed, Matthew Fluet, and Greg Morrisett. A step-indexed model of substructural state. In International Conference on Functional Programming (ICFP), pages 78-91, September 2005. [ bib | .pdf ]
[22] Amal Jamil Ahmed. Semantics of types for mutable state. PhD thesis, Princeton University, 2004. [ bib | .pdf ]
[23] Alfred Aho, Ravi Sethi, and Jeffrey Ullman. Compilateurs: principes, techniques et outils. InterEditions, 1989. [ bib ]
[24] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data structures and algorithms. Addison-Wesley, 1983. [ bib ]
[25] Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, techniques, and tools. Addison-Wesley, 1986. [ bib ]
[26] Alfred V. Aho and Jeffrey D. Ullman. The theory of parsing, translation, and compiling. Prentice Hall, 1972. [ bib | http ]
[27] Alexander Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35:79-111, 1999. [ bib | .ps ]
[28] Alexander Aiken, Manuel Fähndrich, and Raph Levien. Better static memory management: improving region-based analysis of higher-order languages. ACM SIGPLAN Notices, 30(6):174-185, June 1995. [ bib | .ps ]
[29] Alexander Aiken, Manuel Fähndrich, Jeffrey S. Foster, and Zhendong Su. A toolkit for constructing type- and constraint-based program analyses. Lecture Notes in Computer Science, 1473:76-96, 1998. [ bib | .ps ]
[30] Alexander S. Aiken. The Illyria system, 1994. [ bib | .html ]
[31] Alexander S. Aiken and Manuel Fähndrich. Making set-constraint based program analyses scale. Technical Report CSD-96-917, University of California, Berkeley, September 1996. [ bib | .pdf ]
[32] Alexander S. Aiken and Manuel Fähndrich. Subtyping polymorphic constrained types. Technical Report CSD-96-898, University of California, Berkeley, March 1996. [ bib ]
[33] Alexander S. Aiken and Manuel Fähndrich. Program analysis using mixed term and set constraints. In Static Analysis Symposium (SAS), pages 114-126, September 1997. [ bib | .ps ]
[34] Alexander S. Aiken and Edward L. Wimmers. Solving systems of set constraints. In Logic in Computer Science (LICS), pages 329-340, June 1992. [ bib | .ps ]
[35] Alexander S. Aiken and Edward L. Wimmers. Type inclusion constraints and type inference. In Functional Programming Languages and Computer Architecture (FPCA), pages 31-41. ACM Press, 1993. [ bib | .ps ]
[36] Alexander S. Aiken, Edward L. Wimmers, and T. K. Lakshman. Soft typing with conditional types. In Principles of Programming Languages (POPL), pages 163-173, January 1994. [ bib | .ps ]
[37] Alexander S. Aiken, Edward L. Wimmers, and Jens Palsberg. Optimal representations of polymorphic types with subtyping. Technical Report CSD-96-909, University of California, Berkeley, July 1996. [ bib | .ps ]
[38] Jonathan Aldrich. Resource-based programming in Plaid. Fun Ideas and Thoughts, June 2010. [ bib | .pdf ]
[39] Jonathan Aldrich, Ronald Garcia, Mark Hahnenberg, Manuel Mohr, Karl Naden, Darpan Saini, Sven Stork, Joshua Sunshine, Éric Tanter, and Roger Wolff. Permission-based programming languages. In International Conference on Software Engineering (ICSE), pages 828-831, May 2011. [ bib | .pdf ]
[40] Jonathan Aldrich, Joshua Sunshine, Darpan Saini, and Zachary Sparks. Typestate-oriented programming. In Companion to Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 1015-1022, October 2009. [ bib | .pdf ]
[41] Paulo Sérgio Almeida. Balloon types: Controlling sharing of state in data types. In European Conference on Object-Oriented Programming (ECOOP), volume 1241 of Lecture Notes in Computer Science, pages 32-59. Springer, June 1997. [ bib | http ]
[42] Thorsten Altenkirch, Nils Anders Danielsson, Andres Löh, and Nicolas Oury. ΠΣ: Dependent types without the sugar. In Functional and Logic Programming, volume 6009 of Lecture Notes in Computer Science, pages 40-55. Springer, April 2010. [ bib | .pdf ]
[43] Thorsten Altenkirch, Conor McBride, and James McKinna. Why dependent types matter. Unpublished, April 2005. [ bib | .pdf ]
[44] Thorsten Altenkirch and Bernhard Reus. Monadic presentations of lambda terms using generalized inductive types. In Computer Science Logic, volume 1683 of Lecture Notes in Computer Science, pages 453-468. Springer, 1999. [ bib | .pdf ]
[45] Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, September 1993. [ bib | .pdf ]
[46] Pierre America and Jan Rutten. Solving reflexive domain equations in a category of complete metric spaces. In Mathematical Foundations of Programming Semantics, volume 298 of Lecture Notes in Computer Science, pages 254-288. Springer, 1988. [ bib | http ]
[47] Henrik Reif Andersen. Model checking and Boolean graphs. Theoretical Computer Science, 126(1):3-30, 1994. [ bib | http ]
[48] T. Anderson, J. Eve, and J. J. Horning. Efficient LR(1) parsers. Acta Informatica, 2:12-39, 1973. [ bib | http ]
[49] Gregory R. Andrews. Foundations of multithreaded, parallel, and distributed programming. Addison-Wesley, 2000. [ bib ]
[50] Gregory R. Andrews and Richard P. Reitman. An axiomatic approach to information flow in programs. ACM Transactions on Programming Languages and Systems, 2(1):56-76, January 1980. [ bib ]
[51] Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Academic Press, 1986. [ bib ]
[52] Maria-Virginia Aponte and Roberto Di Cosmo. Type isomorphisms for module signatures. In Programming Languages: Implementations, Logics, and Programs (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334-346. Springer, September 1996. [ bib | http ]
[53] Andrew Appel. Modern compiler implementation in ML. Cambridge University Press, 1998. [ bib | http ]
[54] Andrew W. Appel. VeriSmall: Verified Smallfoot shape analysis. In Certified Programs and Proofs, volume 7086 of Lecture Notes in Computer Science, pages 231-246. Springer, December 2011. [ bib | .pdf ]
[55] Andrew W. Appel and Trevor Jim. Shrinking lambda expressions in linear time. Journal of Functional Programming, 7(5):515-540, 1997. [ bib | .ps.gz ]
[56] Andrew W. Appel, Paul-André Melliès, Christopher D. Richards, and Jérôme Vouillon. A very modal model of a modern, major, general type system. In Principles of Programming Languages (POPL), pages 109-122, January 2007. [ bib | .pdf ]
[57] Krzysztof R. Apt. Ten years of Hoare's logic: A survey-part I. ACM Transactions on Programming Languages and Systems, 3(4):431-483, 1981. [ bib | http ]
[58] Zena M. Ariola and Jan Willem Klop. Equational term graph rewriting. Fundamenta Informaticæ, 26(3-4):207-240, 1996. [ bib | .ps.Z ]
[59] André Arnold and Paul Crubillé. A linear algorithm to solve fixed-point equations on transition systems. Information Processing Letters, 29(2):57-66, 1988. [ bib | http ]
[60] André Arnold and Maurice Nivat. The metric space of infinite trees. Algebraic and topological properties. Fundamenta Informaticæ, 3(4):181-205, 1980. [ bib ]
[61] Robert Atkey. Parameterised notions of computation. Journal of Functional Programming, 19(3-4):355-376, 2009. [ bib | .pdf ]
[62] Robert Atkey. Syntax for free: representing syntax with binding using parametricity. In Typed Lambda Calculi and Applications (TLCA), volume 5608 of Lecture Notes in Computer Science, pages 35-49. Springer, July 2009. [ bib | .pdf ]
[63] Robert Atkey. Amortised resource analysis with separation logic. In European Symposium on Programming (ESOP), volume 6012 of Lecture Notes in Computer Science, pages 85-103. Springer, 2010. [ bib | .pdf ]
[64] Robert Atkey, Sam Lindley, and Jeremy Yallop. Unembedding domain-specific languages. In Haskell symposium, pages 37-48, September 2009. [ bib | .pdf ]
[65] Lennart Augustsson. Implementing Haskell overloading. In Functional Programming Languages and Computer Architecture (FPCA), pages 65-73, 1993. [ bib | .ps.Z ]
[66] Jean-Michel Autebert. Théorie des langages et des automates. Masson, 1994. [ bib ]
[67] Jean-Michel Autebert, Jean Berstel, and Luc Boasson. Context-free languages and push-down automata. In Handbook of Formal Languages, volume 1, pages 111-174. Springer, 1997. [ bib | .ps.gz ]
[68] John Aycock and Nigel Horspool. Simple generation of static single-assignment form. In Compiler Construction (CC), volume 1781 of Lecture Notes in Computer Science. Springer, March 2000. [ bib | .ps ]
[69] Brian Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, and Stephanie Weirich. Engineering formal metatheory. In Principles of Programming Languages (POPL), pages 3-15, January 2008. [ bib | .pdf ]
[70] Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, and Steve Zdancewic. Mechanized metatheory for the masses: The PoplMark challenge. In Theorem Proving in Higher Order Logics (TPHOLs), volume 3603 of Lecture Notes in Computer Science, pages 50-65. Springer, August 2005. [ bib | .pdf ]
[71] Henry G. Baker. Unify and conquer (garbage, updating, aliasing, ...) in functional languages. In ACM Symposium on Lisp and Functional Programming (LFP), pages 218-226, June 1990. [ bib | .ps.gz ]
[72] Thibaut Balabonski, François Pottier, and Jonathan Protzenko. Type soundness and race freedom for Mezzo. In Proceedings of the 12th International Symposium on Functional and Logic Programming (FLOPS 2014), volume 8475 of Lecture Notes in Computer Science, pages 253-269. Springer, June 2014. [ bib | .pdf ]
[73] Vincent Balat, Roberto Di Cosmo, and Marcelo Fiore. Remarks on isomorphisms in typed lambda calculi with empty and sum type. In Logic in Computer Science (LICS), July 2002. [ bib | .ps.gz ]
[74] Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. Region analysis and the polymorphic lambda calculus. In Logic in Computer Science (LICS), pages 88-97, July 1999. [ bib | .pdf ]
[75] Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. Design and correctness of program transformations based on control-flow analysis. In International Symposium on Theoretical Aspects of Computer Software (TACS), volume 2215 of Lecture Notes in Computer Science, pages 420-447. Springer, October 2001. [ bib | .ps.gz ]
[76] Anindya Banerjee and David Naumann. Secure information flow and pointer confinement in a Java-like language. In IEEE Computer Security Foundations Workshop, pages 253-267, June 2002. [ bib | .ps ]
[77] Anindya Banerjee and David A. Naumann. A simple semantics and static analysis for Java security. Technical Report 2001-1, Stevens Institute of Technology, June 2001. [ bib | .ps ]
[78] Anindya Banerjee and David A. Naumann. Representation independence, confinement, and access control. In Principles of Programming Languages (POPL), pages 166-177, January 2002. [ bib | .ps ]
[79] Anindya Banerjee and David A. Naumann. State based ownership, reentrance, and encapsulation. In European Conference on Object-Oriented Programming (ECOOP), volume 3586 of Lecture Notes in Computer Science, pages 387-411. Springer, July 2005. [ bib | .pdf ]
[80] Jean-Pierre Banâtre, Ciarán Bryce, and Daniel Le Métayer. Compile-time detection of information flow in sequential programs. In European Symposium on Research in Computer Security, volume 875 of Lecture Notes in Computer Science, pages 55-74. Springer, 1994. [ bib | .ps.Z ]
[81] Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Science, School of Informatics at the University of Edinburgh, September 1996. [ bib | http ]
[82] Henk P. Barendregt. The lambda calculus, its syntax and semantics. Elsevier Science, 1984. [ bib | http ]
[83] Henk P. Barendregt. Functional programming and lambda calculus. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 321-363. Elsevier Science, 1990. [ bib ]
[84] Erik Barendsen and Sjaak Smetsers. Uniqueness type inference. In Programming Languages: Implementations, Logics, and Programs (PLILP), volume 982 of Lecture Notes in Computer Science, pages 189-206. Springer, 1995. [ bib | http ]
[85] Mike Barnett, Rob DeLine, Manuel Fähndrich, K. Rustan M. Leino, and Wolfram Schulte. Verification of object-oriented programs with invariants. Journal of Object Technology, 3(6), 2004. [ bib | http ]
[86] Mike Barnett, K. Rustan M. Leino, and Wolfram Schulte. The Spec# programming system: An overview. In Construction and Analysis of Safe, Secure and Interoperable Smart devices (CASSIS), volume 3362 of Lecture Notes in Computer Science, pages 49-69. Springer, 2004. [ bib | .pdf ]
[87] Mike Barnett, David A. Naumann, Wolfram Schulte, and Qi Sun. 99.44% pure: Useful abstractions in specifications. In Formal Techniques for Java-like Programs, 2004. [ bib | .pdf ]
[88] Chris Barrett, Riko Jacob, and Madhav Marathe. Formal language constrained path problems. SIAM Journal on Computing, 30(3):809-837, 2000. [ bib | .ps.gz ]
[89] Frank Bartels, Friedrich von Henke, Holger Pfeifer, and Harald Rueß. Mechanizing domain theory. Ulmer Informatik-Berichte 96-10, Universität Ulm, Fakultät für Informatik, 1996. [ bib | .ps.gz ]
[90] Aditi Barthwal and Michael Norrish. Verified, executable parsing. In European Symposium on Programming (ESOP), volume 5502 of Lecture Notes in Computer Science, pages 160-174. Springer, 2009. [ bib | .pdf ]
[91] Massimo Bartoletti, Pierpaolo Degano, and GianLuigi Ferrari. Static analysis for stack inspection. In International Workshop on Concurrency and Coordination, volume 54 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2001. [ bib ]
[92] Mike Beaven and Ryan Stansifer. Explaining type errors in polymorphic languages. ACM Letters on Programming Languages and Systems, 2(4):17-30, March 1993. [ bib | .ps.gz ]
[93] C. J. Bell, Robert Dockins, Aquinas Hobor, Andrew W. Appel, and David Walker. Comparing semantic and syntactic methods in mechanized proof frameworks. In International Workshop on Proof-Carrying Code (PCC), June 2008. [ bib | .pdf ]
[94] D. E. Bell and Leonard J. LaPadula. Secure computer systems: Unified exposition and Multics interpretation. Technical Report MTR-2997, The MITRE Corp., July 1975. [ bib | .pdf ]
[95] Jeffrey M. Bell, Françoise Bellegarde, and James Hook. Type-driven defunctionalization. In International Conference on Functional Programming (ICFP), August 1997. [ bib | http ]
[96] Josh Berdine, Cristiano Calcagno, and Peter W. O'Hearn. A decidable fragment of separation logic. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 3328 of Lecture Notes in Computer Science, pages 97-109. Springer, December 2004. [ bib | .pdf ]
[97] Josh Berdine, Cristiano Calcagno, and Peter W. O'Hearn. Smallfoot: Modular automatic assertion checking with separation logic. In Formal Methods for Components and Objects, volume 4111 of Lecture Notes in Computer Science, pages 115-137. Springer, November 2005. [ bib | .pdf ]
[98] Josh Berdine, Cristiano Calcagno, and Peter W. O'Hearn. Symbolic execution with separation logic. In Asian Symposium on Programming Languages and Systems (APLAS), volume 3780 of Lecture Notes in Computer Science, pages 52-68. Springer, 2005. [ bib ]
[99] Josh Berdine and Peter W. O'Hearn. Strong update, disposal, and encapsulation in bunched typing. In Mathematical Foundations of Programming Semantics, volume 158 of Electronic Notes in Theoretical Computer Science, pages 81-98. Elsevier Science, May 2006. [ bib | .pdf ]
[100] Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, and Hayo Thielecke. Linear continuation-passing. Higher-Order and Symbolic Computation, 15(2-3):181-208, 2002. [ bib | .pdf ]
[101] Martin Berger, Kohei Honda, and Nobuko Yoshida. A logical analysis of aliasing in imperative higher-order functions. In International Conference on Functional Programming (ICFP), pages 280-293, September 2005. [ bib | http ]
[102] K. Bernstein and E. W. Stark. Debugging type errors. Unpublished, November 1995. [ bib | .ps.gz ]
[103] Bernard Berthomieu and Camille le Moniès de Sagazan. A calculus of tagged types, with applications to process languages. In Workshop on Types for Program Analysis, pages 1-15, May 1995. [ bib | .ps.gz ]
[104] Frédéric Besson, Thomas de Grenier de Latour, and Thomas Jensen. Secure calling contexts for stack inspection. In Principles and Practice of Declarative Programming (PPDP), pages 76-87, October 2002. [ bib | .pdf ]
[105] Frédéric Besson, Thomas P. Jensen, Daniel Le Métayer, and Tommy Thorn. Model checking security properties of control flow graphs. Journal of Computer Security, 9(3):217-250, 2001. [ bib | .pdf ]
[106] Achyutram Bhamidipaty and Todd A. Proebsting. Very fast YACC-compatible parsers (for very little effort). Software - Practice & Experience, 28(2):181-190, February 1998. [ bib | .ps ]
[107] Karthik Bhargavan, Cédric Fournet, and Andy Gordon. Modular verification of security protocol code by typing. In Principles of Programming Languages (POPL), pages 445-456, January 2010. [ bib | .pdf ]
[108] Karthik Bhargavan, Cédric Fournet, Andy Gordon, Sergio Maffeis, and Jesper Bengtson. The F7 typechecker, 2011. http://research.microsoft.com/en-us/projects/f7/. [ bib | http ]
[109] Girish Bhat and Rance Cleaveland. Efficient local model-checking for fragments of the modal μ-calculus. In Tools and Algorithms for Construction and Analysis of Systems (TACAS), volume 1055 of Lecture Notes in Computer Science, pages 107-126. Springer, March 1996. [ bib | .ps.gz ]
[110] Armin Biere, Alessandro Cimatti, Edmund Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for Construction and Analysis of Systems (TACAS), volume 1579 of Lecture Notes in Computer Science, pages 193-207. Springer, March 1999. [ bib | .pdf ]
[111] Kevin Bierhoff and Jonathan Aldrich. Modular typestate checking of aliased objects. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 301-320, October 2007. [ bib | .pdf ]
[112] Kevin Bierhoff, Nels E. Beckman, and Jonathan Aldrich. Practical API protocol checking with access permissions. In European Conference on Object-Oriented Programming (ECOOP), volume 5653 of Lecture Notes in Computer Science, pages 195-219. Springer, July 2009. [ bib | .pdf ]
[113] Kevin Bierhoff, Nels E. Beckman, and Jonathan Aldrich. Checking concurrent typestate with access permissions in Plural: A retrospective. In Peri L. Tarr and Alexander L. Wolf, editors, Engineering of Software, pages 35-48. Springer, 2011. [ bib | .pdf ]
[114] Bodil Biering, Lars Birkedal, and Noah Torp-Smith. BI hyperdoctrines and higher-order separation logic. In European Symposium on Programming (ESOP), volume 3444 of Lecture Notes in Computer Science, pages 233-247. Springer, April 2005. [ bib | .pdf ]
[115] Richard Bird and Lambert Meertens. Nested datatypes. In Mathematics of Program Construction (MPC), volume 1422 of Lecture Notes in Computer Science, pages 52-67. Springer, 1998. [ bib | .ps ]
[116] Richard Bird and Ross Paterson. de Bruijn notation as a nested datatype. Journal of Functional Programming, 9(1):77-91, January 1999. [ bib | http ]
[117] Richard S. Bird and John Hughes. The alpha-beta algorithm: An exercise in program transformation. Information Processing Letters, 24(1):53-57, 1987. [ bib | http ]
[118] Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Kristian Støvring, Jacob Thamsborg, and Hongseok Yang. Step-indexed Kripke models over recursive worlds. In Principles of Programming Languages (POPL), pages 119-132, January 2011. [ bib | .pdf ]
[119] Lars Birkedal, Nick Rothwell, Mads Tofte, and David N. Turner. The ML kit (version 1). Technical Report DIKU 93/14, Department of Computer Science, University of Copenhagen, 1993. [ bib | http ]
[120] Lars Birkedal, Jan Schwinghammer, and Kristian Støvring. A metric model of lambda calculus with guarded recursion. Presented at FICS 2010, July 2010. [ bib | .pdf ]
[121] Lars Birkedal, Kristian Støvring, and Jacob Thamsborg. The category-theoretic solution of recursive metric-space quations. Technical Report ITU-2009-119, IT University of Copenhagen, 2009. [ bib | .pdf ]
[122] Lars Birkedal, Kristian Støvring, and Jacob Thamsborg. Realizability semantics of parametric polymorphism, general references, and recursive types. In Foundations of Software Science and Computation Structures (FOSSACS), volume 5504 of Lecture Notes in Computer Science, pages 456-470. Springer, March 2009. [ bib | .pdf ]
[123] Lars Birkedal, Kristian Støvring, and Jacob Thamsborg. Realisability semantics of parametric polymorphism, general references, and recursive types. Mathematical Structures in Computer Science, 20(4):655-703, 2010. [ bib | .pdf ]
[124] Lars Birkedal and Mads Tofte. A constraint-based region inference algorithm. Theoretical Computer Science, 258:299-392, 2001. [ bib | .ps.gz ]
[125] Lars Birkedal, Noah Torp-Smith, and Hongseok Yang. Semantics of separation-logic typing and higher-order frame rules for Algol-like languages. Logical Methods in Computer Science, 2(5), November 2006. [ bib | http ]
[126] Andrew D. Birrell. An introduction to programming with C# threads. Manuscript, 2003. [ bib | .pdf ]
[127] Sandip K. Biswas. Dynamic slicing in higher-order programming languages. PhD thesis, University of Pennsylvania, August 1997. [ bib ]
[128] Frédéric Blanqui and Adam Koprowski. CoLoR: a coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. Mathematical Structures in Computer Science, 21(4):827-859, August 2011. [ bib | .pdf ]
[129] Chiara Bodei, Pierpaolo Degano, Flemming Nielson, and Hanne Riis Nielson. Static analysis of processes for no read-up and no write-down. In Foundations of Software Science and Computation Structures (FOSSACS), volume 1578 of Lecture Notes in Computer Science, pages 120-134. Springer, March 1999. [ bib | .ps ]
[130] Hans-J. Boehm and Sarita V. Adve. You don't know jack about shared variables or memory models. Communications of the ACM, 55(2):48-54, February 2012. [ bib | http ]
[131] Daniel Bonniot. Type-checking multi-methods in ML (a modular approach). In Foundations of Object-Oriented Languages (FOOL), January 2002. [ bib | .ps ]
[132] Urban Boquist. Code optimisation techniques for lazy functional languages. PhD thesis, Chalmers University of Technology, April 1999. [ bib | .ps.gz ]
[133] Michele Boreale and Davide Sangiorgi. A fully abstract semantics for causality in the π-calculus. Acta Informatica, 35(5):353-400, May 1998. [ bib | .pdf ]
[134] Johannes Borgström, Juan Chen, , and Nikhil Swamy. Verified stateful programs with substructural state and Hoare types. In Programming Languages Meets Program Verification (PLPV), January 2011. [ bib | .pdf ]
[135] Richard Bornat. Proving pointer programs in Hoare logic. In Mathematics of Program Construction (MPC), volume 1837 of Lecture Notes in Computer Science, pages 102-126. Springer, 2000. [ bib | .pdf ]
[136] Richard Bornat, Cristiano Calcagno, Peter O'Hearn, and Matthew Parkinson. Permission accounting in separation logic. In Principles of Programming Languages (POPL), pages 259-270, January 2005. [ bib | .pdf ]
[137] Gérard Boudol. Typing termination in a higher-order concurrent imperative language. Information and Computation, 2009. To appear. [ bib | .pdf ]
[138] Gérard Boudol and Ilaria Castellani. Non-interference for concurrent programs and thread systems. To appear, September 2001. [ bib | .ps.gz ]
[139] Sylvain Boulmé. Intuitionistic refinement calculus. In Typed Lambda Calculi and Applications (TLCA), volume 4583 of Lecture Notes in Computer Science, pages 54-69. Springer, June 2007. [ bib | .pdf ]
[140] François Bourdoncle and Stephan Merz. On the integration of functional programming, class-based object-oriented programming, and multi-methods. Research Report 26, Centre de Mathématiques Appliquées, Ecole des Mines de Paris, March 1996. [ bib | .html ]
[141] François Bourdoncle and Stephan Merz. Type checking higher-order polymorphic multi-methods. In Principles of Programming Languages (POPL), pages 302-315, January 1997. [ bib | .html ]
[142] Chandrasekhar Boyapati, Robert Lee, and Martin Rinard. Ownership types for safe programming: preventing data races and deadlocks. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 211-230, November 2002. [ bib | http ]
[143] Chandrasekhar Boyapati, Barbara Liskov, and Liuba Shrira. Ownership types for object encapsulation. In Principles of Programming Languages (POPL), pages 213-223, January 2003. [ bib | .pdf ]
[144] John Boyland. Alias burying: Unique variables without destructive reads. Science of Computer Programming, 31(6):533-553, May 2001. [ bib | .ps ]
[145] John Boyland. Checking interference with fractional permissions. In Static Analysis Symposium (SAS), volume 2694 of Lecture Notes in Computer Science, pages 55-72. Springer, June 2003. [ bib | .pdf ]
[146] John Tang Boyland. Semantics of fractional permissions with nesting. ACM Transactions on Programming Languages and Systems, 32(6), 2010. [ bib | .html ]
[147] John Tang Boyland and William Retert. Connecting effects and uniqueness with adoption. In Principles of Programming Languages (POPL), pages 283-295, January 2005. [ bib | .pdf ]
[148] Gilad Bracha and William Cook. Mixin-based inheritance. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 303-311, 1990. [ bib | .ps ]
[149] Gilad Bracha and Gary Lindstrom. Modularity meets inheritance. Technical Report UUCS-91-017, University of Utah, October 1991. [ bib | .ps ]
[150] Aaron R. Bradley and Zohar Manna. The calculus of computation. Springer, 2007. [ bib | http ]
[151] Thomas Braibant and Damien Pous. Tactics for reasoning modulo AC in Coq. In Certified Programs and Proofs, volume 7086 of Lecture Notes in Computer Science, pages 167-182. Springer, 2011. [ bib | http ]
[152] Marc M. Brandis and Hanspeter Mössenböck. Single-pass generation of static single-assignment form for structured languages. ACM Transactions on Programming Languages and Systems, 16(6):1684-1698, 1994. [ bib | .ps.gz ]
[153] Michael Brandt and Fritz Henglein. Coinductive axiomatization of recursive type equality and subtyping. Fundamenta Informaticæ, 33:309-338, 1998. [ bib | .ps.gz ]
[154] Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172-221, July 1991. [ bib | .pdf ]
[155] Stephen D. Brookes. A semantics for concurrent separation logic. In International Conference on Concurrency Theory (CONCUR), volume 3170 of Lecture Notes in Computer Science, pages 16-34. Springer, August 2004. [ bib | http ]
[156] James Brotherston, Dino Distefano, and Rasmus Lerchedahl Petersen. Automated cyclic entailment proofs in separation logic. In International Conference on Automated Deduction (CADE), volume 6803 of Lecture Notes in Computer Science, pages 131-146. Springer, July 2011. [ bib | .pdf ]
[157] Kim Bruce, Luca Cardelli, Giuseppe Castagna, The Hopkins Object Group, Gary T. Leavens, and Benjamin Pierce. On binary methods. Technical Report 95-08a, Department of Computer Science, Iowa State University, December 1995. [ bib | .ps.Z ]
[158] Kim Bruce, Roberto Di Cosmo, and Giuseppe Longo. Provable isomorphisms of types. Mathematical Structures in Computer Science, 2(2):231-247, 1992. [ bib | .dvi ]
[159] Kim B. Bruce, Luca Cardelli, and Benjamin C. Pierce. Comparing object encodings. Information and Computation, 155(1/2):108-133, November 1999. [ bib | .ps ]
[160] Michele Bugliesi and Silvia Crafa. Object calculi for dynamic messages. In Foundations of Object-Oriented Languages (FOOL), 1999. [ bib ]
[161] Michele Bugliesi and Santiago M. Pericás-Geertsen. Type inference for variant object types. Information and Computation, 177(1):2-27, August 2002. [ bib | .ps.gz ]
[162] Alexandre Buisse, Lars Birkedal, and Kristian Støvring. A step-indexed Kripke model of separation logic for storable locks. Electronic Notes in Theoretical Computer Science, 276:121-143, September 2011. [ bib | .pdf ]
[163] Peter Buneman and Atsushi Ohori. Polymorphism and type inference in database programming. ACM Transactions on Database Systems, 21(1):30-76, 1996. [ bib | .pdf ]
[164] Lilian Burdy, Yoonsik Cheon, David Cok, Michael Ernst, Joe Kiniry, Gary T. Leavens, K. Rustan M. Leino, and Erik Poll. An overview of JML tools and applications. International Journal on Software Tools for Technology Transfer, 7(3):212-232, June 2005. [ bib | .pdf ]
[165] R. M. Burstall, D. B. MacQueen, and D. T. Sannella. HOPE: An experimental applicative language. In ACM Symposium on Lisp and Functional Programming (LFP), pages 136-143, 1980. [ bib | http ]
[166] Jiazhen Cai and Robert Paige. Program derivation by fixed point computation. Science of Computer Programming, 11(3):197-261, 1989. [ bib | .ps ]
[167] Luís Caires and João Costa Seco. The type discipline of behavioral separation. In Principles of Programming Languages (POPL), pages 275-286, January 2013. [ bib | http ]
[168] Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, and Hongseok Yang. Compositional shape analysis by means of bi-abduction. In Principles of Programming Languages (POPL), pages 289-300, January 2009. [ bib | .pdf ]
[169] Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, and Hongseok Yang. Compositional shape analysis by means of bi-abduction. Journal of the ACM, 58(6), 2011. [ bib | .pdf ]
[170] Cristiano Calcagno, Dino Distefano, and Viktor Vafeiadis. Bi-abductive resource invariant synthesis. In Asian Symposium on Programming Languages and Systems (APLAS), volume 5904 of Lecture Notes in Computer Science, pages 259-274. Springer, December 2009. [ bib | .pdf ]
[171] Cristiano Calcagno, Simon Helsen, and Peter Thiemann. Syntactic type soundness results for the region calculus. Information and Computation, 173(2):199-221, 2002. [ bib | .pdf ]
[172] Cristiano Calcagno, Eugenio Moggi, and Tim Sheard. Closed types for a safe imperative MetaML. Journal of Functional Programming, 13(3):545-571, May 2003. [ bib | http ]
[173] Cristiano Calcagno, Eugenio Moggi, and Walid Taha. ML-like inference for classifiers. In European Symposium on Programming (ESOP), volume 2986 of Lecture Notes in Computer Science, pages 79-93. Springer, 2004. [ bib | .pdf ]
[174] Cristiano Calcagno, Peter W. O'Hearn, and Hongseok Yang. Local action and abstract separation logic. In Logic in Computer Science (LICS), pages 366-378, July 2007. [ bib | .pdf ]
[175] Luca Cardelli. Basic polymorphic typechecking. Science of Computer Programming, 8(2):147-172, 1987. [ bib | .pdf ]
[176] Luca Cardelli. A semantics of multiple inheritance. Information and Computation, 76(2/3):138-164, February 1988. [ bib | .pdf ]
[177] Luca Cardelli. Typeful programming. In Formal Description of Programming Concepts, IFIP State of the Art Reports Series. Springer, February 1989. [ bib | .pdf ]
[178] Luca Cardelli. The Quest language and system, 1991. [ bib | .pdf ]
[179] Luca Cardelli. Type systems. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook, pages 2208-2236. CRC Press, 1997. [ bib | .pdf ]
[180] Luca Cardelli and Giuseppe Longo. A semantic basis for Quest. Journal of Functional Programming, 1(4):417-458, October 1991. [ bib | .pdf ]
[181] Luca Cardelli, Florian Matthes, and Martín Abadi. Extensible syntax with lexical scoping. Research Report 121, Digital Equipment Corporation, Systems Research Center, February 1994. [ bib | .ps.gz ]
[182] Luca Cardelli and John Mitchell. Operations on records. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming: Types, Semantics and Language Design. MIT Press, 1994. [ bib | .pdf ]
[183] Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. ACM Computing Surveys, 17(4):471-522, December 1985. [ bib | .pdf ]
[184] Felice Cardone. A coinductive completeness proof for the equivalence of recursive types. Theoretical Computer Science, 275(1-2):575-587, 2002. [ bib | http ]
[185] Felice Cardone and Mario Coppo. Type inference with recursive types: syntax and semantics. Information and Computation, 92(1):48-80, 1991. [ bib | http ]
[186] Jacques Carette. Gaussian elimination: a case study in efficient genericity with MetaOCaml. Science of Computer Programming, 62(1):3-24, September 2005. [ bib | .pdf ]
[187] Jacques Carette, Oleg Kiselyov, and Chung chieh Shan. Finally tagless, partially evaluated. In Asian Symposium on Programming Languages and Systems (APLAS), volume 4807 of Lecture Notes in Computer Science, pages 222-238. Springer, November 2007. [ bib | .pdf ]
[188] Sébastien Carlier, Jeff Polakow, J. B. Wells, and A. J. Kfoury. System E: Expansion variables for flexible typing with linear and non-linear types and intersection types. In European Symposium on Programming (ESOP), Lecture Notes in Computer Science. Springer, 2004. [ bib | .pdf ]
[189] Sébastien Carlier and J. B. Wells. Type inference with expansion variables and intersection types in System E and an exact correspondence with β-reduction. Technical Report HW-MACS-TR-0012, Heriot-Watt University, January 2004. [ bib | .pdf ]
[190] Robert Cartwright. Notes on object-oriented program design, January 2000. [ bib | http ]
[191] Giuseppe Castagna. F<=& : integrating parametric and “ad hoc” second order polymorphism. In International Workshop on Database Programming Languages, Workshops in Computing. Springer, September 1993. [ bib ]
[192] Giuseppe Castagna. Covariance and contravariance: Conflict without a cause. ACM Transactions on Programming Languages and Systems, 17(3):431-447, May 1995. [ bib | .ps.Z ]
[193] Giuseppe Castagna and Alain Frisch. A gentle introduction to semantic subtyping. In Principles and Practice of Declarative Programming (PPDP), pages 198-199, July 2005. [ bib | .pdf ]
[194] Henry Cejtin, Matthew Fluet, Suresh Jagannathan, and Stephen Weeks. The MLton compiler, 2007. [ bib | http ]
[195] Henry Cejtin, Suresh Jagannathan, and Stephen Weeks. Flow-directed closure conversion for typed languages. In European Symposium on Programming (ESOP), volume 1782 of Lecture Notes in Computer Science, pages 56-71. Springer, March 2000. [ bib | .ps.gz ]
[196] Craig Chambers and Gary T. Leavens. BeCecil, a core object-oriented language with block structure and multimethods: Semantics and typing. Technical Report UW-CSE-96-12-02, University of Washington, December 1996. [ bib | .ps.gz ]
[197] Bor-Yuh Evan Chang and Xavier Rival. Relational inductive shape analysis. In Principles of Programming Languages (POPL), pages 247-260, January 2008. [ bib | .pdf ]
[198] Arthur Charguéraud. Program verification through characteristic formulae. In International Conference on Functional Programming (ICFP), September 2010. [ bib | http ]
[199] Arthur Charguéraud. The locally nameless representation. Journal of Automated Reasoning, 49(3):363-408, 2012. [ bib | .pdf ]
[200] Arthur Charguéraud. Characteristic formulae for mechanized program verification. PhD thesis, Université Paris 7, December 2010. [ bib | http ]
[201] Arthur Charguéraud and François Pottier. Functional translation of a calculus of capabilities. In International Conference on Functional Programming (ICFP), pages 213-224, September 2008. [ bib | .pdf ]
[202] Chih-Ping Chen and Paul Hudak. Rolling your own mutable ADT-a connection between linear types and monads. In Principles of Programming Languages (POPL), pages 54-66, January 1997. [ bib | .ps ]
[203] Chiyan Chen, Rui Shi, and Hongwei Xi. A typeful approach to object-oriented programming with multiple inheritance. In Practical Aspects of Declarative Languages (PADL), volume 3057 of Lecture Notes in Computer Science. Springer, June 2004. [ bib | .pdf ]
[204] Chiyan Chen and Hongwei Xi. Implementing typeful program transformations. In ACM Workshop on Evaluation and Semantics-Based Program Manipulation (PEPM), pages 20-28, June 2003. [ bib | .pdf ]
[205] Chiyan Chen and Hongwei Xi. Meta-programming through typeful code representation. In International Conference on Functional Programming (ICFP), pages 275-286, August 2003. [ bib | .pdf ]
[206] Chiyan Chen and Hongwei Xi. Combining programming with theorem proving. In International Conference on Functional Programming (ICFP), pages 66-77, September 2005. [ bib | .pdf ]
[207] Juan Chen and David Tarditi. A simple typed intermediate language for object-oriented languages. In Principles of Programming Languages (POPL), pages 38-49, January 2005. [ bib | .pdf ]
[208] James Cheney. Scrap your nameplate. In International Conference on Functional Programming (ICFP), September 2005. [ bib | .pdf ]
[209] James Cheney and Ralf Hinze. A lightweight implementation of generics and dynamics. In Haskell workshop, 2002. [ bib | .pdf ]
[210] James Cheney and Ralf Hinze. First-class phantom types. Technical Report 1901, Cornell University, 2003. [ bib | http ]
[211] James Cheney and Christian Urban. αProlog: A logic programming language with names, binding and α-equivalence. In International Conference on Logic Programming (ICLP), volume 3132 of Lecture Notes in Computer Science, pages 269-283. Springer, September 2004. [ bib | .pdf ]
[212] Wei-Ngan Chin and Siau-Cheng Khoo. Calculating sized types. Higher-Order and Symbolic Computation, 14(2-3):261-300, September 2001. [ bib | http ]
[213] Olaf Chitil. Compositional explanation of types and algorithmic debugging of type errors. In International Conference on Functional Programming (ICFP), pages 193-204, September 2001. [ bib | .ps.gz ]
[214] Adam Chlipala. A certified type-preserving compiler from lambda calculus to assembly language. In Programming Language Design and Implementation (PLDI), pages 54-65, June 2007. [ bib | .pdf ]
[215] Adam Chlipala. Parametric higher-order abstract syntax for mechanized semantics. In International Conference on Functional Programming (ICFP), pages 143-156, September 2008. [ bib | .pdf ]
[216] Adam Chlipala. Certified programming and dependent types. MIT Press, November 2013. [ bib | http ]
[217] Adam Chlipala, Gregory Malecha, Greg Morrisett, Avraham Shinnar, and Ryan Wisnesky. Effective interactive proofs for higher-order imperative programs. In International Conference on Functional Programming (ICFP), pages 79-90, September 2009. [ bib | .pdf ]
[218] Venkatesh Choppella. Unification source-tracking with application to diagnosis of type inference. PhD thesis, Indiana University, August 2002. [ bib | http ]
[219] Dave Clarke and Sophia Drossopoulou. Ownership, encapsulation and the disjointness of type and effect. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 292-310, November 2002. [ bib | .ps ]
[220] Dave Clarke, Sophia Drossopoulou, and James Noble. Aliasing, confinement, and ownership in object-oriented programming. In Object-Oriented Technology. ECOOP 2003 Workshop Reader, volume 3013 of Lecture Notes in Computer Science, pages 197-207. Springer, 2004. [ bib | http ]
[221] Dave Clarke, Johan Östlund, Ilya Sergey, and Tobias Wrigstad. Ownership types: A survey. In Aliasing in Object-Oriented Programming, volume 7850 of Lecture Notes in Computer Science, pages 15-58. Springer, 2013. [ bib | http ]
[222] Dave Clarke and Tobias Wrigstad. External uniqueness is unique enough. In European Conference on Object-Oriented Programming (ECOOP), volume 2743 of Lecture Notes in Computer Science, pages 176-200. Springer, July 2003. [ bib | .pdf ]
[223] David G. Clarke, James Noble, and John Potter. Simple ownership types for object containment. In European Conference on Object-Oriented Programming (ECOOP), volume 2072 of Lecture Notes in Computer Science, pages 53-76. Springer, June 2001. [ bib | .pdf ]
[224] David G. Clarke, John M. Potter, and James Noble. Ownership types for flexible alias protection. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 48-64, October 1998. [ bib | http ]
[225] Edmund Clarke. Programming language constructs for which it is impossible to obtain good Hoare axiom systems. Journal of the ACM, 26(1):129-147, January 1979. [ bib | http ]
[226] Rance Cleaveland and Bernhard Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In Computer Aided Verification, volume 575 of Lecture Notes in Computer Science, pages 48-58. Springer, 1991. [ bib | http ]
[227] Dominique Clément, Joëlle Despeyroux, Thierry Despeyroux, and Gilles Kahn. A simple applicative language: Mini-ML. In ACM Symposium on Lisp and Functional Programming (LFP), pages 13-27, 1986. [ bib ]
[228] John Clements and Matthias Felleisen. A tail-recursive semantics for stack inspections. In European Symposium on Programming (ESOP), volume 2618 of Lecture Notes in Computer Science, pages 22-37. Springer, April 2003. [ bib | .ps.gz ]
[229] Albert Cohen, Sébastien Donadio, Maria-Jesus Garzaran, Christoph Herrmann, Oleg Kiselyov, and David Padua. In search of a program generator to implement generic transformations for high-performance computing. Science of Computer Programming, 62(1):25-46, September 2006. [ bib | .ps.gz ]
[230] Ernie Cohen, Markus Dahlweid, Mark A. Hillebrand, Dirk Leinenbach, Michal Moskal, Thomas Santen, Wolfram Schulte, and Stephan Tobies. VCC: A practical system for verifying concurrent C. In Theorem Proving in Higher Order Logics (TPHOLs), volume 5674 of Lecture Notes in Computer Science, pages 23-42. Springer, 2009. [ bib | http ]
[231] Dario Colazzo and Giorgio Ghelli. Subtyping recursive types in Kernel Fun. In Logic in Computer Science (LICS), pages 137-146, July 1999. [ bib ]
[232] Gregory D. Collins and Zhong Shao. Intensional analysis of higher-kinded recursive types. Technical Report YALEU/DCS/TR-1240, Yale University, 2002. [ bib | .pdf ]
[233] Alain Colmerauer. Equations and inequations on finite and infinite trees. In International Conference on Fifth Generation Computer Systems (FGCS), pages 85-99, November 1984. [ bib ]
[234] Hubert Comon. Constraints in term algebras (short survey). In International Conference on Algebraic Methodology and Software Technology (AMAST), Workshops in Computing. Springer, 1993. [ bib | .ps ]
[235] Hubert Comon and Pierre Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371-425, 1989. [ bib | .pdf ]
[236] Sylvain Conchon and Evelyne Contejean. The Alt-Ergo automatic theorem prover, 2011. http://alt-ergo.lri.fr/. [ bib | http ]
[237] Sylvain Conchon and Fabrice Le Fessant. Jocaml: Mobile agents for Objective-Caml. In International Symposium on Agent Systems and Applications and International Symposium on Mobile Agents (ASA/MA), pages 22-29, October 1999. [ bib | .ps.gz ]
[238] Sylvain Conchon, Johannes Kanig, and Stéphane Lescuyer. Sat-Micro: petit mais costaud! In Journées Françaises des Langages Applicatifs, January 2008. [ bib | .ps ]
[239] Sylvain Conchon and François Pottier. JOIN(X): Constraint-based type inference for the join-calculus. In European Symposium on Programming (ESOP), volume 2028 of Lecture Notes in Computer Science, pages 221-236. Springer, April 2001. [ bib | .ps.gz ]
[240] Jeffrey Considine. Efficient hash-consing of recursive types. Technical Report 2000-006, Boston University, January 2000. [ bib | .pdf ]
[241] Stephen A. Cook. The complexity of theorem-proving procedures. In ACM Symposium on Theory of Computing, pages 151-158, May 1971. [ bib | http ]
[242] William R. Cook. On understanding data abstraction, revisited. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 557-572, October 2009. [ bib | .pdf ]
[243] Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy. Iterative data-flow analysis, revisited. Technical Report TR04-432, Rice University, March 2004. [ bib | .pdf ]
[244] Mario Coppo and Mariangiola Dezani-Ciancaglini. An extension of the basic functionality theory for the λ-calculus. Notre Dame J. Formal Logic, 21(4):685-693, 1980. [ bib ]
[245] Thierry Coquand. An analysis of Girard's paradox. In Logic in Computer Science (LICS), pages 227-236, June 1986. [ bib | .pdf ]
[246] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms (third edition). MIT Press, 2009. [ bib | http ]
[247] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Algorithmique (troisième Édition). Sciences Sup. Dunod, 2010. Traduction française. [ bib | http ]
[248] Bruno Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25(2):95-169, March 1983. [ bib ]
[249] Patrick Cousot. Methods and logics for proving programs. In Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, chapter 15, pages 841-993. Elsevier Science, 1990. [ bib | .pdf.gz ]
[250] Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Principles of Programming Languages (POPL), pages 238-252, January 1977. [ bib | .pdf ]
[251] Patrick Cousot and Radhia Cousot. Constructive versions of Tarski's fixed point theorems. Pacific Journal of Mathematics, 81(1):43-57, 1979. [ bib | .pdf ]
[252] Patrick Cousot and Radhia Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Functional Programming Languages and Computer Architecture (FPCA), pages 170-181. ACM Press, 1995. [ bib ]
[253] Patrick Cousot and Radhia Cousot. A gentle introduction to formal verification of computer systems by abstract interpretation. In J. Esparza, O. Grumberg, and M. Broy, editors, Logics and Languages for Reliability and Security, NATO Science Series III: Computer and Systems Sciences, pages 1-29. IOS Press, 2010. [ bib | http ]
[254] Patrick Cousot, Radhia Cousot, Jérôme Feret, Antoine Miné, and Xavier Rival. The Astrée static analyzer, 2011. http://www.astree.ens.fr/. [ bib | http ]
[255] Erik Crank and Matthias Felleisen. Parameter-passing and the lambda calculus. In Principles of Programming Languages (POPL), pages 233-244, January 1991. [ bib | .ps.gz ]
[256] Karl Crary. Type-theoretic methodology for practical programming languages. PhD thesis, Cornell University, August 1998. [ bib | .ps.gz ]
[257] Karl Crary. Simple, efficient object encoding using intersection types. Technical Report CMU-CS-99-100, Carnegie Mellon University, 1999. [ bib | .ps.gz ]
[258] Karl Crary, David Walker, and Greg Morrisett. Typed memory management in a calculus of capabilities. In Principles of Programming Languages (POPL), pages 262-275, January 1999. [ bib | .pdf ]
[259] Karl Crary and Stephanie Weirich. Flexible type analysis. In International Conference on Functional Programming (ICFP), pages 233-248, 1999. [ bib | .ps.gz ]
[260] Karl Crary and Stephanie Weirich. Resource bound certification. In Principles of Programming Languages (POPL), pages 184-198, January 2000. [ bib | .pdf ]
[261] Karl Crary, Stephanie Weirich, and Greg Morrisett. Intensional polymorphism in type-erasure semantics. In International Conference on Functional Programming (ICFP), pages 301-313, September 1998. [ bib | .ps ]
[262] Karl Crary, Stephanie Weirich, and Greg Morrisett. Intensional polymorphism in type erasure semantics. Journal of Functional Programming, 12(6):567-600, November 2002. [ bib | .ps ]
[263] Julien Cretin. Erasable coercions: a unified approach to type systems. PhD thesis, Université Paris Diderot, January 2014. [ bib | http ]
[264] Julien Cretin and Didier Rémy. On the power of coercion abstraction. In Principles of Programming Languages (POPL), pages 361-372, January 2012. [ bib | .pdf ]
[265] Pavel Curtis. Constrained quantification in polymorphic type analysis. PhD thesis, Cornell University, February 1990. [ bib | .ps.gz ]
[266] Luis Damas. Type assignment in programming languages. PhD thesis, University of Edinburgh, 1985. [ bib ]
[267] Luis Damas and Robin Milner. Principal type-schemes for functional programs. In Principles of Programming Languages (POPL), pages 207-212, 1982. [ bib | http ]
[268] Werner Damm and Bernhard Josko. A sound and relatively* complete axiomatization of Clarke's language L4. In Logic of Programs, volume 164 of Lecture Notes in Computer Science, pages 161-175. Springer, 1983. [ bib | http ]
[269] Nils Anders Danielsson. Lightweight semiformal time complexity analysis for purely functional data structures. In Principles of Programming Languages (POPL), January 2008. [ bib | .pdf ]
[270] Nils Anders Danielsson and Thorsten Altenkirch. Subtyping, declaratively. In Mathematics of Program Construction (MPC), volume 6120 of Lecture Notes in Computer Science, pages 100-118. Springer, June 2010. [ bib | .pdf ]
[271] Nils Anders Danielsson, John Hughes, Patrik Jansson, and Jeremy Gibbons. Fast and loose reasoning is morally correct. In Principles of Programming Languages (POPL), pages 206-217, January 2006. [ bib | .pdf ]
[272] Olivier Danvy. Functional unparsing. Technical Report RS-98-12, BRICS, May 1998. [ bib | http ]
[273] Olivier Danvy. Functional unparsing. Journal of Functional Programming, 8(6):621-625, November 1998. [ bib | http ]
[274] Olivier Danvy and Lasse R. Nielsen. Defunctionalization at work. Technical Report RS-01-23, BRICS, June 2001. [ bib | http ]
[275] Olivier Danvy and Lasse R. Nielsen. Defunctionalization at work. In Principles and Practice of Declarative Programming (PPDP), pages 162-174, September 2001. [ bib | http ]
[276] Thi Bich Hanh Dao. Résolution de contraintes du premier ordre dans la théorie des arbres finis ou infinis. PhD thesis, Université de la Méditerranée, December 2000. [ bib | .ps.gz ]
[277] Rowan Davies. Practical refinement-type checking. Technical Report CMU-CS-05-110, School of Computer Science, Carnegie Mellon University, May 2005. [ bib | .pdf ]
[278] Rowan Davies and Frank Pfenning. Intersection types and computational effects. In International Conference on Functional Programming (ICFP), pages 198-208, September 2000. [ bib | .pdf ]
[279] Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, 1962. [ bib | http ]
[280] Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960. [ bib | http ]
[281] Nicolaas G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381-392, 1972. [ bib ]
[282] Edsko de Vries, Rinus Plasmeijer, and David Abrahamson. Uniqueness typing redefined. In Implementation of Functional Languages (IFL), volume 4449 of Lecture Notes in Computer Science, pages 181-198. Springer, 2006. [ bib | .pdf ]
[283] Edsko de Vries, Rinus Plasmeijer, and David Abrahamson. Equality based uniqueness typing. In Trends in Functional Programming (TFP), 2007. [ bib | .pdf ]
[284] M. Debbabi, E. Giasson, B. Ktari, F. Michaud, and N. Tawbi. Secure self-certified COTS. In IEEE International Workshop on Enterprise Security (WETICE'00), June 2000. [ bib | .pdf ]
[285] Benjamin Delaware, Bruno C. d. S. Oliveira, and Tom Schrijvers. Meta-theory à la carte. In Principles of Programming Languages (POPL), pages 207-218, January 2013. [ bib | .pdf ]
[286] Benjamin Delaware, Steven Keuchel, Tom Schrijvers, and Bruno C. d. S. Oliveira. Modular monadic meta-theory. In International Conference on Functional Programming (ICFP), pages 319-330, September 2013. [ bib | .pdf ]
[287] Robert DeLine and Manuel Fähndrich. Enforcing high-level protocols in low-level software. In Programming Language Design and Implementation (PLDI), pages 59-69, June 2001. [ bib | http ]
[288] Robert DeLine and Manuel Fähndrich. The Fugue protocol checker: Is your software baroque? Technical Report MSR-TR-2004-07, Microsoft Research, January 2004. [ bib | http ]
[289] Robert DeLine and Manuel Fähndrich. Typestates for objects. In European Conference on Object-Oriented Programming (ECOOP), volume 3086 of Lecture Notes in Computer Science, pages 465-490. Springer, June 2004. [ bib | http ]
[290] Alan Demers, Susan Horwitz, and Tim Teitelbaum. An efficient general algorithm for dataflow analysis. Acta Informatica, 24(6):679-694, November 1987. [ bib | http ]
[291] Peter Dencker, Karl Dürre, and Johannes Heuft. Optimization of parser tables for portable compilers. ACM Transactions on Programming Languages and Systems, 6(4):546-572, 1984. [ bib | http ]
[292] Dorothy E. Denning. Cryptography and data security. Addison-Wesley, 1982. [ bib ]
[293] Dorothy E. Denning and Peter J. Denning. Certification of programs for secure information flow. Communications of the ACM, 20(7):504-513, July 1977. [ bib ]
[294] Greg Dennis, Felix Change, and Daniel Jackson. Modular verification of code with SAT. In International Symposium on Software Testing and Analysis (ISSTA), July 2006. [ bib | .pdf ]
[295] Frank DeRemer and Thomas Pennello. Efficient computation of LALR(1) look-ahead sets. ACM Transactions on Programming Languages and Systems, 4(4):615-649, 1982. [ bib | http ]
[296] Franklin L. DeRemer. Simple LR(k) grammars. Communications of the ACM, 14(7):453-460, 1971. [ bib | http ]
[297] David Detlefs, Greg Nelson, and James B. Saxe. Simplify: a theorem prover for program checking. Journal of the ACM, 52(3):365-473, 2005. [ bib | http ]
[298] David L. Detlefs, K. Rustan M. Leino, and Greg Nelson. Wrestling with rep exposure. Research Report 156, SRC, July 1998. [ bib | .pdf ]
[299] David L. Detlefs, K. Rustan M. Leino, Greg Nelson, and James B. Saxe. Extended static checking. Research Report 159, Compaq SRC, December 1998. [ bib | .pdf ]
[300] Roberto Di Cosmo. Deciding type isomorphisms in a type assignment framework. Journal of Functional Programming, 3(3):485-525, 1993. [ bib | .dvi ]
[301] Roberto Di Cosmo. Isomorphisms of types: from λ-calculus to information retrieval and language design. Progress in Theoretical Computer Science. Birkhauser, 1995. [ bib | .html ]
[302] Werner Dietl, Sophia Drossopoulou, and Peter Müller. Separating ownership topology and encapsulation with generic universe types. ACM Transactions on Programming Languages and Systems, 33(6):20, 2011. [ bib | .pdf ]
[303] Werner Dietl and Müller Peter. Universes: Lightweight ownership for JML. Journal of Object Technology, 4(8):5-32, 2005. [ bib | .pdf ]
[304] E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271, 1959. [ bib ]
[305] Edsger W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM, 18(8):453-457, 1975. [ bib | http ]
[306] Allyn Dimock. Type- and flow-directed compilation for specialized data representations. PhD thesis, Harvard University, January 2002. [ bib | .ps.gz ]
[307] Allyn Dimock, Ian Westmacott, Robert Muller, Franklyn Turbak, and J. B. Wells. Functioning without closure: type-safe customized function representations for Standard ML. In International Conference on Functional Programming (ICFP), September 2001. [ bib | .ps ]
[308] Thomas Dinsdale-Young, Lars Birkedal, Philippa Gardner, Matthew J. Parkinson, and Hongseok Yang. Views: compositional reasoning for concurrent programs. In Principles of Programming Languages (POPL), pages 287-300, January 2013. [ bib | .pdf ]
[309] Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Matthew Parkinson, and Viktor Vafeiadis. Concurrent abstract predicates. Technical report, University of Cambridge, Computer Laboratory, April 2010. [ bib | .pdf ]
[310] Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Matthew J. Parkinson, and Viktor Vafeiadis. Concurrent abstract predicates. In European Conference on Object-Oriented Programming (ECOOP), volume 6183 of Lecture Notes in Computer Science, pages 504-528. Springer, 2010. [ bib | .pdf ]
[311] Dino Distefano and Matthew J. Parkinson. jStar: towards practical verification for Java. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 213-226, October 2008. [ bib | .pdf ]
[312] Robert Dockins, Aquinas Hobor, and Andrew W. Appel. A fresh look at separation algebras and share accounting. In Asian Symposium on Programming Languages and Systems (APLAS), volume 5904 of Lecture Notes in Computer Science, pages 161-177. Springer, December 2009. [ bib | .pdf ]
[313] Mike Dodds, Xinyu Feng, Matthew J. Parkinson, and Viktor Vafeiadis. Deny-guarantee reasoning. In European Symposium on Programming (ESOP), volume 5502 of Lecture Notes in Computer Science, pages 363-377. Springer, March 2009. [ bib | .pdf ]
[314] Mike Dodds, Suresh Jagannathan, and Matthew J. Parkinson. Modular reasoning for deterministic parallelism. In Principles of Programming Languages (POPL), pages 259-270, January 2011. [ bib | .pdf ]
[315] Charles Donnelly and Richard Stallman. Bison, September 2005. [ bib | http ]
[316] Kevin Donnelly and Hongwei Xi. Combining higher-order abstract syntax with first-order abstract syntax in ATS. In ACM Workshop on Mechanized Reasoning about Languages with Variable Binding, pages 58-63, 2005. [ bib | .pdf ]
[317] Vincent Dornic, Pierre Jouvelot, and David K. Gifford. Polymorphic time systems for estimating program complexity. ACM Letters on Programming Languages and Systems, 1(1):33-45, 1992. [ bib | .pdf ]
[318] Gilles Dowek. Higher-order unification and matching. In J. Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, pages 1009-1062. Elsevier Science, 2001. [ bib | .ps ]
[319] Gilles Dowek, Thérèse Hardin, and Claude Kirchner. Higher order unification via explicit substitutions. Research Report 2709, INRIA, November 1995. [ bib | .html ]
[320] Gilles Dowek, Thérèse Hardin, Claude Kirchner, and Frank Pfenning. Unification via explicit substitutions: the case of higher-order patterns. Research Report 3591, INRIA, December 1998. [ bib | .html ]
[321] William F. Dowling and Jean H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1(3):267-284, 1984. [ bib ]
[322] Peter J. Downey, Ravi Sethi, and Robert Endre Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758-771, October 1980. [ bib | http ]
[323] Derek Dreyer, Georg Neis, and Lars Birkedal. The impact of higher-order state and control effects on local relational reasoning. In International Conference on Functional Programming (ICFP), pages 143-156, September 2010. [ bib | .pdf ]
[324] Catherine Dubois and Valérie Ménissier-Morain. Typage de ML: Spécification et preuve en Coq. In Actes du GDR Programmation, November 1997. [ bib | .ps.gz ]
[325] Catherine Dubois and Valérie Ménissier-Morain. Certification of a type inference tool for ML: Damas-Milner within Coq. Journal of Automated Reasoning, 23(3-4):319-346, November 1999. [ bib | .pdf ]
[326] Dominic Duggan and Frederick Bent. Explaining type inference. Science of Computer Programming, 27(1), June 1996. [ bib ]
[327] Dirk Dussart, Fritz Henglein, and Christian Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Static Analysis Symposium (SAS), volume 983 of Lecture Notes in Computer Science, pages 118-135. Springer, September 1995. [ bib | .dvi.gz ]
[328] Kent Dybvig, Robert Hieb, and Carl Bruggeman. Syntactic abstraction in Scheme. Lisp and Symbolic Computation, 5(4):295-326, 1993. [ bib | .pdf ]
[329] Jonathan Eifrig, Scott Smith, and Valery Trifonov. Sound polymorphic type inference for objects. ACM SIGPLAN Notices, 30(10):169-184, 1995. [ bib | .ps.gz ]
[330] Jonathan Eifrig, Scott Smith, and Valery Trifonov. Type inference for recursively constrained types and its application to OOP. In Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1995. [ bib | .ps.gz ]
[331] E. Allen Emerson and Chin-Laung Lei. Efficient model checking in fragments of the propositional mu-calculus. In Logic in Computer Science (LICS), pages 267-278, June 1986. [ bib ]
[332] Martin Emms and Hans Leiß. Extending the type checker for SML by polymorphic recursion - A correctness proof. Technical Report 96-101, Centrum für Informations- und Sprachverarbeitung, Universität München, 1996. [ bib | .ps.gz ]
[333] Úlfar Erlingsson and Fred B. Schneider. SASI enforcement of security policies: a retrospective. In New Security Paradigms Workshop, pages 87-95, September 1999. [ bib | .ps ]
[334] Úlfar Erlingsson and Fred B. Schneider. IRM enforcement of Java stack inspection. In IEEE Symposium on Security and Privacy (S&P), pages 246-255, May 2000. [ bib | http ]
[335] Karl-Filip Faxén. A static semantics for Haskell. Journal of Functional Programming, 12(4-5):295-357, July 2002. [ bib | .ps.gz ]
[336] Christian Fecht and Helmut Seidl. A faster solver for general systems of equations. Science of Computer Programming, 35(2-3):137-162, 1999. [ bib | .ps.gz ]
[337] J. S. Fenton. Information protection systems. PhD thesis, University of Cambridge, 1973. [ bib ]
[338] J. S. Fenton. Memoryless subsystems. Computer Journal, 17(2):143-147, May 1974. [ bib ]
[339] John Field and Tim Teitelbaum. Incremental reduction in the lambda calculus. In ACM Symposium on Lisp and Functional Programming (LFP), pages 307-322, 1990. [ bib ]
[340] Andrzej Filinski. Representing layered monads. In Principles of Programming Languages (POPL), pages 175-188, January 1999. [ bib | .ps.gz ]
[341] Jean-Christophe Filliâtre. Backtracking iterators. In ACM Workshop on ML, pages 55-62, September 2006. [ bib | .ps.gz ]
[342] Jean-Christophe Filliâtre. Verification of non-functional programs using interpretations in type theory. Journal of Functional Programming, 13(4):709-745, July 2003. [ bib | .ps.gz ]
[343] Jean-Christophe Filliâtre. Why: a multi-language multi-prover verification tool. Research Report 1366, LRI, Université Paris Sud, March 2003. [ bib | .ps.gz ]
[344] Jean-Christophe Filliâtre. Formal proof of a program: Find. Science of Computer Programming, 64:332-240, 2006. [ bib | .ps.gz ]
[345] Jean-Christophe Filliâtre and Pierre Letouzey. Functors for proofs and programs. In European Symposium on Programming (ESOP), volume 2986 of Lecture Notes in Computer Science, pages 370-384. Springer, March 2004. [ bib | .ps.gz ]
[346] Jean-Christophe Filliâtre and Claude Marché. Multi-prover verification of C programs. In International Conference on Formal Engineering Methods (ICFEM), volume 3308 of Lecture Notes in Computer Science, pages 15-29. Springer, November 2004. [ bib | .ps.gz ]
[347] Jean-Christophe Filliâtre and Claude Marché. The Why/Krakatoa/Caduceus platform for deductive program verification. In Computer Aided Verification, volume 4590 of Lecture Notes in Computer Science, pages 173-177. Springer, July 2007. [ bib | .pdf ]
[348] Robert Bruce Findler and Matthias Felleisen. Contracts for higher-order functions. In International Conference on Functional Programming (ICFP), pages 48-59, October 2002. [ bib | .pdf ]
[349] Adam Fischbach and John Hannan. Specification and correctness of lambda lifting. Journal of Functional Programming, 13(3):509-543, May 2003. [ bib | http ]
[350] Kathleen Fisher and John C. Mitchell. On the relationship between classes, objects and data abstraction. Theory and Practice of Object Systems, 4(1):3-25, 1998. [ bib | .ps ]
[351] Cormac Flanagan. Effective static debugging via componential set-based analysis. PhD thesis, Rice University, May 1997. [ bib | .ps.gz ]
[352] Cormac Flanagan and Martín Abadi. Types for safe locking. In European Symposium on Programming (ESOP), volume 1576 of Lecture Notes in Computer Science, pages 91-108. Springer, March 1999. [ bib | .pdf ]
[353] Cormac Flanagan and Matthias Felleisen. Modular and polymorphic set-based analysis: Theory and practice. Technical Report TR96-266, Rice University, November 1996. [ bib | .ps.gz ]
[354] Cormac Flanagan and Matthias Felleisen. Componential set-based analysis. In Programming Language Design and Implementation (PLDI), pages 235-248, 1997. [ bib | .ps.gz ]
[355] Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi, Stephanie Weirich, and Matthias Felleisen. Catching bugs in the web of program invariants. In Programming Language Design and Implementation (PLDI), 1996. [ bib | .ps.gz ]
[356] Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended static checking for Java. In Programming Language Design and Implementation (PLDI), pages 234-245, 2002. [ bib | .ps ]
[357] Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In Programming Language Design and Implementation (PLDI), pages 237-247, 1993. [ bib | .ps.gz ]
[358] Cormac Flanagan and James B. Saxe. Avoiding exponential explosion: generating compact verification conditions. In Principles of Programming Languages (POPL), pages 193-205, 2001. [ bib | .ps ]
[359] R. W. Floyd. Assigning meanings to programs. In Mathematical Aspects of Computer Science, volume 19 of Proceedings of Symposia in Applied Mathematics, pages 19-32. American Mathematical Society, 1967. [ bib ]
[360] Matthew Fluet. Monadic and substructural type systems for region-based memory management. PhD thesis, Cornell University, January 2007. [ bib | .pdf ]
[361] Matthew Fluet and Greg Morrisett. Monadic regions. Journal of Functional Programming, 16(4-5):485-545, 2006. [ bib | .pdf ]
[362] Matthew Fluet, Greg Morrisett, and Amal Ahmed. Linear regions are all you need. In European Symposium on Programming (ESOP), volume 3924 of Lecture Notes in Computer Science, pages 7-21. Springer, March 2006. [ bib | .pdf ]
[363] Matthew Fluet and Riccardo Pucella. Phantom types and subtyping. In IFIP International Conference on Theoretical Computer Science (TCS), pages 448-460, August 2002. [ bib | http ]
[364] Matthew Fluet and Riccardo Pucella. Phantom types and subtyping. In IFIP International Conference on Theoretical Computer Science (TCS), volume 223 of IFIP Conference Proceedings, pages 448-460. Kluwer, August 2002. [ bib | .ps ]
[365] Matthew Fluet and Riccardo Pucella. Practical datatype specializations with phantom types and recursion schemes. In ACM Workshop on ML, Electronic Notes in Theoretical Computer Science, September 2005. [ bib | .pdf ]
[366] Riccardo Focardi and Roberto Gorrieri. A classification of security properties for process algebras. Journal of Computer Security, 3(1):5-33, 1995. [ bib | .ps.gz ]
[367] Bryan Ford. Packrat parsing: simple, powerful, lazy, linear time. In International Conference on Functional Programming (ICFP), pages 36-47, October 2002. [ bib | .pdf ]
[368] Bryan Ford. Parsing expression grammars: a recognition-based syntactic foundation. In Principles of Programming Languages (POPL), pages 111-122, January 2004. [ bib | .pdf ]
[369] Jeffrey S. Foster and Alex Aiken. Checking programmer-specified non-aliasing. Technical Report UCB//CSD-01-1160, University of California, Berkeley, October 2001. [ bib | .pdf ]
[370] Jeffrey S. Foster, Tachio Terauchi, and Alex Aiken. Flow-sensitive type qualifiers. In Programming Language Design and Implementation (PLDI), pages 1-12, June 2002. [ bib | .pdf ]
[371] Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join-calculus. In Principles of Programming Languages (POPL), pages 372-385, 1996. [ bib | .ps ]
[372] Cédric Fournet and Andrew D. Gordon. Stack inspection: Theory and variants. In Principles of Programming Languages (POPL), pages 307-318, January 2002. [ bib | .ps ]
[373] Cédric Fournet and Andrew D. Gordon. Stack inspection: Theory and variants. ACM Transactions on Programming Languages and Systems, 25(3):360-399, May 2003. [ bib | http ]
[374] Cédric Fournet, Cosimo Laneve, Luc Maranget, and Didier Rémy. Inheritance in the join calculus. Journal of Logic and Algebraic Programming, 57(2):23-69, 2003. [ bib | .pdf ]
[375] Cédric Fournet, Luc Maranget, Cosimo Laneve, and Didier Rémy. Implicit typing à la ML for the join-calculus. In International Conference on Concurrency Theory (CONCUR), volume 1243 of Lecture Notes in Computer Science, pages 196-212. Springer, 1997. [ bib | .pdf ]
[376] Adrian Francalanza, Julian Rathke, and Vladimiro Sassone. Permission-based separation logic for message-passing concurrency. Logical Methods in Computer Science, 7(3), 2011. [ bib | http ]
[377] Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596-615, 1987. [ bib | http ]
[378] Tim Freeman and Frank Pfenning. Refinement types for ML. In Programming Language Design and Implementation (PLDI), pages 268-277, 1991. [ bib | .pdf ]
[379] Alexandre Frey. Satisfying subtype inequalities in polynomial space. In Static Analysis Symposium (SAS), number 1302 in Lecture Notes in Computer Science, pages 265-277. Springer, September 1997. [ bib | .html ]
[380] Alexandre Frey. Approche algébrique du typage d'un langage à la ML avec objets, sous-typage et multi-méthodes. PhD thesis, École des Mines de Paris, June 2004. [ bib | .pdf ]
[381] Daniel P. Friedman and Mitchell Wand. Essentials of programming languages, 3rd edition. MIT Press, 2008. [ bib | http ]
[382] Matteo Frigo and Steven G. Johnson. The design and implementation of FFTW3. Proceedings of the IEEE, 93(2):216-231, 2005. [ bib | .pdf ]
[383] Alain Frisch, Giuseppe Castagna, and Véronique Benzaken. Semantic subtyping. In Logic in Computer Science (LICS), pages 137-146, July 2002. [ bib | .ps.gz ]
[384] Alain Frisch, Giuseppe Castagna, and Véronique Benzaken. Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types. Journal of the ACM, 55(4), 2008. [ bib | .pdf ]
[385] You-Chin Fuh and Prateek Mishra. Type inference with subtypes. In European Symposium on Programming (ESOP), volume 300 of Lecture Notes in Computer Science, pages 94-114. Springer, 1988. [ bib | http ]
[386] You-Chin Fuh and Prateek Mishra. Polymorphic subtype inference: Closing the theory-practice gap. In Theory and Practice of Software Development (TAPSOFT), volume 352 of Lecture Notes in Computer Science, pages 167-183. Springer, March 1989. [ bib | http ]
[387] Jun Furuse. Extensional polymorphism by flow graph dispatching. In Asian Symposium on Programming Languages and Systems (APLAS), volume 2895 of Lecture Notes in Computer Science. Springer, November 2003. [ bib | .ps.gz ]
[388] Jun P. Furuse and Jacques Garrigue. A label-selective lambda-calculus with optional arguments and its compilation method. RIMS Preprint 1041, Kyoto University, October 1995. [ bib | .pdf ]
[389] Manuel Fähndrich. Bane: A library for scalable constraint-based program analysis. PhD thesis, University of California at Berkeley, 1999. [ bib | .pdf ]
[390] Manuel Fähndrich, Mark Aiken, Chris Hawblitzel, Orion Hodson, Galen Hunt, James R. Larus, and Steven Levi. Language support for fast and reliable message-based communication in Singularity OS. In EuroSys, pages 177-190, 2006. [ bib | .pdf ]
[391] Manuel Fähndrich and Robert DeLine. Adoption and focus: practical linear types for imperative programming. In Programming Language Design and Implementation (PLDI), pages 13-24, June 2002. [ bib | .pdf ]
[392] Manuel Fähndrich, Jeffrey S. Foster, Zhendong Su, and Alexander S. Aiken. Partial online cycle elimination in inclusion constraint graphs. In Programming Language Design and Implementation (PLDI), pages 85-96, June 1998. [ bib | .pdf ]
[393] Manuel Fähndrich and Rustan Leino. Heap monotonic typestates. In International Workshop on Alias Confinement and Ownership (IWACO), July 2003. [ bib | .pdf ]
[394] Manuel Fähndrich, Jakob Rehof, and Manuvir Das. Scalable context-sensitive flow analysis using instantiation constraints. In Programming Language Design and Implementation (PLDI), June 2000. [ bib | .ps ]
[395] Murdoch J. Gabbay. A theory of inductive definitions with α-equivalence. PhD thesis, Cambridge University, 2001. [ bib | .pdf ]
[396] Murdoch J. Gabbay. A general mathematics of names in syntax. Submitted for publication, March 2004. [ bib | .pdf ]
[397] Murdoch J. Gabbay and Andrew M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13(3-5):341-363, July 2002. [ bib | .pdf ]
[398] Vladimir Gapeyev, Michael Levin, and Benjamin Pierce. Recursive subtyping revealed. Journal of Functional Programming, 12(6):511-548, November 2002. [ bib | http ]
[399] Michael R. Garey and David S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, 1979. [ bib ]
[400] Jacques Garrigue. Programming with polymorphic variants. In ACM Workshop on ML, September 1998. [ bib | .ps.gz ]
[401] Jacques Garrigue. Code reuse through polymorphic variants. In Workshop on Foundations of Software Engineering, November 2000. [ bib | .ps.gz ]
[402] Jacques Garrigue. Simple type inference for structural polymorphism. In Foundations of Object-Oriented Languages (FOOL), January 2002. [ bib | .ps.gz ]
[403] Jacques Garrigue. Relaxing the value restriction. In Functional and Logic Programming, volume 2998 of Lecture Notes in Computer Science, pages 196-213. Springer, April 2004. [ bib | .pdf ]
[404] Jacques Garrigue and Didier Rémy. Extending ML with semi-explicit higher-order polymorphism. Information and Computation, 155(1):134-169, 1999. [ bib | .pdf ]
[405] Jacques Garrigue and Didier Rémy. Ambivalent types for principal type inference with GADTs. In Asian Symposium on Programming Languages and Systems (APLAS), December 2013. [ bib | .pdf ]
[406] Benedict R. Gaster. Records, variants and qualified types. PhD thesis, University of Nottingham, July 1998. [ bib | .ps ]
[407] Benedict R. Gaster and Mark P. Jones. A polymorphic type system for extensible records and variants. Technical Report NOTTCS-TR-96-3, Department of Computer Science, University of Nottingham, November 1996. [ bib | .html ]
[408] Nadji Gauthier and François Pottier. Numbering matters: First-order canonical forms for second-order recursive types. In International Conference on Functional Programming (ICFP), pages 150-161, September 2004. [ bib | .pdf ]
[409] Simon J. Gay, Vasco Thudichum Vasconcelos, António Ravara, Nils Gesbert, and Alexandre Z. Caldeira. Modular session types for distributed object-oriented programming. In Principles of Programming Languages (POPL), pages 299-312, January 2010. [ bib | .pdf ]
[410] Steven German, Edmund Clarke, and Joseph Halpern. Reasoning about procedures as parameters. In Logic of Programs, volume 164 of Lecture Notes in Computer Science, pages 206-220. Springer, 1983. [ bib | http ]
[411] Alfons Geser, Jens Knoop, Gerald Lüttgen, Oliver Rüthing, and Bernhard Steffen. Chaotic fixed point iterations. MIP-Bericht 9403, Fakultät für Mathematik und Informatik, Universität Passau, 1994. [ bib | .html ]
[412] Giorgio Ghelli. Divergence of F<= type checking. Theoretical Computer Science, 139(1-2):131-162, March 1995. [ bib | .ps.gz ]
[413] Cristian Gherghina, Cristina David, Shengchao Qin, and Wei-Ngan Chin. Structured specifications for better verification of heap-manipulating programs. In Formal Methods (FM), volume 6664 of Lecture Notes in Computer Science, pages 386-401. Springer, June 2011. [ bib | .pdf ]
[414] David K. Gifford, Pierre Jouvelot, John M. Lucassen, and Mark A. Sheldon. FX-87 reference manual. Technical Report MIT/LCS/TR-407, Massachusetts Institute of Technology, January 1987. [ bib ]
[415] David K. Gifford, Pierre Jouvelot, Mark A. Sheldon, and James W. O'Toole. Report on the FX-91 programming language. Technical Report MIT/LCS/TR-531, Massachusetts Institute of Technology, February 1992. [ bib | http ]
[416] Jean-Yves Girard. Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur. Thèse d'état, Université Paris 7, June 1972. [ bib ]
[417] Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50(1):1-102, 1987. [ bib | .pdf ]
[418] Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and types. Cambridge University Press, 1990. [ bib | .pdf ]
[419] Neal Glew. Object closure conversion. In Higher Order Operational Techniques in Semantics (HOOTS), volume 26 of Electronic Notes in Theoretical Computer Science, pages 52-68, September 1999. [ bib | .ps.gz ]
[420] Neal Glew. An efficient class and object encoding. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 311-324, October 2000. [ bib | .ps.gz ]
[421] Neal Glew. A theory of second-order trees. In European Symposium on Programming (ESOP), volume 2305 of Lecture Notes in Computer Science, pages 147-161. Springer, April 2002. [ bib | .pdf ]
[422] Andreas Goerdt. A Hoare calculus for functions defined by recursion on higher types. In Logic of Programs, volume 193 of Lecture Notes in Computer Science, pages 106-117. Springer, 1985. [ bib | http ]
[423] Joseph Goguen and José Meseguer. Security policies and security models. In IEEE Symposium on Security and Privacy (S&P), pages 11-20, April 1982. [ bib ]
[424] Li Gong, Gary Ellison, and Mary Dageforde. Inside Java 2 platform security, second edition. Addison-Wesley, 2003. [ bib | http ]
[425] Li Gong, Marianne Mueller, Hemma Prafullchandra, and Roland Schemers. Going beyond the sandbox: An overview of the new security architecture in the Java Development Kit 1.2. In USENIX Symposium on Internet Technologies and Systems, pages 103-112, December 1997. [ bib | .ps ]
[426] Li Gong and Roland Schemers. Implementing protection domains in the Java development kit 1.2. In Internet Society Symposium on Network and Distributed System Security, March 1998. [ bib | .pdf ]
[427] Andrew D. Gordon and Tom Melham. Five axioms of alpha-conversion. In Theorem Proving in Higher Order Logics (TPHOLs), volume 1125 of Lecture Notes in Computer Science, pages 173-191. Springer, August 1996. [ bib | .ps.gz ]
[428] Colin S. Gordon, Matthew J. Parkinson, Jared Parsons, Aleks Bromfield, and Joe Duffy. Uniqueness and reference immutability for safe parallelism. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 21-40, October 2012. [ bib | .pdf ]
[429] Donald Gordon and James Noble. Dynamic ownership in a dynamic language. In Symposium on Dynamic Languages, pages 41-52, 2007. [ bib | http ]
[430] James Gosling, Bill Joy, Guy Steele, and Gilad Bracha. The Java language specification, second edition. Addison-Wesley, 2000. [ bib | http ]
[431] Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, and Mooly Sagiv. Local reasoning for storable locks and threads. Technical Report MSR-TR-2007-39, Microsoft Research, September 2007. [ bib | .pdf ]
[432] Jean Goubault. Inférence d'unités physiques en ML. In Journées Françaises des Langages Applicatifs, pages 3-20, 1994. [ bib ]
[433] Jessica Gronski, Kenneth Knowles, Aaron Tomb, Stephen N. Freund, and Cormac Flanagan. Sage: Hybrid checking for flexible specifications. In Scheme and Functional Programming, pages 93-104, September 2006. [ bib | .pdf ]
[434] Dan Grossman. Quantified types in an imperative language. ACM Transactions on Programming Languages and Systems, 28(3):429-475, May 2006. [ bib | .pdf ]
[435] Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling Wang, and James Cheney. Region-based memory management in Cyclone. In Programming Language Design and Implementation (PLDI), pages 282-293, June 2002. [ bib | .pdf ]
[436] Dick Grune and Ceriel J. H. Jacobs. Parsing techniques: a practical guide. Ellis Horwood, 1990. [ bib | .html ]
[437] Dick Grune and Ceriel J. H. Jacobs. Parsing techniques: a practical guide, second edition. Monographs in computer science. Springer, 2008. [ bib | .html ]
[438] Louis-Julien Guillemette and Stefan Monnier. A type-preserving closure conversion in Haskell. In Haskell workshop, pages 83-92, September 2007. [ bib | .pdf ]
[439] Louis-Julien Guillemette and Stefan Monnier. One vote for type families in Haskell! In Trends in Functional Programming (TFP), 2008. [ bib | .pdf ]
[440] Louis-Julien Guillemette and Stefan Monnier. A type-preserving compiler in Haskell. In International Conference on Functional Programming (ICFP), pages 75-86, September 2008. [ bib | .pdf ]
[441] Adam Gundry. Type inference, Haskell and dependent types. PhD thesis, University of Strathclyde, 2013. [ bib | .pdf ]
[442] Adam Gundry, Conor McBride, and James McKinna. Type inference in context. In ACM SIGPLAN Workshop on Mathematically Structured Functional Programming (MSFP), pages 43-54, September 2010. [ bib | .pdf ]
[443] Jörgen Gustavsson and Josef Svenningsson. Constraint abstractions. In Symposium on Programs as Data Objects, volume 2053 of Lecture Notes in Computer Science. Springer, May 2001. [ bib | .pdf ]
[444] Juan Carlos Guzmán and Ascánder Suárez. An extended type system for exceptions. In ACM Workshop on ML and its Applications, number 2265 in INRIA Research Reports, pages 127-135. INRIA, June 1994. [ bib ]
[445] Armaël Guéneau, François Pottier, and Jonathan Protzenko. The ins and outs of iteration in Mezzo. Higher-Order Programming and Effects (HOPE), September 2013. http://goo.gl/NrgKc4. [ bib ]
[446] Christian Haack and J. B. Wells. Type error slicing in implicitly typed, higher-order languages. In European Symposium on Programming (ESOP), volume 2618 of Lecture Notes in Computer Science. Springer, 2003. [ bib | .pdf ]
[447] Cordelia Hall, Kevin Hammond, Simon Peyton Jones, and Philip Wadler. Type classes in Haskell. In European Symposium on Programming (ESOP), volume 788 of Lecture Notes in Computer Science, pages 241-256. Springer, April 1994. [ bib | .ps.gz ]
[448] Cordelia Hall, Kevin Hammond, Simon Peyton Jones, and Philip Wadler. Type classes in Haskell. ACM Transactions on Programming Languages and Systems, 18(2):109-138, March 1996. [ bib | http ]
[449] Philipp Haller and Martin Odersky. Capabilities for uniqueness and borrowing. In European Conference on Object-Oriented Programming (ECOOP), volume 6183 of Lecture Notes in Computer Science, pages 354-378. Springer, June 2010. [ bib | .pdf ]
[450] Joseph J. Hallett and Assaf J. Kfoury. Programming examples needing polymorphic recursion. Technical Report BUCS-TR-2004-004, Department of Computer Science, Boston University, January 2004. [ bib | .pdf ]
[451] Thomas Hallgren, James Hook, Mark P. Jones, and Richard Kieburtz. An overview of the Programatica toolset. High Confidence Software and Systems Conference (HCSS), 2004. [ bib | .pdf ]
[452] Michael Hanus. Horn clause specifications with polymorphic types. PhD thesis, Fachbereich Informatik, Universität Dortmund, 1988. [ bib | .dvi.Z ]
[453] Michael Hanus. Horn clause programs with polymorphic types: Semantics and resolution. In Theory and Practice of Software Development (TAPSOFT), volume 352 of Lecture Notes in Computer Science, pages 225-240. Springer, 1989. [ bib | .ps ]
[454] Norm Hardy. The confused deputy (or why capabilities might have been invented). ACM Operating Systems Review, 22(4):36-38, October 1988. [ bib | .html ]
[455] Bob Harper and Mark Lillibridge. ML with callcc is unsound. Message to the TYPES mailing list, July 1991. [ bib | .html ]
[456] Robert Harper. A simplified account of polymorphic references. Information Processing Letters, 51(4):201-206, 1994. [ bib | .pdf ]
[457] Robert Harper. Proof-directed debugging. Journal of Functional Programming, 9(4):463-469, 1999. [ bib | http ]
[458] Robert Harper and Daniel R. Licata. Mechanizing metatheory in a logical framework. Journal of Functional Programming, 17(4-5):613-673, 2007. [ bib | .pdf ]
[459] Robert Harper and Benjamin Pierce. A record calculus based on symmetric concatenation. In Principles of Programming Languages (POPL), pages 131-142, January 1991. [ bib | .ps ]
[460] Robert Harper and Benjamin C. Pierce. Design considerations for ML-style module systems. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 8, pages 293-345. MIT Press, 2005. [ bib ]
[461] John Harrison. Handbook of practical logic and automated reasoning. Cambridge University Press, 2009. [ bib | http ]
[462] Michael A. Harrison, Walter L. Ruzzo, and Jeffrey D. Ullman. Protection in operating systems. Communications of the ACM, 19(8):461-471, August 1976. [ bib | http ]
[463] Chris Hawblitzel. Linear types for aliased resources. Technical Report MSR-TR-2005-141, Microsoft Research, October 2005. [ bib | .pdf ]
[464] Matthew S. Hecht and Jeffrey D. Ullman. Analysis of a simple algorithm for global data flow problems. In Principles of Programming Languages (POPL), pages 207-217, 1973. [ bib | http ]
[465] Bastiaan Heeren and Jurriaan Hage. Parametric type inferencing for Helium. Technical Report UU-CS-2002-035, University of Utrecht, Institute of Information and Computing Science, August 2002. [ bib | .pdf ]
[466] Bastiaan Heeren, Jurriaan Hage, and Doaitse Swierstra. Generalizing Hindley-Milner type inference algorithms. Technical Report UU-CS-2002-031, University of Utrecht, Institute of Information and Computing Science, July 2002. [ bib | .pdf ]
[467] Bastiaan Heeren, Johan Jeuring, Doaitse Swierstra, and Pablo Azero Alcocer. Improving type-error messages in functional languages. Technical Report UU-CS-2002-009, University of Utrecht, Institute of Information and Computing Science, February 2002. [ bib | .pdf ]
[468] Eric C. R. Hehner. Abstractions of time, pages 191-210. Prentice Hall, 1994. [ bib | .pdf ]
[469] Eric C. R. Hehner. Formalization of time and space. Formal Aspects of Computing, 10:290-206, 1998. [ bib | .pdf ]
[470] Nevin Heintze. Set based analysis of ML programs. Technical Report CMU-CS-93-193, Carnegie Mellon University, School of Computer Science, July 1993. [ bib | .ps ]
[471] Nevin Heintze and David McAllester. Linear-time subtransitive control flow analysis. In Programming Language Design and Implementation (PLDI), pages 261-272, 1997. [ bib | .ps ]
[472] Nevin Heintze and Jon G. Riecke. The SLam calculus: Programming with secrecy and integrity. In Principles of Programming Languages (POPL), pages 365-377, January 1998. [ bib | .ps ]
[473] Nevin Heintze and Olivier Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Programming Language Design and Implementation (PLDI), pages 254-263, 2001. [ bib | .ps ]
[474] Simon Helsen and Peter Thiemann. Syntactic type soundness for the region calculus. In Higher Order Operational Techniques in Semantics (HOOTS), volume 41(3) of Electronic Notes in Theoretical Computer Science, pages 1-19, 2000. [ bib | .pdf ]
[475] Fergus Henderson. Strong modes can change the world! Technical Report 96/11, Department of Computer Science, University of Melbourne, November 1992. [ bib | .ps.gz ]
[476] Dimitri Hendriks and Vincent van Oostrom. Adbmal. In International Conference on Automated Deduction (CADE), volume 2741 of Lecture Notes in Computer Science, pages 136-150. Springer, 2003. [ bib | .ps ]
[477] Fritz Henglein. Polymorphic type inference and semi-unification. PhD thesis, Rutgers University, April 1989. [ bib | .ps.gz ]
[478] Fritz Henglein. Efficient type inference for higher-order binding-time analysis. In Functional Programming Languages and Computer Architecture (FPCA), volume 523 of Lecture Notes in Computer Science, pages 448-472. Springer, 1991. [ bib | .dvi.gz ]
[479] Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, April 1993. [ bib | http ]
[480] Fritz Henglein. Breaking through the n3 barrier: Faster object type inference. In Foundations of Object-Oriented Languages (FOOL), 1997. [ bib ]
[481] Fritz Henglein. Breaking through the n3 barrier: Faster object type inference. Theory and Practice of Object Systems, 5(1):57-72, 1999. [ bib | .ps.gz ]
[482] Fritz Henglein and Jakob Rehof. The complexity of subtype entailment for simple types. In Logic in Computer Science (LICS), pages 352-361, June 1997. [ bib | .ps ]
[483] Fritz Henglein and Jakob Rehof. Constraint automata and the complexity of recursive subtype entailment. In International Colloquium on Automata, Languages and Programming, July 1998. [ bib | .ps ]
[484] Matthew Hennessy. The security picalculus and non-interference. Technical Report 2000:05, University of Sussex, November 2000. [ bib | .ps.Z ]
[485] Matthew Hennessy and James Riely. Information flow vs. resource access in the asynchronous pi-calculus. In International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science. Springer, July 2000. [ bib | .ps.gz ]
[486] Mark Hepburn and David Wright. Trust in the pi-calculus. In Principles and Practice of Declarative Programming (PPDP), September 2001. [ bib ]
[487] Brian Herlihy, Peter Schachte, and Harald Søndergaard. Un-Kleene Boolean equation solving. International Journal of Foundations of Computer Science, 18(2):227-250, 2007. [ bib | http ]
[488] Stefan Heule, K. Rustan M. Leino, Peter Müller, and Alexander J. Summers. Abstract read permissions: Fractional permissions without the fractions. In Verification, Model Checking and Abstract Interpretation (VMCAI), volume 7737 of Lecture Notes in Computer Science, pages 315-334. Springer, 2013. [ bib | .pdf ]
[489] Tomoyuki Higuchi and Atsushi Ohori. A static type system for JVM access control. In International Conference on Functional Programming (ICFP), pages 227-237, August 2003. [ bib | http ]
[490] J. Roger Hindley. The principal type-scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29-60, 1969. [ bib | http ]
[491] Ralf Hinze. Fun with phantom types. In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming, pages 245-262. Palgrave Macmillan, March 2003. [ bib | .pdf ]
[492] Ralf Hinze, Johan Jeuring, and Andres Löh. Comparing approaches to generic programming in Haskell. Technical Report UU-CS-2006-022, Department of Information and Computing Sciences, Utrecht University, 2006. [ bib | .pdf ]
[493] Ralf Hinze and Simon Peyton Jones. Derivable type classes. In Haskell workshop, 2000. [ bib | .ps.gz ]
[494] Tom Hirschowitz and Xavier Leroy. Mixin modules in a call-by-value setting. ACM Transactions on Programming Languages and Systems, 2004. To appear. [ bib | .ps.gz ]
[495] Tom Hirschowitz, Xavier Leroy, and J. B. Wells. Call-by-value mixin modules: Reduction semantics, side effects, types. In European Symposium on Programming (ESOP), volume 2986 of Lecture Notes in Computer Science, pages 64-78. Springer, April 2004. [ bib | .ps.gz ]
[496] My Hoang and John C. Mitchell. Lower bounds on type inference with subtypes. In Principles of Programming Languages (POPL), pages 176-185, January 1995. [ bib | http ]
[497] C. A. R. Hoare. Algorithm 65: find. Communications of the ACM, 4(7):321-322, July 1961. [ bib | http ]
[498] C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969. [ bib | http ]
[499] C. A. R. Hoare. Proof of a program: FIND. Communications of the ACM, 14(1):39-45, January 1971. [ bib | http ]
[500] C. A. R. Hoare. Proof of correctness of data representations. Acta Informatica, 4:271-281, 1972. [ bib | http ]
[501] Aquinas Hobor, Andrew W. Appel, and Francesco Zappa Nardelli. Oracle semantics for concurrent separation logic. In European Symposium on Programming (ESOP), volume 4960 of Lecture Notes in Computer Science, pages 353-367. Springer, April 2008. [ bib | .pdf ]
[502] Aquinas Hobor, Robert Dockins, and Andrew W. Appel. A theory of indirection via approximation. In Principles of Programming Languages (POPL), January 2010. [ bib | .pdf ]
[503] Aquinas Hobor and Cristian Gherghina. Barriers in concurrent separation logic. In European Symposium on Programming (ESOP), Lecture Notes in Computer Science. Springer, March 2011. [ bib | .pdf ]
[504] Martin Hofmann. A type system for bounded space and functional in-place update. Nordic Journal of Computing, 7(4):258-289, 2000. [ bib | .ps.gz ]
[505] Martin Hofmann and Steffen Jost. Static prediction of heap space usage for first-order functional programs. In Principles of Programming Languages (POPL), pages 185-197, January 2003. [ bib | .ps ]
[506] Martin Hofmann and Mariela Pavlova. Elimination of ghost variables in program logics. In Trustworthy Global Computing, volume 4912 of Lecture Notes in Computer Science, pages 1-20. Springer, 2008. [ bib | .pdf ]
[507] Martin Hofmann and Benjamin Pierce. A unifying type-theoretic framework for objects. Journal of Functional Programming, 5(4):593-635, October 1995. Previous versions appeared in the Symposium on Theoretical Aspects of Computer Science, 1994, (pages 251-262) and, under the title “An Abstract View of Objects and Subtyping (Preliminary Report),” as University of Edinburgh, LFCS technical report ECS-LFCS-92-226, 1992. [ bib | .ps ]
[508] John Hogg. Islands: Aliasing protection in object-oriented languages. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 271-285, 1991. [ bib | http ]
[509] Kohei Honda, Vasco Vasconcelos, and Nobuko Yoshida. Secure information flow as typed process behaviour. Technical Report QMW-DCS-1999-767, Queen Mary and Westfield College, University of London, December 1999. [ bib | .ps.gz ]
[510] Kohei Honda, Vasco Vasconcelos, and Nobuko Yoshida. Secure information flow as typed process behaviour. In European Symposium on Programming (ESOP), volume 1782 of Lecture Notes in Computer Science, pages 180-199. Springer, March 2000. [ bib | .ps.gz ]
[511] Kohei Honda and Nobuko Yoshida. A uniform type structure for secure information flow. In Principles of Programming Languages (POPL), pages 81-92, January 2002. [ bib | .ps.gz ]
[512] Kohei Honda and Nobuko Yoshida. A compositional logic for polymorphic higher-order functions. In Principles and Practice of Declarative Programming (PPDP), pages 191-202, August 2004. [ bib | .pdf.gz ]
[513] Furio Honsell, Marino Miculan, and Ivan Scagnetto. An axiomatic approach to metareasoning on nominal algebras in HOAS. In International Colloquium on Automata, Languages and Programming, volume 2076 of Lecture Notes in Computer Science, pages 963-978. Springer, 2001. [ bib | .pdf ]
[514] John E. Hopcroft. An nlogn algorithm for minimizing states in a finite automaton. In Z. Kohavi, editor, Theory of Machines and Computations, pages 189-196. Academic Press, 1971. [ bib ]
[515] John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, 2000. [ bib | .html ]
[516] R. Nigel Horspool and Michael Whitney. Even faster LR parsing. Software - Practice & Experience, 20(6):515-535, June 1990. [ bib | .pdf ]
[517] Susan Horwitz, Thomas Reps, and Mooly Sagiv. Demand interprocedural dataflow analysis. In ACM Symposium on the Foundations of Software Engineering (FSE), October 1995. [ bib | .ps ]
[518] Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 13(6):961-1004, November 2003. [ bib | http ]
[519] Thierry Hubert and Claude Marché. Separation analysis for deductive verification. In Heap Analysis and Verification (HAV), March 2007. [ bib | .pdf ]
[520] Paul Hudak, John Hughes, Simon Peyton Jones, and Philip Wadler. A history of Haskell: being lazy with class. In History of Programming Languages, June 2007. [ bib | .pdf ]
[521] Gérard Huet. Résolution d'équations dans des langages d'ordre 1, 2, ..., ω. PhD thesis, Université Paris 7, September 1976. [ bib ]
[522] Gérard Huet. The zipper. Journal of Functional Programming, 7(5):549-554, 1997. [ bib | .pdf ]
[523] Gérard Huet. Regular Böhm trees. Mathematical Structures in Computer Science, 8:671-680, 1998. [ bib | .pdf ]
[524] John Hughes. Why functional programming matters. Computer Journal, 32(2):98-107, 1989. [ bib | .pdf ]
[525] John Hughes. Generalising monads to arrows. Science of Computer Programming, 37(1-3):67-111, 2000. [ bib | .pdf ]
[526] John Hughes, Lars Pareto, and Amr Sabry. Proving the correctness of reactive systems using sized types. In Principles of Programming Languages (POPL), pages 410-423, January 1996. [ bib | http ]
[527] Atsushi Igarashi and Naoki Kobayashi. Type reconstruction for linear π-calculus with I/O subtyping. Information and Computation, 161:1-44, August 2000. [ bib | .ps.gz ]
[528] Samin S. Ishtiaq and Peter W. O'Hearn. BI as an assertion language for mutable data structures. In Principles of Programming Languages (POPL), pages 14-26, January 2001. [ bib | .pdf ]
[529] Daniel Jackson and Mandana Vaziri. Finding bugs with a constraint solver. In International Symposium on Software Testing and Analysis (ISSTA), August 2000. [ bib | .pdf ]
[530] Bart Jacobs and Frank Piessens. The VeriFast program verifier. Technical Report CW-520, Department of Computer Science, Katholieke Universiteit Leuven, August 2008. [ bib | .pdf ]
[531] Suresh Jagannathan and Andrew Wright. Effective flow analysis for avoiding run-time checks. In Static Analysis Symposium (SAS), volume 983 of Lecture Notes in Computer Science. Springer, September 1995. [ bib | .ps.gz ]
[532] Patrik Jansson. Functional polytypic programming. PhD thesis, Chalmers University of Technology, 2000. [ bib | .ps.gz ]
[533] C. Barry Jay. The pattern calculus. ACM Transactions on Programming Languages and Systems, 26(6):911-937, November 2004. [ bib | .pdf ]
[534] Clinton L. Jeffery. Merr user's guide, July 2002. [ bib | .pdf ]
[535] Clinton L. Jeffery. Generating LR syntax error messages from examples. ACM Transactions on Programming Languages and Systems, 25(5):631-640, 2003. [ bib | http ]
[536] Jonas Braband Jensen and Lars Birkedal. Fictional separation logic. In European Symposium on Programming (ESOP), volume 7211 of Lecture Notes in Computer Science, pages 377-396. Springer, March 2012. [ bib | .pdf ]
[537] Thomas Jensen. Inference of polymorphic and conditional strictness properties. In Principles of Programming Languages (POPL), pages 209-221. ACM Press, January 1998. [ bib | .ps ]
[538] Thomas Jensen, Daniel Le Métayer, and Tommy Thorn. Verifying security properties of control-flow graphs. In IEEE Symposium on Security and Privacy (S&P), pages 89-105, May 1999. [ bib | .ps ]
[539] Thomas Jensen, Florimond Ployette, and Olivier Ridoux. Iteration schemes for fixed point computation. In International workshop on Fixed Points in Computer Science (FICS), pages 69-76, 2002. [ bib | .ps ]
[540] Somesh Jha, Jens Palsberg, and Tian Zhao. Efficient type matching. In Foundations of Software Science and Computation Structures (FOSSACS), volume 2303 of Lecture Notes in Computer Science, pages 187-204. Springer, April 2002. [ bib | .pdf ]
[541] Limin Jia, Frances Spalding, David Walker, and Neal Glew. Certifying compilation for a language with stack allocation. In Logic in Computer Science (LICS), pages 407-416, June 2005. [ bib | .pdf ]
[542] Limin Jia and David Walker. ILC: A foundation for automated reasoning about pointer programs. In European Symposium on Programming (ESOP), volume 3924 of Lecture Notes in Computer Science, pages 131-145. Springer, March 2006. [ bib | .pdf ]
[543] Trevor Jim. What are principal typings and what are they good for? Technical Report MIT/LCS TM-532, Massachusetts Institute of Technology, August 1995. [ bib | .ps.gz ]
[544] Trevor Jim. A polar type system. In Workshop on Intersection Types and Related Systems (ITRS), volume 8 of Proceedings in Informatics. Carleton Scientific, 2000. [ bib | .ps.gz ]
[545] Trevor Jim and Jens Palsberg. Type inference in systems of recursive types with subtyping. Manuscript, 1999. [ bib | .pdf ]
[546] Gregory F. Johnson and Janet A. Walz. A maximum-flow approach to anomaly isolation in unification-based incremental type inference. In Principles of Programming Languages (POPL), pages 44-57, January 1986. [ bib ]
[547] Stephen C. Johnson. Yacc: Yet another compiler-compiler. Computing Science Technical Report 32, Bell Laboratories, 1975. [ bib | .ps ]
[548] Steven C. Johnson. Yacc: Yet another compiler compiler. In UNIX Programmer's Manual, volume 2, pages 353-387. Holt, Rinehart, and Winston, 1979. [ bib | http ]
[549] Thomas Johnsson. Lambda lifting: Transforming programs to recursive equations. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture (FPCA), volume 201 of Lecture Notes in Computer Science, pages 190-203. Springer, 1985. [ bib | http ]
[550] Mark P. Jones. A theory of qualified types. In European Symposium on Programming (ESOP), volume 582 of Lecture Notes in Computer Science. Springer, February 1992. [ bib | .html ]
[551] Mark P. Jones. Dictionary-free overloading by partial evaluation. In ACM Workshop on Evaluation and Semantics-Based Program Manipulation (PEPM), June 1994. [ bib | .ps ]
[552] Mark P. Jones. Qualified types: Theory and practice. Cambridge University Press, November 1994. [ bib ]
[553] Mark P. Jones. Simplifying and improving qualified types. Technical Report YALEU/DCS/RR-1040, Yale University, June 1994. [ bib | .ps.Z ]
[554] Mark P. Jones. From Hindley-Milner types to first-class structures. Research Report YALEU/DCS/RR-1075, Yale University, June 1995. [ bib | .html ]
[555] Mark P. Jones. Using parameterized signatures to express modular structure. In Principles of Programming Languages (POPL), January 1996. [ bib | .html ]
[556] Mark P. Jones. Typing Haskell in Haskell. In Haskell workshop, October 1999. [ bib | http ]
[557] Mark P. Jones. jacc: Just another compiler compiler for Java, February 2004. [ bib | .pdf ]
[558] Mark P. Jones and Simon Peyton Jones. Lightweight extensible records for Haskell. In Haskell workshop, October 1999. [ bib | .ps.gz ]
[559] Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. Technical Report 561, Université Paris-Sud, April 1990. [ bib ]
[560] Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257-321. MIT Press, 1991. [ bib ]
[561] Niels Jørgensen. Chaotic fixpoint iteration guided by dynamic dependency. In International Workshop on Static Analysis (WSA), volume 724 of Lecture Notes in Computer Science, pages 27-44. Springer, 1993. [ bib | .ps ]
[562] John B. Kam and Jeffrey D. Ullman. Global data flow analysis and iterative algorithms. Journal of the ACM, 23(1):158-171, January 1976. [ bib | http ]
[563] John B. Kam and Jeffrey D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7(3):305-317, September 1977. [ bib | http ]
[564] Johannes Kanig. Specification and proof of higher-order programs. PhD thesis, Université Paris-Sud, November 2010. [ bib | .pdf ]
[565] Haim Kaplan and Robert E. Tarjan. Purely functional, real-time deques with catenation. Journal of the ACM, 46(5):577-603, 1999. [ bib | .ps ]
[566] Deepak Kapur and Hantao Zhang. An overview of Rewrite Rule Laboratory (RRL). J. Comput. Appl. Math., 29(2):91-114, 1995. [ bib | .ps.gz ]
[567] Yugo Kashiwagi and David S. Wise. Graph algorithms in a lazy functional programming language. Technical Report 330, Indiana University, April 1991. [ bib | .pdf ]
[568] Ioannis T. Kassios. Dynamic frames: Support for framing, dependencies and sharing without restrictions. In Formal Methods (FM), volume 4085 of Lecture Notes in Computer Science, pages 268-283. Springer, August 2006. [ bib | .pdf ]
[569] Misa Keinänen. Techniques for solving Boolean equation systems. PhD thesis, Helsinki University of Technology, 2006. Research Report HUT-TCS-A105. [ bib | .pdf ]
[570] Torbjörn Keisu. Finite and rational tree constraints. Bulletin of the IGPL, 2(2):167-204, 1994. [ bib | .ps.gz ]
[571] Torbjörn Keisu. Tree constraints. PhD thesis, The Royal Institute of Technology (KTH), May 1994. [ bib | .ps.gz ]
[572] Andrew Kennedy. Dimension types. In European Symposium on Programming (ESOP), volume 788 of Lecture Notes in Computer Science. Springer, 1994. [ bib | .pdf ]
[573] Andrew Kennedy. Type inference and equational theories. Technical Report LIX/RR/96/09, École Polytechnique, September 1996. [ bib ]
[574] Andrew Kennedy. Compiling with continuations, continued. In International Conference on Functional Programming (ICFP), pages 177-190, September 2007. [ bib | .pdf ]
[575] Ken W. Kennedy. Node listings applied to data flow analysis. In Principles of Programming Languages (POPL), pages 10-21, January 1975. [ bib | http ]
[576] Manfred Kerber. How to prove higher order theorems in first order logic. In International Joint Conferences on Artificial Intelligence, pages 137-142, 1991. [ bib | .pdf ]
[577] A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type reconstruction in the presence of polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):290-311, 1993. [ bib | http ]
[578] Assaf J. Kfoury, Jerzy Tiuryn, and Pawel Urzyczyn. ML typability is DEXPTIME-complete. In Colloquium on Trees in Algebra and Programming, volume 431 of Lecture Notes in Computer Science, pages 206-220. Springer, May 1990. [ bib | http ]
[579] Assaf J. Kfoury and J. B. Wells. Principality and type inference for intersection types using expansion variables. Theoretical Computer Science, 311(1-3):1-70, 2004. [ bib | .html ]
[580] Richard B. Kieburtz. Taming effects with monadic typing. In International Conference on Functional Programming (ICFP), pages 51-62, 1998. [ bib | http ]
[581] Richard B. Kieburtz. P-logic: Property verification for Haskell programs. Draft, August 2002. [ bib | .pdf ]
[582] Gary A. Kildall. A unified approach to global program optimization. In Principles of Programming Languages (POPL), pages 194-206, October 1973. [ bib | http ]
[583] Ik-Soon Kim, Kwangkeun Yi, and Cristiano Calcagno. A polymorphic modal type system for Lisp-like multi-staged languages. In Principles of Programming Languages (POPL), pages 257-268, 2006. [ bib | .pdf ]
[584] David King and Philip Wadler. Combining monads. In Workshop on Functional Programming. Springer, 1992. [ bib | .ps.gz ]
[585] Gerwin Klein, June Andronick, Kevin Elphinstone, Gernot Heiser, David Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, Thomas Sewell, Harvey Tuch, and Simon Winwood. seL4: formal verification of an operating-system kernel. Communications of the ACM, 53(6):107-115, 2010. [ bib | .pdf ]
[586] Kevin Knight. Unification: a multidisciplinary survey. ACM Computing Surveys, 21(1):93-124, March 1989. [ bib | http ]
[587] Donald E. Knuth. On the translation of languages from left to right. Information & Control, 8(6):607-639, December 1965. [ bib ]
[588] Donald E. Knuth. A generalization of Dijkstra's algorithm. Information Processing Letters, 6(1):1-5, February 1977. [ bib ]
[589] Naoki Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436-482, March 1998. [ bib | http ]
[590] Naoki Kobayashi. Type-based useless variable elimination. In ACM Workshop on Evaluation and Semantics-Based Program Manipulation (PEPM), pages 84-93, January 2000. [ bib | .ps.gz ]
[591] Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the Pi-Calculus. ACM Transactions on Programming Languages and Systems, 21(5):914-947, September 1999. [ bib | http ]
[592] Naoki Kobayashi, Shin Saito, and Eijiro Sumii. An implicitly-typed deadlock-free process calculus. In International Conference on Concurrency Theory (CONCUR), volume 1877 of Lecture Notes in Computer Science, pages 489-503. Springer, August 2000. [ bib | .ps.gz ]
[593] Yasunori Koda and Frank Ruskey. A Gray code for the ideals of a forest poset. Journal of Algorithms, 15(2):324-340, September 1993. [ bib | .ps ]
[594] Eugene Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce Duba. Hygienic macro expansion. In ACM Symposium on Lisp and Functional Programming (LFP), pages 151-161, 1986. [ bib | http ]
[595] Eugene E. Kohlbecker and Mitchell Wand. Macro-by-example: Deriving syntactic transformations from their specifications. In Principles of Programming Languages (POPL), pages 77-84, January 1987. [ bib | http ]
[596] Adam Koprowski and Henri Binsztok. TRX: A formally verified parser interpreter. In European Symposium on Programming (ESOP), volume 6012 of Lecture Notes in Computer Science, pages 345-365. Springer, March 2010. [ bib | .pdf ]
[597] Adam Koprowski and Henri Binsztok. TRX: A formally verified parser interpreter. Logical Methods in Computer Science, 7(2), 2011. [ bib | http ]
[598] Larry Koved, Marco Pistoia, and Aaron Kershenbaum. Access rights analysis for Java. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 359-372, November 2002. [ bib | .pdf ]
[599] Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient recursive subtyping. Mathematical Structures in Computer Science, 5(1):113-125, 1995. [ bib | .pdf ]
[600] Shriram Krishnamurthi, Matthias Felleisen, and Bruce F. Duba. From macros to reusable generative programming. In Generative and Component-Based Software Engineering, volume 1799 of Lecture Notes in Computer Science, pages 105-120. Springer, September 1999. [ bib | .ps ]
[601] Neelakantan R. Krishnaswami, Jonathan Aldrich, Lars Birkedal, Kasper Svendsen, and Alexandre Buisse. Design patterns in separation logic. In Types in Language Design and Implementation (TLDI), pages 105-116, January 2009. [ bib | .pdf ]
[602] Neelakantan R. Krishnaswami, Aaron Turon, Derek Dreyer, and Deepak Garg. Superficially substructural types. In International Conference on Functional Programming (ICFP), pages 41-54, September 2012. [ bib | .pdf ]
[603] Daniel Kroening and Ofer Strichman. Decision procedures - an algorithmic point of view. Springer, 2008. [ bib | http ]
[604] George Kuan and David MacQueen. Efficient type inference using ranked type variables. In ACM Workshop on ML, pages 3-14, October 2007. [ bib | .pdf ]
[605] Viktor Kuncak and Martin Rinard. On the theory of structural subtyping. Technical Report 879, MIT Laboratory for Computer Science, January 2003. [ bib | .ps ]
[606] Viktor Kuncak and Martin Rinard. Structural subtyping of non-recursive types is decidable. In Logic in Computer Science (LICS), June 2003. [ bib | .pdf ]
[607] Charlie Lai, Li Gong, Larry Koved, Anthony J. Nadalin, and Roland Schemers. User authentication and authorization in the Java platform. In Annual Computer Security Applications Conference, pages 285-290, December 1999. [ bib | .pdf ]
[608] Peter Lammich. Verified efficient implementation of Gabow's strongly connected component algorithm. In Interactive Theorem Proving, volume 8558 of Lecture Notes in Computer Science, pages 325-340. Springer, July 2014. [ bib | .pdf ]
[609] Butler W. Lampson. A note on the confinement problem. Communications of the ACM, 16(10):613-615, October 1973. [ bib | .html ]
[610] Peter J. Landin. The mechanical evaluation of expressions. Computer Journal, 6(4):308-320, January 1964. [ bib ]
[611] Peter J. Landin. Correspondence between ALGOL 60 and Church's lambda-notation: part I. Communications of the ACM, 8(2):89-101, 1965. [ bib | http ]
[612] James Richard Larus. Restructuring symbolic programs for concurrent execution on multiprocessors. PhD thesis, EECS Department, University of California, Berkeley, May 1989. Technical Report UCB/CSD-89-502. [ bib | .pdf ]
[613] Soren B. Lassen. Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context. In Mathematical Foundations of Programming Semantics, volume 20 of Electronic Notes in Theoretical Computer Science, pages 346-374. Elsevier Science, April 1999. [ bib | .ps ]
[614] Soren B. Lassen. Head normal form bisimulation for pairs and the λμ-calculus. In Logic in Computer Science (LICS), pages 297-306, August 2006. [ bib | .pdf ]
[615] Jean-Louis Lassez, Michael J. Maher, and Kim G. Marriott. Unification revisited. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 15, pages 587-625. Morgan Kaufmann, 1988. [ bib ]
[616] Jean-Louis Lassez, V. L. Nguyen, and Liz Sonenberg. Fixed point theorems and semantics: a folk tale. Information Processing Letters, 14(3):112-116, May 1982. [ bib | http ]
[617] Konstantin Läufer and Martin Odersky. Polymorphic type inference and abstract data types. ACM Transactions on Programming Languages and Systems, 16(5):1411-1430, September 1994. [ bib | .pdf ]
[618] John Launchbury and Simon Peyton Jones. State in Haskell. LISP and Symbolic Computation, 8(4):293-341, 1995. [ bib | http ]
[619] Vincent Laviron, Bor-Yuh Evan Chang, and Xavier Rival. Separating shape graphs. In European Symposium on Programming (ESOP), volume 6012 of Lecture Notes in Computer Science, pages 387-406. Springer, March 2010. [ bib | .pdf ]
[620] Didier Le Botlan and Didier Rémy. MLF: Raising ML to the power of system F. In International Conference on Functional Programming (ICFP), pages 27-38, August 2003. [ bib | .pdf ]
[621] Baudouin Le Charlier and Pascal Van Hentenryck. A universal top-down fixpoint algorithm. Technical Report CS-92-25, Brown University, May 1992. [ bib | .ps.gz ]
[622] Fabrice Le Fessant and Luc Maranget. Optimizing pattern matching. In International Conference on Functional Programming (ICFP), 2001. [ bib | .ps.gz ]
[623] Christopher League, Zhong Shao, and Valery Trifonov. Representing Java classes in a typed intermediate language. In International Conference on Functional Programming (ICFP), pages 183-196, September 1999. [ bib | .html ]
[624] Christopher League, Zhong Shao, and Valery Trifonov. Type-preserving compilation of Featherweight Java. ACM Transactions on Programming Languages and Systems, 24(2):112-152, March 2002. [ bib | .html ]
[625] Christopher League, Zhong Shao, and Valery Trifonov. Precision in practice: a type-preserving Java compiler. In Compiler Construction (CC), volume 2622 of Lecture Notes in Computer Science, pages 106-120. Springer, April 2003. [ bib | .html ]
[626] Gary T. Leavens and Albert L. Baker. Enhancing the pre- and postcondition technique for more expressive specifications. In Formal Methods (FM), volume 1709 of Lecture Notes in Computer Science, pages 1087-1106. Springer, January 1999. [ bib | http ]
[627] Gary T. Leavens, Erik Poll, Curtis Clifton, Yoonsik Cheon, Clyde Ruby, David Cok, Peter Müller, Joseph Kiniry, Patrice Chalin, and Daniel M. Zimmerman. JML reference manual, May 2008. [ bib | .pdf ]
[628] Sylvain Lebresne. A system F with call-by-name exceptions. In International Colloquium on Automata, Languages and Programming, volume 5126 of Lecture Notes in Computer Science, pages 323-335. Springer, June 2008. [ bib | .pdf ]
[629] Oukseh Lee and Kwangkeun Yi. Proofs about a folklore let-polymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems, 20(4):707-723, 1998. [ bib | http ]
[630] K. Rustan M. Leino. Efficient weakest preconditions. Information Processing Letters, 93(6):281-288, 2005. [ bib | .pdf ]
[631] K. Rustan M. Leino. Dafny: An automatic program verifier for functional correctness. In Logic for Programming Artificial Intelligence and Reasoning (LPAR), volume 6355 of Lecture Notes in Computer Science, pages 348-370. Springer, April 2010. [ bib | .pdf ]
[632] K. Rustan M. Leino and Peter Müller. A basis for verifying multi-threaded programs. In European Symposium on Programming (ESOP), volume 5502 of Lecture Notes in Computer Science, pages 378-393. Springer, March 2009. [ bib | .pdf ]
[633] K. Rustan M. Leino, Peter Müller, and Jan Smans. Verification of concurrent programs with Chalice. In Foundations of Security Analysis and Design, volume 5705 of Lecture Notes in Computer Science, pages 195-222. Springer, 2009. [ bib | .pdf ]
[634] K. Rustan M. Leino, Peter Müller, and Jan Smans. Deadlock-free channels and locks. In European Symposium on Programming (ESOP), volume 6012 of Lecture Notes in Computer Science, pages 407-426. Springer, March 2010. [ bib | .pdf ]
[635] K. Rustan M. Leino and Greg Nelson. Data abstraction and information hiding. ACM Transactions on Programming Languages and Systems, 24(5):491-553, 2002. [ bib | .pdf ]
[636] K. Rustan M. Leino and Wolfram Schulte. Using history invariants to verify observers. In European Symposium on Programming (ESOP), volume 4421 of Lecture Notes in Computer Science, pages 80-94. Springer, 2007. [ bib | .pdf ]
[637] Xavier Leroy. Polymorphic typing of an algorithmic language. Research Report 1778, INRIA, October 1992. [ bib | .ps.gz ]
[638] Xavier Leroy. Typage polymorphe d'un langage algorithmique. PhD thesis, Université Paris 7, June 1992. [ bib | .ps.gz ]
[639] Xavier Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In Principles of Programming Languages (POPL), pages 42-54, January 2006. [ bib | .pdf ]
[640] Xavier Leroy, Damien Doligez, Jacques Garrigue, Didier Rémy, and Jérôme Vouillon. The Objective Caml system, October 2005. [ bib | http ]
[641] Xavier Leroy, Damien Doligez, Michel Mauny, and Pierre Weis. The Caml Light system, release 0.75, 2002. [ bib | http ]
[642] Xavier Leroy and François Pottier. Notes du cours de DEA « typage et programmation », December 2002. [ bib | .ps.gz ]
[643] Stéphane Lescuyer. Codage de la logique du premier ordre polymorphe multi-sortée dans la logique sans sortes. Master's thesis, Master Parisien de Recherche en Informatique, 2006. [ bib | .pdf ]
[644] Pierre Letouzey. Programmation fonctionnelle certifiée - l'extraction de programmes dans l'assistant Coq. PhD thesis, Université Paris 11, July 2004. [ bib | .ps.gz ]
[645] Paul Blain Levy. Possible world semantics for general storage in call-by-value. In Computer Science Logic, volume 2471 of Lecture Notes in Computer Science. Springer, 2002. [ bib | .ps ]
[646] Jeffrey Lewis, Mark Shields, Erik Meijer, and John Launchbury. Implicit parameters: Dynamic scoping with static types. In Principles of Programming Languages (POPL), pages 108-118, January 2000. [ bib | .ps ]
[647] Ruy Ley-Wild and Aleksandar Nanevski. Subjective auxiliary state for coarse-grained concurrency. In Principles of Programming Languages (POPL), pages 561-574, January 2013. [ bib | .pdf ]
[648] Daniel R. Licata and Robert Harper. A universe of binding and computation. In International Conference on Functional Programming (ICFP), pages 123-134, September 2009. [ bib | .pdf ]
[649] Daniel R. Licata, Noam Zeilberger, and Robert Harper. Focusing on binding and computation. In Logic in Computer Science (LICS), pages 241-252, June 2008. [ bib | .pdf ]
[650] Daniel R. Licata, Noam Zeilberger, and Robert Harper. Focusing on binding and computation. Technical Report CMU-CS-08-101, Carnegie Mellon University, February 2008. [ bib | .pdf ]
[651] Barbara Liskov and Jeannette M. Wing. A behavioral notion of subtyping. ACM Transactions on Programming Languages and Systems, 16(6):1811-1841, 1994. [ bib | .pdf ]
[652] Xinxin Liu and Scott A. Smolka. Simple linear-time algorithms for minimal fixed points. In International Colloquium on Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 53-66. Springer, July 1998. [ bib | http ]
[653] John Longley. When is a functional program not a functional program? In International Conference on Functional Programming (ICFP), pages 1-7, September 1999. [ bib | http ]
[654] John Longley and Randy Pollack. Reasoning about CBV functional programs in Isabelle/HOL. In Theorem Proving in Higher Order Logics (TPHOLs), volume 3223 of Lecture Notes in Computer Science, pages 201-216. Springer, September 2004. [ bib | .pdf ]
[655] John M. Lucassen and David K. Gifford. Polymorphic effect systems. In Principles of Programming Languages (POPL), pages 47-57, January 1988. [ bib | .pdf ]
[656] Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate with class: extensible generic functions. Submitted, April 2005. [ bib | .ps ]
[657] Ralf Lämmel, Joost Visser, and Jan Kort. Dealing with large bananas. In Workshop on Generic Programming, pages 46-59, July 2000. [ bib | .ps ]
[658] David B. MacQueen, Gordon D. Plotkin, and Ravi Sethi. An ideal model for recursive polymorphic types. Information and Control, 71(1-2):95-130, October-November 1986. [ bib ]
[659] Angelika Mader. Verification of modal properties using Boolean equation systems. PhD thesis, Technische Universität München, 1997. [ bib | .pdf ]
[660] Toshiyuki Maeda, Haruki Sato, and Akinori Yonezawa. Extended alias type system using separating implication. In Types in Language Design and Implementation (TLDI), January 2011. [ bib | http ]
[661] Michael J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Logic in Computer Science (LICS), pages 348-357, July 1988. [ bib ]
[662] Harry G. Mairson. Deciding ML typability is complete for deterministic exponential time. In Principles of Programming Languages (POPL), pages 382-401, 1990. [ bib | http ]
[663] Harry G. Mairson, Paris C. Kanellakis, and John C. Mitchell. Unification and ML type reconstruction. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 444-478. MIT Press, 1991. [ bib ]
[664] Claude Marché, Christine Paulin-Mohring, and Xavier Urbain. The Krakatoa tool for certification of Java/JavaCard programs annotated in JML. Journal of Logic and Algebraic Programming, 58(1-2):89-106, 2004. [ bib | .ps.gz ]
[665] Filip Marić. Formalization and implementation of modern SAT solvers. Journal of Automated Reasoning, 43:81-119, 2009. [ bib | .pdf ]
[666] Filip Marić. Formal verification of a modern SAT solver. Unpublished, January 2010. [ bib | .pdf ]
[667] Simon Marlow and Andy Gill. Happy: the parser generator for Haskell, April 2004. [ bib | http ]
[668] Simon Marlow and Philip Wadler. A practical subtyping system for Erlang. In International Conference on Functional Programming (ICFP), pages 136-149, June 1997. [ bib ]
[669] Kim Marriott and Martin Odersky. Negative Boolean constraints. Technical Report 94/203, Monash University, August 1994. [ bib | .ps.gz ]
[670] Alberto Martelli and Ugo Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258-282, April 1982. [ bib | http ]
[671] Radu Mateescu and Mihaela Sighireanu. Efficient on-the-fly model-checking for regular alternation-free mu-calculus. Science of Computer Programming, 46(3):255-281, 2003. [ bib | .pdf ]
[672] Michel Mauny and François Pottier. An implementation of Caml Light with existential types. Technical Report 2183, INRIA, 1993. [ bib | .ps.gz ]
[673] Karl Mazurak, Jianzhou Zhao, and Steve Zdancewic. Lightweight linear types in system Fo. In Types in Language Design and Implementation (TLDI), pages 77-88, January 2010. [ bib | .pdf ]
[674] Bruce J. McAdam. On the Unification of Substitutions in Type Inference. In Implementation of Functional Languages (IFL), volume 1595 of Lecture Notes in Computer Science, pages 139-154. Springer, September 1998. [ bib | .ps ]
[675] David McAllester. On the complexity analysis of static analyses. Journal of the ACM, 49(4):512-537, July 2002. [ bib | http ]
[676] David McAllester. A logical algorithm for ML type inference. In Rewriting Techniques and Applications (RTA), volume 2706 of Lecture Notes in Computer Science, pages 436-451. Springer, June 2003. [ bib | .ps ]
[677] Conor McBride. The derivative of a regular type is its type of one-hole contexts. Unpublished. [ bib | .pdf ]
[678] Conor McBride. First-order unification by structural recursion. Journal of Functional Programming, 13(6):1061-1075, 2003. [ bib | .ps.gz ]
[679] Conor McBride and James McKinna. I am not a number: I am a free variable. In Haskell workshop, September 2004. [ bib | .pdf ]
[680] Conor McBride and Ross Paterson. Applicative programming with effects. Journal of Functional Programming, 18(1):1-13, 2008. [ bib | .pdf ]
[681] James McKinna and Randy Pollack. Pure type systems formalized. In Typed Lambda Calculi and Applications (TLCA), number 664 in Lecture Notes in Computer Science, pages 289-305. Springer, March 1993. [ bib | .ps.gz ]
[682] James McKinna and Randy Pollack. Some lambda calculus and type theory formalized. Journal of Automated Reasoning, 23(3-4):373-409, 1999. [ bib ]
[683] John McLean. A general theory of composition for trace sets closed under selective interleaving functions. In IEEE Symposium on Security and Privacy (S&P), 1994. [ bib | .ps ]
[684] John McLean. Security models. In John Marciniak, editor, Encyclopedia of Software Engineering. John Wiley & Sons, 1994. [ bib | .ps ]
[685] Catherine Meadows. Formal verification of cryptographic protocols: A survey. In Advances in Cryptology - ASIACRYPT'94, volume 917 of Lecture Notes in Computer Science, pages 133-150. Springer, 1995. [ bib | .ps ]
[686] Farhad Mehta and Tobias Nipkow. Proving pointer programs in higher-order logic. Information and Computation, 199(1-2):200-227, 2005. [ bib | .ps.gz ]
[687] Thomas F. Melham. The HOL logic extended with quantification over type variables. Formal Methods in System Design, 3(1-2):7-24, August 1993. [ bib | .pdf ]
[688] David Melski and Thomas Reps. Interconvertibility of a class of set constraints and context-free language reachability. Theoretical Computer Science, 248(1-2), November 2000. [ bib | .ps ]
[689] Stephan Merz. Model checking: A tutorial overview. In Fourth Summer School on Modeling and Verification of Parallel Processes, volume 2067 of Lecture Notes in Computer Science, pages 3-38. Springer, 2001. [ bib | .pdf ]
[690] Stephan Merz. An introduction to model checking. In N. Navet and S. Merz, editors, Modeling and Verification of Real-Time Systems: Formalisms and Software Tools, pages 77-109. ISTE Publishing, 2008. [ bib | .pdf ]
[691] Dale Miller. An extension to ML to handle bound variables in data structures. In Logical Frameworks BRA Workshop, May 1990. [ bib | .pdf ]
[692] Dale Miller. Unification under a mixed prefix. Journal of Symbolic Computation, 14(4):321-358, 1992. [ bib | .pdf ]
[693] Todd Millstein and Craig Chambers. Modular statically typed multimethods. In European Conference on Object-Oriented Programming (ECOOP), volume 1628 of Lecture Notes in Computer Science, pages 279-303. Springer, June 1999. [ bib | .ps ]
[694] Todd Millstein and Craig Chambers. Modular statically typed multimethods. Information and Computation, 175(1):76-118, May 2002. [ bib | .ps ]
[695] Robin Milner. Implementation and applications of Scott's logic for computable functions. In Proceedings of the ACM conference on proving assertions about programs, pages 1-6, January 1972. [ bib | http ]
[696] Robin Milner. Logic for computable functions - description of a machine implementation. Technical Report CS-TR-72-288, Stanford University, Department of Computer Science, May 1972. [ bib | .pdf ]
[697] Robin Milner. Models of LCF. Technical Report CS-TR-73-332, Stanford University, Department of Computer Science, January 1973. [ bib | .pdf ]
[698] Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348-375, December 1978. [ bib | http ]
[699] Robin Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, October 1991. [ bib | .ps.Z ]
[700] Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, part 2. Technical Report ECS-LFCS-89-86, Laboratory for Foundations of Computer Science, School of Informatics at the University of Edinburgh, 1989. [ bib | .ps ]
[701] Robin Milner and Davide Sangiorgi. Barbed bisimulation. In International Colloquium on Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science, pages 685-695. Springer, July 1992. [ bib | .ps.gz ]
[702] Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The definition of Standard ML - revised. MIT Press, May 1997. [ bib ]
[703] Yasuhiko Minamide. A functional representation of data structures with a hole. In Principles of Programming Languages (POPL), pages 75-84, January 1998. [ bib | .pdf ]
[704] Yasuhiko Minamide, Greg Morrisett, and Robert Harper. Typed closure conversion. In Principles of Programming Languages (POPL), pages 271-283, January 1996. [ bib | .ps ]
[705] David G. Mitchell. A SAT solver primer. Bulletin of the EATCS, 85:112-133, February 2005. [ bib | .pdf ]
[706] John C. Mitchell. Coercion and type inference. In Principles of Programming Languages (POPL), pages 175-185, January 1984. [ bib | http ]
[707] John C. Mitchell. Representation independence and data abstraction. In Principles of Programming Languages (POPL), pages 263-276, 1986. [ bib | http ]
[708] John C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76(2-3):211-249, 1988. [ bib | http ]
[709] John C. Mitchell. Type inference with simple subtypes. Journal of Functional Programming, 1(3):245-286, July 1991. [ bib ]
[710] John C. Mitchell. Foundations for programming languages. MIT Press, 1996. [ bib ]
[711] John C. Mitchell and Gordon D. Plotkin. Abstract types have existential type. ACM Transactions on Programming Languages and Systems, 10(3):470-502, 1988. [ bib | .pdf ]
[712] Masaaki Mizuno and David A. Schmidt. A security flow control algorithm and its denotational semantics correctness proof. Formal Aspects of Computing, 4(6A):727-754, 1992. [ bib | .ps.Z ]
[713] Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, University of Edinburgh, June 1989. [ bib | .ps.gz ]
[714] Eugenio Moggi. Computational λ-calculus and monads. In Logic in Computer Science (LICS), pages 14-23, June 1989. [ bib | .ps.gz ]
[715] Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991. [ bib | .pdf ]
[716] Eugenio Moggi and Amr Sabry. An abstract monadic semantics for value recursion. Informatique théorique et applications, 38(4):377-400, 2004. [ bib | .pdf ]
[717] Anders Møller and Michael I. Schwartzbach. The pointer assertion logic engine. In Programming Language Design and Implementation (PLDI), pages 221-231, June 2001. [ bib | .pdf ]
[718] Stefan Monnier. Statically tracking state with typed regions. Unpublished, May 2008. [ bib | .pdf ]
[719] Benoît Montagu and Didier Rémy. Modeling abstract types in modules with open existential types. In Principles of Programming Languages (POPL), pages 63-74, January 2009. [ bib | .pdf ]
[720] James H. Morris, Donald E. Knuth, and Vaughan R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350, June 1977. [ bib | .pdf ]
[721] Greg Morrisett and Robert Harper. Typed closure conversion for recursively-defined functions (extended abstract). In Higher Order Operational Techniques in Semantics (HOOTS), volume 10 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1998. [ bib | .ps ]
[722] Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From system F to typed assembly language. ACM Transactions on Programming Languages and Systems, 21(3):528-569, May 1999. [ bib | .pdf ]
[723] Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference (DAC), July 2001. [ bib | .pdf ]
[724] Peter D. Mosses. Modular structural operational semantics. Journal of Logic and Algebraic Programming, 60-61:195-228, 2004. [ bib | .pdf ]
[725] Gilles Muller, Renaud Marlet, Eugen-Nicolae Volanschi, Charles Consel, Calton Pu, and Ashvin Goel. Fast, optimized Sun RPC using automatic program specialization. In International Conference on Distributed Computing Systems (CDCS), pages 240-249, May 1998. [ bib | .pdf ]
[726] Martin Müller. A constraint-based recast of ML-polymorphism. In International Workshop on Unification, June 1994. Technical Report 94-R-243, CRIN, Nancy, France. [ bib | .ps ]
[727] Martin Müller. Notes on HM(X). Unpublished, August 1998. [ bib | .ps.gz ]
[728] Martin Müller, Joachim Niehren, and Ralf Treinen. The first-order theory of ordering constraints over feature trees. Discrete Mathematics and Theoretical Computer Science, 4(2):193-234, 2001. [ bib | .ps ]
[729] Martin Müller and Susumu Nishimura. Type inference for first-class messages with feature constraints. In Asian Computer Science Conference (ASIAN), volume 1538 of Lecture Notes in Computer Science, pages 169-187. Springer, December 1998. [ bib | .ps ]
[730] Martin Müller and Susumu Nishimura. Type inference for first-class messages with feature constraints. International Journal of Foundations of Computer Science, 11(1):29-63, 2000. [ bib ]
[731] Peter Müller and Arnd Poetzsch-Heffter. Universes: A type system for alias and dependency control. Technical Report 279, Fernuniversität Hagen, 2001. [ bib | .pdf ]
[732] Peter Müller and Arsenii Rudich. Ownership transfer in universe types. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 461-478, October 2007. [ bib | http ]
[733] Alan Mycroft. Polymorphic type schemes and recursive definitions. In International Symposium on Programming, volume 167 of Lecture Notes in Computer Science, pages 217-228. Springer, April 1984. [ bib | http ]
[734] Andrew C. Myers. JFlow: practical mostly-static information flow control. In Principles of Programming Languages (POPL), pages 228-241, January 1999. [ bib | .ps.gz ]
[735] Andrew C. Myers. Mostly-static decentralized information flow control. PhD thesis, Massachusetts Institute of Technology, January 1999. Technical Report MIT/LCS/TR-783. [ bib | .ps.gz ]
[736] Andrew C. Myers and Barbara Liskov. A decentralized model for information flow control. ACM Operating Systems Review, 31(5):129-142, October 1997. [ bib | .html ]
[737] Andrew C. Myers and Barbara Liskov. Complete, safe information flow with decentralized labels. In IEEE Symposium on Security and Privacy (S&P), pages 186-197, May 1998. [ bib | .html ]
[738] Andrew C. Myers and Barbara Liskov. Protecting privacy using the decentralized label model. ACM Transactions on Software Engineering and Methodology, 9(4):410-442, October 2000. [ bib | .ps.gz ]
[739] Andrew C. Myers and Andrei Sabelfeld. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, January 2003. [ bib | .pdf ]
[740] Rasmus Ejlers Møgelberg and Sam Staton. Full abstraction in a metalanguage for state. In Workshop on Syntax and Semantics of Low Level Languages, July 2010. [ bib ]
[741] Martin Müller, Joachim Niehren, and Andreas Podelski. Ordering constraints over feature trees. Constraints, an International Journal, 5(1-2):7-42, 2000. [ bib | .ps.gz ]
[742] Olaf Müller, Tobias Nipkow, David von Oheimb, and Oskar Slotosch. HOLCF = HOL + LCF. Journal of Functional Programming, 9:191-223, 1999. [ bib | .ps.gz ]
[743] Gopalan Nadathur and Xiaochu Qi. Explicit substitutions in the reduction of lambda terms. In Principles and Practice of Declarative Programming (PPDP), pages 195-206, August 2003. [ bib | .ps ]
[744] Karl Naden, Robert Bocchino, Jonathan Aldrich, and Kevin Bierhoff. A type system for borrowing permissions. In Principles of Programming Languages (POPL), pages 557-570, January 2012. [ bib | .pdf ]
[745] Hiroshi Nakano. A modality for recursion. In Logic in Computer Science (LICS), pages 255-266, June 2000. [ bib | .ps.gz ]
[746] Hiroshi Nakano. Fixed-point logic with the approximation modality and its Kripke completeness. In International Symposium on Theoretical Aspects of Computer Software (TACS), volume 2215 of Lecture Notes in Computer Science, pages 165-182. Springer, October 2001. [ bib | .pdf ]
[747] Aleksandar Nanevski. Meta-programming with names and necessity. Technical Report CMU-CS-02-123R, School of Computer Science, Carnegie Mellon University, November 2002. [ bib | .ps ]
[748] Aleksandar Nanevski, Amal Ahmed, Greg Morrisett, and Lars Birkedal. Abstract predicates and mutable ADTs in Hoare type theory. In European Symposium on Programming (ESOP), volume 4421 of Lecture Notes in Computer Science, pages 189-204. Springer, March 2007. [ bib | .pdf ]
[749] Aleksandar Nanevski, Greg Morrisett, and Lars Birkedal. Polymorphism and separation in Hoare type theory. In International Conference on Functional Programming (ICFP), pages 62-73, September 2006. [ bib | .pdf ]
[750] Aleksandar Nanevski, Greg Morrisett, and Lars Birkedal. Hoare type theory, polymorphism and separation. Journal of Functional Programming, 18(5-6):865-911, 2008. [ bib | .pdf ]
[751] Aleksandar Nanevski, Greg Morrisett, Avraham Shinnar, Paul Govereau, and Lars Birkedal. Ynot: dependent types for imperative programs. In International Conference on Functional Programming (ICFP), pages 229-240, September 2008. [ bib | .pdf ]
[752] Aleksandar Nanevski, Viktor Vafeiadis, and Josh Berdine. Structuring the verification of heap-manipulating programs. In Principles of Programming Languages (POPL), pages 261-274, January 2010. [ bib | .pdf ]
[753] Wolfgang Naraschewski and Tobias Nipkow. Type inference verified: Algorithm W in Isabelle/HOL. Journal of Automated Reasoning, 23:299-318, 1999. [ bib | .ps.gz ]
[754] David A. Naumann. On assertion-based encapsulation for object invariants and simulations. Formal Aspects of Computing, 19(2):205-224, 2007. [ bib | .pdf ]
[755] Juan Antonio Navarro Pérez and Andrey Rybalchenko. Separation logic + superposition calculus = heap theorem prover. In Programming Language Design and Implementation (PLDI), pages 556-566, June 2011. [ bib | .pdf ]
[756] Huu Hai Nguyen, Cristina David, Shengchao Qin, and Wei-Ngan Chin. Automated verification of shape and size properties via separation logic. In Verification, Model Checking and Abstract Interpretation (VMCAI), volume 4349 of Lecture Notes in Computer Science, pages 251-266. Springer, January 2007. [ bib | .pdf ]
[757] Jan Nicklisch and Simon Peyton Jones. An exploration of modular programs. In Functional Programming Workshop, July 1996. [ bib | .ps.gz ]
[758] Joachim Niehren, Martin Müller, and Andreas Podelski. Inclusion constraints over non-empty sets of trees. In Theory and Practice of Software Development (TAPSOFT), volume 1214 of Lecture Notes in Computer Science, pages 217-231. Springer, April 1997. [ bib | .ps ]
[759] Joachim Niehren and Tim Priesnitz. Non-structural subtype entailment in automata theory. In International Symposium on Theoretical Aspects of Computer Software (TACS). Springer, October 2001. [ bib | .ps.gz ]
[760] Joachim Niehren and Tim Priesnitz. Non-structural subtype entailment in automata theory. Information and Computation, 186(2):319-354, 2003. [ bib | .pdf ]
[761] Lasse R. Nielsen. A denotational investigation of defunctionalization. Technical Report RS-00-47, BRICS, December 2000. [ bib | http ]
[762] Flemming Nielson and Hanne Riis Nielson. Two-level semantics and code generation. Theoretical Computer Science, 56(1):59-133, January 1988. [ bib | http ]
[763] Flemming Nielson, Hanne Riis Nielson, and Helmut Seidl. A succinct solver for ALFP. Nordic Journal of Computing, 9(4):335-372, 2002. [ bib | .pdf ]
[764] Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM, 53(6):937-977, 2006. [ bib | .pdf ]
[765] Susumu Nishimura. Static typing for dynamic messages. In Principles of Programming Languages (POPL), pages 266-278, January 1998. [ bib | .ps.gz ]
[766] Russell O'Connor. Assembly: Circular programming with recursive do. The Monad.Reader, 6, January 2007. [ bib | .pdf ]
[767] Martin Odersky. Observers for linear types. In European Symposium on Programming (ESOP), volume 582 of Lecture Notes in Computer Science, pages 390-407. Springer, 1992. [ bib | .ps.gz ]
[768] Martin Odersky. A functional theory of local names. In Principles of Programming Languages (POPL), pages 48-59, January 1994. [ bib | .ps.gz ]
[769] Martin Odersky and Konstantin Läufer. An extension of ML with first-class abstract types. In ACM Workshop on ML and its Applications, pages 78-91, June 1992. [ bib | .pdf ]
[770] Martin Odersky and Konstantin Läufer. Putting type annotations to work. In Principles of Programming Languages (POPL), pages 54-67, January 1996. [ bib | .ps.gz ]
[771] Martin Odersky, Martin Sulzmann, and Martin Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999. [ bib | .pdf ]
[772] Martin Odersky, Philip Wadler, and Martin Wehr. A second look at overloading. In Functional Programming Languages and Computer Architecture (FPCA), pages 135-146, June 1995. [ bib | .ps.gz ]
[773] Martin Odersky, Christoph Zenger, Matthias Zenger, and Gang Chen. A functional view of join. Technical Report ACRC-99-016, University of South Australia, 1999. [ bib | .ps.gz ]
[774] Martin Odersky and Matthias Zenger. Scalable component abstractions. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 41-57, October 2005. [ bib | .pdf ]
[775] Martin Odersky, Matthias Zenger, and Christoph Zenger. Colored local type inference. In Principles of Programming Languages (POPL), pages 41-53, 2001. [ bib | .ps.gz ]
[776] Peter O'Hearn. On bunched typing. Journal of Functional Programming, 13(4):747-796, 2003. [ bib | .pdf ]
[777] Peter W. O'Hearn. Resources, concurrency and local reasoning. Theoretical Computer Science, 375(1-3):271-307, May 2007. [ bib | .pdf ]
[778] Peter W. O'Hearn and John C. Reynolds. From Algol to polymorphic linear lambda-calculus. Journal of the ACM, 47(1):167-223, 2000. [ bib | .ps ]
[779] Peter W. O'Hearn, Hongseok Yang, and John C. Reynolds. Separation and information hiding. In Principles of Programming Languages (POPL), pages 268-280, January 2004. [ bib | .pdf ]
[780] Peter W. O'Hearn, Hongseok Yang, and John C. Reynolds. Separation and information hiding. ACM Transactions on Programming Languages and Systems, 31(3), 2009. [ bib | .pdf ]
[781] Atsushi Ohori. A polymorphic record calculus and its compilation. ACM Transactions on Programming Languages and Systems, 17(6):844-895, November 1995. [ bib | http ]
[782] Atsushi Ohori and Peter Buneman. Type inference in a database programming language. In ACM Symposium on Lisp and Functional Programming (LFP), pages 174-183, 1988. [ bib | .pdf ]
[783] Chris Okasaki. Purely functional data structures. Technical Report CMU-CS-96-177, School of Computer Science, Carnegie Mellon University, September 1996. [ bib | .pdf ]
[784] Chris Okasaki. The role of lazy evaluation in amortized data structures. In International Conference on Functional Programming (ICFP), pages 62-72, May 1996. [ bib | .ps ]
[785] Chris Okasaki. Views for Standard ML. In ACM Workshop on ML, pages 14-23, September 1998. [ bib | .ps ]
[786] Chris Okasaki. Purely functional data structures. Cambridge University Press, 1999. [ bib | http ]
[787] Chris Okasaki and Andy Gill. Fast mergeable integer maps. In ACM Workshop on ML, pages 77-86, September 1998. [ bib | .ps ]
[788] Ernst-Rüdiger Olderog. A characterization of Hoare's logic for programs with Pascal-like procedures. In ACM Symposium on Theory of Computing, pages 320-329, 1983. [ bib | http ]
[789] Peter Ørbæk and Jens Palsberg. Trust in the λ-calculus. Journal of Functional Programming, 7(6):557-591, November 1997. [ bib | .pdf ]
[790] Joseph O'Rourke. Computational geometry in C, second edition. Cambridge University Press, 1998. [ bib | .html ]
[791] James William O'Toole, Jr. and David K. Gifford. Type reconstruction with first-class polymorphic values. In Programming Language Design and Implementation (PLDI), pages 207-217, 1989. [ bib | .ps ]
[792] Scott Owens, John H. Reppy, and Aaron Turon. Regular-expression derivatives re-examined. Journal of Functional Programming, 19(2):173-190, 2009. [ bib | .pdf ]
[793] David Pager. A practical general method for constructing LR(k) parsers. Acta Informatica, 7:249-268, 1977. [ bib | http ]
[794] Robert Paige and Fritz Henglein. Mechanical translation of set theoretic problem specifications into efficient RAM code - A case study. Journal of Symbolic Computation, 4(2):207-232, 1987. [ bib | http ]
[795] Robert Paige and Robert E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, December 1987. [ bib | .pdf ]
[796] Jens Palsberg. Efficient inference of object types. Information and Computation, 123(2):198-209, 1995. [ bib | .pdf ]
[797] Jens Palsberg and Patrick M. O'Keefe. A type system equivalent to flow analysis. ACM Transactions on Programming Languages and Systems, 17(4):576-599, July 1995. [ bib | .pdf ]
[798] Jens Palsberg and Peter Ørbæk. Trust in the λ-calculus. In Static Analysis Symposium (SAS), volume 983 of Lecture Notes in Computer Science, pages 314-330, September 1995. [ bib | .dvi.gz ]
[799] Jens Palsberg and Scott Smith. Constrained types and their expressiveness. ACM Transactions on Programming Languages and Systems, 18(5):519-527, September 1996. [ bib | .pdf ]
[800] Jens Palsberg, Mitchell Wand, and Patrick M. O'Keefe. Type inference with non-structural subtyping. Formal Aspects of Computing, 9:49-67, 1997. [ bib | .pdf ]
[801] Jens Palsberg and Tian Zhao. Efficient and flexible matching of recursive types. Information and Computation, 171:364-387, 2001. [ bib | .pdf ]
[802] Jens Palsberg and Tian Zhao. Efficient type inference for record concatenation and subtyping. In Logic in Computer Science (LICS), pages 125-136, July 2002. [ bib ]
[803] Jens Palsberg and Tian Zhao. Type inference for record concatenation and subtyping. Information and Computation, 189:54-86, 2004. [ bib | .pdf ]
[804] Matthew Parkinson and Gavin Bierman. Separation logic and abstraction. In Principles of Programming Languages (POPL), pages 247-258, January 2005. [ bib | .pdf ]
[805] Matthew Parkinson and Gavin Bierman. Separation logic, abstraction and inheritance. In Principles of Programming Languages (POPL), pages 75-86, January 2008. [ bib | .pdf ]
[806] David Lorge Parnas. Information distribution aspects of design methodology. In Information Processing 71, volume 1, pages 339-344, 1971. [ bib | .PDF ]
[807] David Lorge Parnas. On the criteria to be used in decomposing systems into modules. Communications of the ACM, 15(12):1053-1058, 1972. [ bib | http ]
[808] Pašalić and Nathan Linger. Meta-programming with typed object-language representations. In Generative Programming and Component Engineering (GPCE), pages 136-167, October 2004. [ bib | .ps ]
[809] Emir Pašalić, Tim Sheard, and Walid Taha. DALI: An untyped, CBV functional language supporting first-order datatypes with binders (technical development). Technical Report 00-007, Oregon Graduate Institute, March 2000. [ bib | .pdf ]
[810] Emir Pašalić, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In International Conference on Functional Programming (ICFP), pages 218-229, October 2002. [ bib | .pdf ]
[811] M. S. Paterson and M. N. Wegman. Linear unification. In Annual ACM Symposium on Theory of Computing, pages 181-186, 1976. [ bib ]
[812] Christine Paulin-Mohring. Extracting Fω's programs from proofs in the calculus of constructions. In Principles of Programming Languages (POPL), pages 89-104, January 1989. [ bib | http ]
[813] Christine Paulin-Mohring. Inductive definitions in the system Coq: rules and properties. Research Report RR1992-49, ENS Lyon, 1992. [ bib | .ps.Z ]
[814] Thomas J. Pennello. Very fast LR parsing. In Symposium on Compiler Construction, pages 145-151, 1986. [ bib | http ]
[815] François Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340-377, 2000. [ bib | .ps.gz ]
[816] John Peterson and Mark P. Jones. Implementing type classes. In Programming Language Design and Implementation (PLDI), pages 227-236, June 1993. [ bib | .ps ]
[817] Simon Peyton Jones. The implementation of functional programming languages. Prentice Hall, 1987. [ bib | http ]
[818] Simon Peyton Jones, editor. Haskell 98 language and libraries: The revised report. Cambridge University Press, April 2003. [ bib | http ]
[819] Simon Peyton Jones. Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. Online lecture notes, January 2009. [ bib | .pdf ]
[820] Simon Peyton Jones and Mark Shields. Lexically-scoped type variables. Manuscript, April 2004. [ bib | http ]
[821] Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Mark Shields. Practical type inference for arbitrary-rank types. Journal of Functional Programming, 17(1):1-82, 2007. [ bib | .pdf ]
[822] Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Geoffrey Washburn. Simple unification-based type inference for GADTs. In International Conference on Functional Programming (ICFP), pages 50-61, September 2006. [ bib | .pdf ]
[823] Simon Peyton Jones and Philip Wadler. Imperative functional programming. In Principles of Programming Languages (POPL), pages 71-84, January 1993. [ bib | .ps.gz ]
[824] Simon Peyton Jones, Geoffrey Washburn, and Stephanie Weirich. Wobbly types: type inference for generalised algebraic data types. Technical Report MS-CIS-05-26, University of Pennsylvania, July 2004. [ bib | .pdf ]
[825] Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Programming Language Design and Implementation (PLDI), pages 199-208, June 1988. [ bib | http ]
[826] Frank Pfenning and Peter Lee. LEAP: A language with eval and polymorphism. In Theory and Practice of Software Development (TAPSOFT), volume 352 of Lecture Notes in Computer Science, pages 345-359. Springer, 1989. [ bib | http ]
[827] Brigitte Pientka. Proof pearl: The power of higher-order encodings in the logical framework LF. In Theorem Proving in Higher Order Logics (TPHOLs), volume 4732 of Lecture Notes in Computer Science, pages 246-261. Springer, September 2007. [ bib | .pdf ]
[828] Brigitte Pientka. A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. In Principles of Programming Languages (POPL), pages 371-382, January 2008. [ bib | .pdf ]
[829] Brigitte Pientka and Joshua Dunfield. Programming with proofs and explicit contexts. In Principles and Practice of Declarative Programming (PPDP), pages 163-173, July 2008. [ bib | .pdf ]
[830] Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In Logic in Computer Science (LICS), pages 376-385, June 1993. [ bib | .ps ]
[831] Benjamin C. Pierce. Bounded quantification is undecidable. Information and Computation, 112(1):131-165, July 1994. [ bib | .ps ]
[832] Benjamin C. Pierce. Types and programming languages. MIT Press, 2002. [ bib | http ]
[833] Benjamin C. Pierce. Types and programming languages. MIT Press, 2002. [ bib ]
[834] Benjamin C. Pierce and David N. Turner. Statically typed friendly functions via partially abstract types. Technical Report ECS-LFCS-93-256, University of Edinburgh, LFCS, April 1993. Also available as INRIA Research Report 1899. [ bib | .ps ]
[835] Benjamin C. Pierce and David N. Turner. Simple type-theoretic foundations for object-oriented programming. Journal of Functional Programming, 4(2):207-247, April 1994. [ bib | .ps ]
[836] Benjamin C. Pierce and David N. Turner. Local type inference. ACM Transactions on Programming Languages and Systems, 22(1):1-44, January 2000. [ bib | http ]
[837] Alexandre Pilkiewicz and François Pottier. The essence of monotonic state. In Types in Language Design and Implementation (TLDI), January 2011. [ bib | .pdf ]
[838] Andrew M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321-359, 2000. [ bib | .pdf ]
[839] Andrew M. Pitts. Nominal logic, A first order theory of names and binding. Information and Computation, 186:165-193, 2003. [ bib | .pdf ]
[840] Andrew M. Pitts. Alpha-structural recursion and induction. In Theorem Proving in Higher Order Logics (TPHOLs), Lecture Notes in Computer Science. Springer, August 2005. [ bib | .pdf ]
[841] Andrew M. Pitts. Alpha-structural recursion and induction. Journal of the ACM, 53:459-506, 2006. [ bib | .pdf ]
[842] Andrew M. Pitts. Nominal System T. In Principles of Programming Languages (POPL), pages 159-170, January 2010. [ bib | .pdf ]
[843] Andrew M. Pitts and Murdoch J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Mathematics of Program Construction (MPC), volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer, 2000. [ bib | .pdf ]
[844] Gordon Plotkin. An illative theory of relations. In Situation Theory and its Applications, number 22 in CSLI Lecture Notes, pages 133-146. Stanford University, 1990. [ bib | .pdf ]
[845] Gordon D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):225-255, 1977. [ bib | .pdf ]
[846] Randy Pollack, Masahiko Sato, and Wilmer Ricciotti. A canonical locally named representation of binding. Journal of Automated Reasoning, 49(2):185-207, 2012. [ bib | .pdf ]
[847] Satya Kiran Popuri. Understanding C parsers generated by GNU Bison, September 2006. [ bib | .html ]
[848] Adam Poswolsky and Carsten Schürmann. Practical programming with higher-order encodings and dependent types. In European Symposium on Programming (ESOP), volume 4960 of Lecture Notes in Computer Science, pages 93-107. Springer, March 2008. [ bib | .pdf ]
[849] Adam Poswolsky and Carsten Schürmann. System description: Delphin - A functional programming language for deductive systems. Electronic Notes in Theoretical Computer Science, 228:113-120, 2009. [ bib | .pdf ]
[850] François Pottier. Implémentation d'un système de modules évolué en Caml-Light. Research Report 2449, INRIA, 1995. [ bib | .ps.gz ]
[851] François Pottier. Type inference and simplification for recursively constrained types. In Actes du GDR Programmation 1995 (journée du pôle Programmation Fonctionnelle), November 1995. [ bib | .ps.gz ]
[852] François Pottier. Simplifying subtyping constraints. In International Conference on Functional Programming (ICFP), pages 122-133, January 1996. [ bib | .ps.gz ]
[853] François Pottier. A framework for type inference with subtyping. In International Conference on Functional Programming (ICFP), pages 228-238, September 1998. [ bib | .ps.gz ]
[854] François Pottier. Synthèse de types en présence de sous-typage: de la théorie à la pratique. PhD thesis, Université Paris 7, July 1998. [ bib | .ps.gz ]
[855] François Pottier. Type inference in the presence of subtyping: from theory to practice. Research Report 3483, INRIA, September 1998. [ bib | .pdf ]
[856] François Pottier. A 3-part type inference engine. In European Symposium on Programming (ESOP), volume 1782 of Lecture Notes in Computer Science, pages 320-335. Springer, March 2000. [ bib | .ps.gz ]
[857] François Pottier. A versatile constraint-based type inference system. Nordic Journal of Computing, 7(4):312-347, November 2000. [ bib | .ps.gz ]
[858] François Pottier. Wallace: an efficient implementation of type inference with subtyping, February 2000. [ bib | http ]
[859] François Pottier. A semi-syntactic soundness proof for HM(X). Research Report 4150, INRIA, March 2001. [ bib | .pdf ]
[860] François Pottier. Simplifying subtyping constraints: a theory. Information and Computation, 170(2):153-183, November 2001. [ bib | .ps.gz ]
[861] François Pottier. A simple view of type-secure information flow in the π-calculus. In IEEE Computer Security Foundations Workshop, pages 320-330, June 2002. [ bib | .ps.gz ]
[862] François Pottier. A constraint-based presentation and generalization of rows. In Logic in Computer Science (LICS), pages 331-340, June 2003. [ bib | .ps.gz ]
[863] François Pottier. Cαml, June 2005. [ bib | http ]
[864] François Pottier. An overview of Cαml. In ACM Workshop on ML, volume 148(2) of Electronic Notes in Theoretical Computer Science, pages 27-52, March 2006. [ bib | .pdf ]
[865] François Pottier. Static name control for FreshML. In Logic in Computer Science (LICS), pages 356-365, July 2007. [ bib | .pdf ]
[866] François Pottier. Hiding local state in direct style: a higher-order anti-frame rule. In Logic in Computer Science (LICS), pages 331-340, June 2008. [ bib | .pdf ]
[867] François Pottier. Generalizing the higher-order frame and anti-frame rules. Unpublished, July 2009. [ bib | .pdf ]
[868] François Pottier. Three comments on the anti-frame rule. Unpublished, July 2009. [ bib | .pdf ]
[869] François Pottier. Syntactic soundness proof of a type-and-capability system with hidden state. Journal of Functional Programming, 23(1):38-144, January 2013. [ bib | .pdf ]
[870] François Pottier and Sylvain Conchon. Information flow inference for free. In International Conference on Functional Programming (ICFP), pages 46-57, September 2000. [ bib | .ps.gz ]
[871] François Pottier and Nadji Gauthier. Polymorphic typed defunctionalization. In Principles of Programming Languages (POPL), pages 89-98, January 2004. [ bib | .pdf ]
[872] François Pottier and Nadji Gauthier. Polymorphic typed defunctionalization and concretization. Higher-Order and Symbolic Computation, 19:125-162, March 2006. [ bib | .ps.gz | .pdf ]
[873] François Pottier and Jonathan Protzenko. Programming with permissions in Mezzo. In International Conference on Functional Programming (ICFP), pages 173-184, September 2013. [ bib | .pdf ]
[874] François Pottier and Yann Régis-Gianas. The Menhir parser generator. http://gallium.inria.fr/~fpottier/menhir/. [ bib ]
[875] François Pottier and Yann Régis-Gianas. Stratified type inference for generalized algebraic data types. In Principles of Programming Languages (POPL), pages 232-244, January 2006. [ bib | .pdf ]
[876] François Pottier and Yann Régis-Gianas. Towards efficient, typed LR parsers. Electronic Notes in Theoretical Computer Science, 148(2):155-180, 2006. [ bib | .pdf ]
[877] François Pottier and Didier Rémy. The essence of ML type inference. Draft of an extended version. Unpublished, September 2003. [ bib | .ps.gz ]
[878] François Pottier and Didier Rémy. The essence of ML type inference. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 10, pages 389-489. MIT Press, 2005. [ bib | .pdf ]
[879] François Pottier and Vincent Simonet. Information flow inference for ML. In Principles of Programming Languages (POPL), pages 319-330, January 2002. [ bib | .ps.gz ]
[880] François Pottier and Vincent Simonet. Information flow inference for ML. ACM Transactions on Programming Languages and Systems, 25(1):117-158, January 2003. [ bib | .ps.gz ]
[881] François Pottier, Christian Skalka, and Scott Smith. A systematic approach to static access control. In European Symposium on Programming (ESOP), volume 2028 of Lecture Notes in Computer Science, pages 30-45. Springer, April 2001. [ bib | .ps.gz ]
[882] François Pottier, Christian Skalka, and Scott Smith. A systematic approach to static access control. ACM Transactions on Programming Languages and Systems, 27(2):344-382, 2005. [ bib | .ps.gz ]
[883] Garrel Pottinger. A type assignment for the strongly normalizable λ-terms. In J. Roger Hindley and Jonathan P. Seldin, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, pages 561-577. Academic Press, 1980. [ bib ]
[884] Nicolas Pouillard. Nameless, painless. In International Conference on Functional Programming (ICFP), pages 320-332, September 2011. [ bib | .pdf ]
[885] Nicolas Pouillard and François Pottier. A fresh look at programming with names and binders. In International Conference on Functional Programming (ICFP), pages 217-228, September 2010. [ bib | .pdf ]
[886] Vaughan Pratt and Jerzy Tiuryn. Satisfiability of inequalities in a poset. Fundamenta Informaticæ, 28(1-2):165-182, 1996. [ bib | .ps.gz ]
[887] William Pugh and Grant Weddell. Two-directional record layout for multiple inheritance. In Programming Language Design and Implementation (PLDI), pages 85-91, 1990. [ bib | http ]
[888] Zhenyu Qian. Unification of higher-order patterns in linear time and space. Journal of Logic and Computation, 6(3):315-341, 1996. [ bib ]
[889] Christophe Raffalli. Type checking in system Fη. Prépublication 98-05a, LAMA, Université de Savoie, 1998. [ bib | .ps ]
[890] Christophe Raffalli. An optimized complete semi-algorithm for system Fη. Unpublished, 1999. [ bib | .ps ]
[891] Viswanath Ramachandran and Pascal Van Hentenryck. Incremental algorithms for constraint solving and entailment over rational trees. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 205-217, 1993. [ bib ]
[892] Franz Regensburger. HOLCF: Higher order logic of computable functions. In Theorem Proving in Higher Order Logics (TPHOLs), volume 971 of Lecture Notes in Computer Science, pages 293-307. Springer, September 1995. [ bib | .pdf ]
[893] Jakob Rehof. Minimal typings in atomic subtyping. Technical Report D-278, Department of Computer Science, University of Copenhagen, 1996. [ bib | .ps.gz ]
[894] Jakob Rehof. Minimal typings in atomic subtyping. In Principles of Programming Languages (POPL), pages 278-291, January 1997. [ bib | .ps ]
[895] Jakob Rehof and Manuel Fähndrich. Type-based flow analysis: From polymorphic subtyping to CFL-reachability. In Principles of Programming Languages (POPL), pages 54-66, January 2001. [ bib | .ps ]
[896] Brian Reistad and David K. Gifford. Static dependent costs for estimating execution time. In ACM Symposium on Lisp and Functional Programming (LFP), pages 65-78, 1994. [ bib | http ]
[897] Didier Rémy. Extending ML type system with a sorted equational theory. Technical Report 1766, INRIA, 1992. [ bib | .pdf ]
[898] Didier Rémy. Projective ML. In ACM Symposium on Lisp and Functional Programming (LFP), pages 66-75, 1992. [ bib | .pdf ]
[899] Didier Rémy. Syntactic theories and the algebra of record terms. Research Report 1869, INRIA, 1993. [ bib | .pdf ]
[900] Didier Rémy. Programming objects with ML-ART: An extension to ML with abstract and record types. In International Symposium on Theoretical Aspects of Computer Software (TACS), pages 321-346. Springer, April 1994. [ bib | .pdf ]
[901] Didier Rémy. Type inference for records in a natural extension of ML. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming: Types, Semantics and Language Design. MIT Press, 1994. [ bib | .pdf ]
[902] Didier Rémy. Typing record concatenation for free. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1994. [ bib | .pdf ]
[903] Didier Rémy. A case study of typechecking with constrained types: Typing record concatenation. Workshop on Advances in Types for Computer Science, August 1995. [ bib | .dvi.gz ]
[904] Didier Rémy. From classes to objects via subtyping. In European Symposium on Programming (ESOP), volume 1381 of Lecture Notes in Computer Science, pages 200-220. Springer, March 1998. [ bib | .pdf ]
[905] Didier Rémy and Jérôme Vouillon. Objective ML: A simple object-oriented extension of ML. In Principles of Programming Languages (POPL), pages 40-53, January 1997. [ bib | .pdf ]
[906] Didier Rémy and Jérôme Vouillon. Objective ML: An effective object-oriented extension to ML. Theory and Practice of Object Systems, 4(1):27-50, 1998. [ bib | .pdf ]
[907] Didier Rémy and Boris Yakobowski. A Church-style intermediate language for MLF. Theoretical Computer Science, 435(1):77-105, June 2012. [ bib | .pdf ]
[908] Thomas Reps. Program analysis via graph reachability. Information and Software Technology, 40(11-12):701-726, 1998. [ bib | .pdf ]
[909] William S. Retert. Implementing permission analysis. PhD thesis, University of Wisconsin-Milwaukee, May 2009. [ bib ]
[910] Bernhard Reus and Jan Schwinghammer. Separation logic for higher-order store. In Computer Science Logic, volume 4207 of Lecture Notes in Computer Science, pages 575-590. Springer, September 2006. [ bib | .pdf ]
[911] Dominique Revuz. Minimization of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1):181-189, 1992. [ bib ]
[912] John C. Reynolds. Automatic computation of data set definitions. In Information Processing 68, volume 1, pages 456-461. North Holland, 1969. [ bib ]
[913] John C. Reynolds. Towards a theory of type structure. In Colloque sur la Programmation, volume 19 of Lecture Notes in Computer Science, pages 408-425. Springer, April 1974. [ bib | http ]
[914] John C. Reynolds. Syntactic control of interference. In Principles of Programming Languages (POPL), pages 39-46, January 1978. [ bib | http ]
[915] John C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing 83, pages 513-523. Elsevier Science, 1983. [ bib | .pdf ]
[916] John C. Reynolds. Three approaches to type structure. In Theory and Practice of Software Development (TAPSOFT), volume 185 of Lecture Notes in Computer Science, pages 97-138. Springer, March 1985. [ bib | http ]
[917] John C. Reynolds. An introduction to the polymorphic lambda calculus. In Gérard Huet, editor, Logical Foundations of Functional Programming, pages 77-86. Addison-Wesley, 1990. [ bib | .ps.gz ]
[918] John C. Reynolds. User defined types and procedural data structures as complementary approaches to data abstraction. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming: Types, Semantics and Language Design, pages 13-23. MIT Press, 1994. [ bib ]
[919] John C. Reynolds. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation, 11(4):363-397, December 1998. [ bib | .dvi.gz ]
[920] John C. Reynolds. Definitional interpreters revisited. Higher-Order and Symbolic Computation, 11(4):355-361, December 1998. [ bib | .dvi.gz ]
[921] John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science (LICS), pages 55-74, 2002. [ bib | .ps.gz ]
[922] Morten Rhiger. A foundation for embedded languages. ACM Transactions on Programming Languages and Systems, 25(3):291-315, May 2003. [ bib | http ]
[923] Colin Riba. On the values of reducibility candidates. In Typed Lambda Calculi and Applications (TLCA), volume 5608 of Lecture Notes in Computer Science, pages 264-278. Springer, July 2009. [ bib | .pdf ]
[924] Michael F. Ringenburg and Dan Grossman. Types for describing coordinated data structures. In Types in Language Design and Implementation (TLDI), pages 25-36, January 2005. [ bib | .pdf ]
[925] Mikael Rittri. Using types as search keys in function libraries. Journal of Functional Programming, 1(1):71-89, 1991. [ bib ]
[926] Mikael Rittri. Retrieving library functions by unifying types modulo linear isomorphism. RAIRO Theoretical Informatics and Applications, 27(6):523-540, 1993. [ bib | .ps.Z ]
[927] Xavier Rival. Abstract domains for the static analysis of programs manipulating complex data structures. Habilitation à diriger des recherches, École Normale Supérieure, 2011. [ bib | .pdf ]
[928] J. Alan Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965. [ bib | http ]
[929] John L. Ross and Mooly Sagiv. Building a bridge between pointer aliases and program dependences. Nordic Journal of Computing, 5(4):361-386, 1998. [ bib | .ps ]
[930] Andreas Rossberg, Peter J. Stuckey, Martin Sulzmann, and Jeremy Wazny. The Chameleon language. [ bib | http ]
[931] Colin Runciman and Ian Toyn. Retrieving re-usable software components by polymorphic type. Journal of Functional Programming, 1(2):191-211, 1991. [ bib ]
[932] Stuart Russell and Peter Norvig. Artificial intelligence: A modern approach. Prentice Hall, 2009. [ bib | http ]
[933] Claudio V. Russo. Types for modules. PhD thesis, University of Edinburgh, 1998. [ bib | .html ]
[934] Yann Régis-Gianas. Des types aux assertions logiques : preuve automatique ou assistée de propriétés sur les programmes fonctionnels. PhD thesis, Université Paris 7, November 2007. [ bib | .pdf ]
[935] Yann Régis-Gianas. The Pangolin programming language, 2008. http://code.google.com/p/pangolin-programming-language/. [ bib | http ]
[936] Yann Régis-Gianas and François Pottier. A Hoare logic for call-by-value functional programs. In Mathematics of Program Construction (MPC), volume 5133 of Lecture Notes in Computer Science, pages 305-335. Springer, July 2008. [ bib | .pdf ]
[937] Didier Rémy. Type checking records and variants in a natural extension of ML. In Principles of Programming Languages (POPL), pages 77-88, 1989. [ bib | http ]
[938] Didier Rémy. Efficient representation of extensible records. In ACM Workshop on ML and its Applications, June 1992. [ bib | .pdf ]
[939] Didier Rémy. Simple, partial type inference for system F based on type containment. In International Conference on Functional Programming (ICFP), September 2005. [ bib | .pdf ]
[940] Didier Rémy. Simple, partial type inference for system F based on type containment. In International Conference on Functional Programming (ICFP), September 2005. [ bib | .pdf ]
[941] Andrei Sabelfeld and David Sands. A PER model of secure information flow in sequential programs. In European Symposium on Programming (ESOP), volume 1575 of Lecture Notes in Computer Science, pages 40-58. Springer, 1999. [ bib | .ps ]
[942] Daniel Sabin and Eugene C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In International Workshop on Principles and Practice of Constraint Programming (PPCP), volume 874 of Lecture Notes in Computer Science, pages 10-20. Springer, May 1994. [ bib | .pdf ]
[943] Amr Sabry. What is a purely functional language? Journal of Functional Programming, 8(1):1-22, January 1998. [ bib | http ]
[944] Bratin Saha, Nevin Heintze, and Dino Oliva. Subtransitive CFA using types. Technical Report YALEU/DCS/TR-1166, Yale University, October 1998. [ bib | .ps.gz ]
[945] Davide Sangiorgi. On the bisimulation proof method. Mathematical Structures in Computer Science, 8(5):447-479, 1998. [ bib | .ps.gz ]
[946] Patrick M. Sansom. Time profiling a lazy functional compiler. In Functional Programming, Workshops in Computing. Springer, July 1993. [ bib | .ps.gz ]
[947] Karl Max Schimpf. Construction methods of LR parsers. PhD thesis, University of Pennsylvania, May 1981. [ bib | http ]
[948] Fred B. Schneider. On concurrent programming. Springer, 1997. [ bib ]
[949] Fred B. Schneider. Enforceable security policies. ACM Transactions on Information and System Security, 3(1):1-50, February 2000. [ bib | .pdf ]
[950] Lutz Schröder and Till Mossakowski. HasCASL: Towards integrated specification and development of functional programs. In International Conference on Algebraic Methodology and Software Technology (AMAST), volume 2422 of Lecture Notes in Computer Science, pages 99-116. Springer, September 2002. [ bib | .ps ]
[951] Lenhart K. Schubert, Mary Angela Papalaskaris, and Jay Taugher. Determining type, part, color, and time relationships. Computer, 16(10):53-60, October 1983. [ bib ]
[952] Michael I. Schwartzbach. Polymorphic type inference. Technical Report BRICS-LS-95-3, BRICS, June 1995. [ bib | .ps.gz ]
[953] Jan Schwinghammer, Lars Birkedal, François Pottier, Bernhard Reus, Kristian Støvring, and Hongseok Yang. A step-indexed Kripke model of hidden state. Mathematical Structures in Computer Science, January 2012. To appear. [ bib | .pdf ]
[954] Jan Schwinghammer, Lars Birkedal, Bernhard Reus, and Hongseok Yang. Nested Hoare triples and frame rules for higher-order store. In Computer Science Logic, volume 5771 of Lecture Notes in Computer Science, pages 440-454. Springer, September 2009. [ bib | .pdf ]
[955] Jan Schwinghammer, Lars Birkedal, and Kristian Støvring. A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces. In Foundations of Software Science and Computation Structures (FOSSACS), number 6604 in Lecture Notes in Computer Science, pages 305-319. Springer, March 2011. [ bib | .pdf ]
[956] Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, and Bernhard Reus. A semantic foundation for hidden state. In Foundations of Software Science and Computation Structures (FOSSACS), volume 6014 of Lecture Notes in Computer Science, pages 2-17. Springer, March 2010. [ bib | .pdf ]
[957] Carsten Schürmann, Adam Poswolsky, and Jeffrey Sarnat. The -calculus: Functional programming with higher-order encodings. Technical Report YALEU/DCS/TR-1272, Yale University, November 2004. [ bib | .pdf ]
[958] Carsten Schürmann, Adam Poswolsky, and Jeffrey Sarnat. The -calculus: Functional programming with higher-order encodings. In Typed Lambda Calculi and Applications (TLCA), volume 3461 of Lecture Notes in Computer Science, pages 339-353. Springer, April 2005. [ bib | .pdf ]
[959] Dana S. Scott. A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoretical Computer Science, 121(1-2):411-440, 1993. [ bib | http ]
[960] Robert Sedgewick and Michael Schidlowsky. Algorithms in Java: Graph algorithms. Addison-Wesley, 2003. [ bib ]
[961] R. C. Sekar, R. Ramesh, and I. V. Ramakrishnan. Adaptive pattern matching. SIAM Journal on Computing, 24(6):1207-1234, December 1995. [ bib | .ps ]
[962] Ravi Sethi and J. D. Ullman. The generation of optimal code for arithmetic expressions. Journal of the ACM, 17(4):715-728, 1970. [ bib | http ]
[963] Peter Sewell and Jan Vitek. Secure composition of untrusted code: Wrappers and causality types. Technical Report 478, Computer Laboratory, University of Cambridge, November 1999. [ bib | .ps ]
[964] Peter Sewell and Jan Vitek. Secure composition of untrusted code: Wrappers and causality types. In IEEE Computer Security Foundations Workshop, July 2000. [ bib | .ps ]
[965] Edwin Hsing-Mean Sha and Kenneth Steiglitz. Maintaining bipartite matchings in the presence of failures. Networks, 23(5):459-471, August 1993. [ bib | .ps ]
[966] Zhong Shao, Valery Trifonov, Bratin Saha, and Nikolaos Papaspyrou. A type system for certified binaries. ACM Transactions on Programming Languages and Systems, 27(1):1-45, 2005. [ bib | .pdf ]
[967] Tim Sheard. Using MetaML: A staged programming language. In Advanced Functional Programming, volume 1608 of Lecture Notes in Computer Science, pages 207-239. Springer, September 1998. [ bib | .ps ]
[968] Tim Sheard. Accomplishments and research challenges in meta-programming. In International Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG), volume 2196 of Lecture Notes in Computer Science, pages 2-44. Springer, 2001. [ bib | .pdf ]
[969] Tim Sheard. Languages of the future. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 116-119, October 2004. [ bib | http ]
[970] Tim Sheard. Ωmega, November 2005. [ bib | http ]
[971] Tim Sheard. Putting Curry-Howard to work. In Haskell workshop, pages 74-85, September 2005. [ bib | .ps ]
[972] Tim Sheard and Emir Pašalić. Meta-programming with built-in type equality. In Workshop on Logical Frameworks and Meta-Languages (LFM), July 2004. [ bib | .pdf ]
[973] Tim Sheard and Simon Peyton Jones. Template metaprogramming for Haskell. In Haskell workshop, pages 1-16, October 2002. [ bib | .pdf ]
[974] Mark B. Shields and Simon Peyton Jones. First class modules for Haskell. In Foundations of Object-Oriented Languages (FOOL), pages 28-40, January 2002. [ bib | .pdf ]
[975] Mark R. Shinwell. The fresh approach: functional programming with names and binders. PhD thesis, University of Cambridge, February 2005. [ bib | .pdf ]
[976] Mark R. Shinwell. Fresh O'Caml: nominal abstract syntax for the masses. In ACM Workshop on ML, September 2005. [ bib | .pdf ]
[977] Mark R. Shinwell and Andrew M. Pitts. Fresh Objective Caml user manual. Technical Report 621, University of Cambridge, February 2005. [ bib | .pdf ]
[978] Mark R. Shinwell and Andrew M. Pitts. On a monadic semantics for freshness. Theoretical Computer Science, 342:28-55, 2005. [ bib | .pdf ]
[979] Mark R. Shinwell, Andrew M. Pitts, and Murdoch J. Gabbay. FreshML: Programming with binders made simple. In International Conference on Functional Programming (ICFP), pages 263-274, August 2003. [ bib | .pdf ]
[980] Olin Shivers. A universal scripting framework or, Lambda: the ultimate “little language”. In Concurrency and Parallelism: Programming, Networking and Security, volume 1179 of Lecture Notes in Computer Science, pages 254-265. Springer, 1996. [ bib | .ps ]
[981] Vincent Simonet. Fine-grained information flow analysis for a λ-calculus with sum types. In IEEE Computer Security Foundations Workshop, pages 223-237, June 2002. [ bib | .ps.gz ]
[982] Vincent Simonet. An extension of HM(X) with bounded existential and universal data-types. In International Conference on Functional Programming (ICFP), June 2003. [ bib | .ps.gz ]
[983] Vincent Simonet. The Flow Caml system: documentation and user's manual. Technical Report 0282, INRIA, July 2003. [ bib | http ]
[984] Vincent Simonet. Type inference with structural subtyping: a faithful formalization of an efficient constraint solver. In Asian Symposium on Programming Languages and Systems (APLAS), volume 2895 of Lecture Notes in Computer Science. Springer, November 2003. [ bib | .pdf ]
[985] Vincent Simonet. Inférence de flots d'information pour ML: formalisation et implantation. PhD thesis, Université Paris 7, March 2004. [ bib | .pdf ]
[986] Vincent Simonet and François Pottier. Constraint-based type inference for guarded algebraic data types. Research Report 5462, INRIA, January 2005. [ bib | .html ]
[987] Christian Skalka. Types for programming language-based security. PhD thesis, The Johns Hopkins University, August 2002. [ bib | .ps ]
[988] Christian Skalka and François Pottier. Syntactic type soundness for HM(X). In Workshop on Types in Programming (TIP), volume 75 of Electronic Notes in Theoretical Computer Science, July 2002. [ bib | .ps.gz ]
[989] Christian Skalka and Scott Smith. Static enforcement of security with types. In International Conference on Functional Programming (ICFP), pages 34-45, September 2000. [ bib | .ps ]
[990] Jan Smans, Bart Jacobs, and Frank Piessens. Implicit dynamic frames: Combining dynamic frames and separation logic. In European Conference on Object-Oriented Programming (ECOOP), volume 5653 of Lecture Notes in Computer Science, pages 148-172. Springer, July 2009. [ bib | .pdf ]
[991] Sjaak Smetsers, Erik Barendsen, Marko C. J. D. van Eekelen, and Marinus J. Plasmeijer. Guaranteeing safe destructive updates through a type system with uniqueness information for graphs. In Dagstuhl Seminar on Graph Transformations in Computer Science, volume 776 of Lecture Notes in Computer Science, pages 358-379. Springer, 1994. [ bib | .pdf ]
[992] Frederick Smith, David Walker, and Greg Morrisett. Alias types. In European Symposium on Programming (ESOP), volume 1782 of Lecture Notes in Computer Science, pages 366-381. Springer, March 2000. [ bib | .pdf ]
[993] Geoffrey Smith and Dennis Volpano. Secure information flow in a multi-threaded imperative language. In Principles of Programming Languages (POPL), pages 355-364, January 1998. [ bib | .ps.Z ]
[994] Geoffrey S. Smith. Polymorphic type inference with overloading and subtyping. In Theory and Practice of Software Development (TAPSOFT), volume 668 of Lecture Notes in Computer Science, pages 671-685. Springer, April 1993. [ bib | http ]
[995] Geoffrey S. Smith. Principal type schemes for functional programs with overloading and subtyping. Science of Computer Programming, 23(2-3):197-226, December 1994. [ bib | .pdf ]
[996] Geoffrey S. Smith. A new type system for secure information flow. In IEEE Computer Security Foundations Workshop, pages 115-125, June 2001. [ bib | .pdf ]
[997] Scott Smith and Tiejun Wang. Polyvariant flow analysis with constrained types. In European Symposium on Programming (ESOP), volume 1782 of Lecture Notes in Computer Science, pages 382-396. Springer, March 2000. [ bib | .pdf ]
[998] Scott Fraser Smith. Partial objects in type theory. PhD thesis, Cornell University, January 1989. [ bib | .pdf ]
[999] Gert Smolka and Ralf Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229-258, April 1994. [ bib | .ps ]
[1000] Michael B. Smyth and Gordon D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM Journal on Computing, 11(4):761-783, 1982. [ bib | .pdf ]
[1001] Alan Snyder. Encapsulation and inheritance in object-oriented programming languages. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 38-45, 1986. [ bib | http ]
[1002] Jonathan Sobel and Daniel P. Friedman. Recycling continuations. In International Conference on Functional Programming (ICFP), pages 251-260, September 1998. [ bib | .ps ]
[1003] Marvin H. Solomon. Type definitions with parameters. In Principles of Programming Languages (POPL), pages 31-38, January 1978. [ bib | http ]
[1004] Sergei V. Soloviev. The category of finite sets and cartesian closed categories. Journal of Soviet Mathematics, 22(3):1387-1400, 1983. [ bib ]
[1005] Matthieu Sozeau. Subset coercions in Coq. In Types for Proofs and Programs, volume 4502, pages 237-252, 2006. [ bib | .pdf ]
[1006] Matthieu Sozeau. Program-ing finger trees in Coq. In International Conference on Functional Programming (ICFP), pages 13-24, September 2007. [ bib | .pdf ]
[1007] Mike Spivey. A functional theory of exceptions. Science of Computer Programming, 14:25-42, 1990. [ bib ]
[1008] R. Stata and M. Abadi. A type system for Java bytecode subroutines. In Principles of Programming Languages (POPL), pages 149-160, January 1998. [ bib | .html ]
[1009] Paul A. Steckler and Mitchell Wand. Lightweight closure conversion. ACM Transactions on Programming Languages and Systems, 19(1):48-86, 1997. [ bib | .ps ]
[1010] Bjarne Steensgaard. Points-to analysis in almost linear time. In Principles of Programming Languages (POPL), pages 32-41, January 1996. [ bib | .ps ]
[1011] Bernhard Steffen, Andreas Claßen, Marion Klein, Jens Knoop, and Tiziana Margaria. The fixpoint-analysis machine. In International Conference on Concurrency Theory (CONCUR), volume 962 of Lecture Notes in Computer Science, pages 72-87. Springer, August 1995. [ bib | http ]
[1012] Mark-Oliver Stehr. CINNI - A generic calculus of explicit substitutions and its application to λ-, σ- and π-calculi. In International Workshop on Rewriting Logic and its Applications (WRLA), volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier Science, September 2000. [ bib | .ps ]
[1013] Gordon Stewart, Lennart Beringer, and Andrew W. Appel. Verified heap theorem prover by paramodulation. In International Conference on Functional Programming (ICFP), pages 3-14, September 2012. [ bib | .pdf ]
[1014] Allen Stoughton. Access flow: A protection model which integrates access control and information flow. In IEEE Symposium on Security and Privacy (S&P), pages 9-18, 1981. [ bib ]
[1015] Christopher Strachey. Fundamental concepts in programming languages. Higher-Order and Symbolic Computation, 13(1-2):11-49, April 2000. [ bib | http ]
[1016] Robert E. Strom and Shaula Yemini. Typestate: A programming language concept for enhancing software reliability. IEEE Transactions on Software Engineering, 12(1):157-171, 1986. [ bib | .pdf ]
[1017] Peter J. Stuckey and Martin Sulzmann. A theory of overloading. In International Conference on Functional Programming (ICFP), pages 167-178, 2002. [ bib | http ]
[1018] Peter J. Stuckey, Martin Sulzmann, and Jeremy Wazny. Interactive type debugging in Haskell. In Haskell workshop, pages 72-83, 2003. [ bib | .pdf ]
[1019] Zhendong Su and Alexander Aiken. Entailment with conditional equality constraints. In European Symposium on Programming (ESOP), volume 2028 of Lecture Notes in Computer Science, pages 170-189, April 2001. [ bib | .pdf ]
[1020] Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, and Ralf Treinen. The first-order theory of subtyping constraints. In Principles of Programming Languages (POPL), pages 203-216, January 2002. [ bib | .pdf ]
[1021] Martin Sulzmann. Designing record systems. Research Report YALEU/DCS/RR-1128, Yale University, April 1997. [ bib | .ps.gz ]
[1022] Martin Sulzmann. A general framework for Hindley/Milner type systems with constraints. PhD thesis, Yale University, Department of Computer Science, May 2000. [ bib | http ]
[1023] Martin Sulzmann. A general type inference framework for Hindley/Milner style systems. In International Symposium on Functional and Logic Programming, volume 2024 of Lecture Notes in Computer Science, pages 246-263. Springer, March 2001. [ bib | .pdf ]
[1024] Martin Sulzmann, Martin Müller, and Christoph Zenger. Hindley/Milner style type systems in constraint form. Research Report ACRC-99-009, University of South Australia, School of Computer and Information Science, July 1999. [ bib | .ps.gz ]
[1025] Martin Sulzmann, Martin Odersky, and Martin Wehr. Type inference with constrained types. In Foundations of Object-Oriented Languages (FOOL), January 1997. [ bib | .ps.gz ]
[1026] Martin Sulzmann and Meng Wang. A systematic translation of guarded recursive data types to existential types. Technical Report TR22/04, National University of Singapore, 2004. [ bib | .ps.gz ]
[1027] Eijiro Sumii. A complete characterization of observational equivalence in polymorphic lambda-calculus with general references. In Computer Science Logic, volume 5771 of Lecture Notes in Computer Science, pages 455-469. Springer, September 2009. [ bib | .pdf ]
[1028] Eijiro Sumii and Naoki Kobayashi. A generalized deadlock-free process calculus. In High-Level Concurrent Languages (HLCL), volume 16 of Electronic Notes in Theoretical Computer Science, pages 55-77. Elsevier Science, September 1998. [ bib | .ps ]
[1029] Kasper Svendsen and Lars Birkedal. Impredicative concurrent abstract predicates. In European Symposium on Programming (ESOP), volume 8410 of Lecture Notes in Computer Science, pages 149-168. Springer, April 2014. [ bib | .pdf ]
[1030] Kasper Svendsen, Lars Birkedal, and Matthew J. Parkinson. Joins: A case study in modular specification of a concurrent reentrant higher-order library. In European Conference on Object-Oriented Programming (ECOOP), volume 7920 of Lecture Notes in Computer Science, pages 327-351. Springer, July 2013. [ bib | .pdf ]
[1031] Kasper Svendsen, Lars Birkedal, and Matthew J. Parkinson. Modular reasoning about separation of concurrent data structures. In European Symposium on Programming (ESOP), volume 7792 of Lecture Notes in Computer Science, pages 169-188. Springer, March 2013. [ bib | .pdf ]
[1032] Nikhil Swamy, Juan Chen, Cédric Fournet, Pierre-Yves Strub, Karthik Bhargavan, and Jean Yang. Secure distributed programming with value-dependent types. In International Conference on Functional Programming (ICFP), pages 266-278, September 2011. [ bib | .pdf ]
[1033] Nikhil Swamy, Michael Hicks, Greg Morrisett, Dan Grossman, and Trevor Jim. Safe manual memory management in Cyclone. Science of Computer Programming, 62(2):122-144, October 2006. [ bib | .pdf ]
[1034] S. Doaitse Swierstra and Luc Duponcheel. Deterministic, error-correcting combinator parsers. In Advanced Functional Programming, volume 1129 of Lecture Notes in Computer Science, pages 184-207. Springer, August 1996. [ bib | .pdf ]
[1035] Walid Taha. Multi-stage programming: Its theory and applications. PhD thesis, Oregon Graduate Institute, November 1999. [ bib | .pdf ]
[1036] Walid Taha. A gentle introduction to multi-stage programming. In Domain-Specific Program Generation (DSPG), volume 3016 of Lecture Notes in Computer Science, pages 30-50. Springer, November 2004. [ bib | .pdf ]
[1037] Walid Taha and Michael Florentin Nielsen. Environment classifiers. In Principles of Programming Languages (POPL), pages 26-37, January 2003. [ bib | .pdf ]
[1038] Masako Takahashi. Parallel reductions in λ-calculus. Information and Computation, 118(1):120-127, April 1995. [ bib | http ]
[1039] Carolyn Talcott. A theory of binding structures and applications to rewriting. Theoretical Computer Science, 112(1):99-143, 1993. [ bib | .ps.Z ]
[1040] Jean-Pierre Talpin and Pierre Jouvelot. The type and effect discipline. Information and Computation, 11(2):245-296, 1994. [ bib | .pdf ]
[1041] Gang Tan, Zhong Shao, Xinyu Feng, and Hongxu Cai. Weak updates and separation logic. In Asian Symposium on Programming Languages and Systems (APLAS), volume 5904 of Lecture Notes in Computer Science, pages 178-193. Springer, December 2009. [ bib | .pdf ]
[1042] David R. Tarditi and Andrew W. Appel. ML-Yacc user's manual, April 2000. [ bib | http ]
[1043] Robert Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, June 1972. [ bib | http ]
[1044] Robert E. Tarjan and Mihalis Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13(3):566-579, August 1984. [ bib | http ]
[1045] Robert Endre Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215-225, April 1975. [ bib | .pdf ]
[1046] Robert Endre Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690-715, October 1979. [ bib | http ]
[1047] Robert Endre Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6(2):306-318, 1985. [ bib | http ]
[1048] Robert Endre Tarjan and Andrew Chi-Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606-611, 1979. [ bib | http ]
[1049] The GHC team. The Glasgow Haskell compiler, March 2005. [ bib | http ]
[1050] Robert D. Tennent and Dan Ghica. Abstract models of storage. Higher-Order and Symbolic Computation, 13:119-129, 2000. [ bib | http ]
[1051] Satish R. Thatté. Automated synthesis of interface adapters for reusable classes. In Principles of Programming Languages (POPL), pages 174-187, January 1994. [ bib | http ]
[1052] The Coq development team. The Coq proof assistant, 2006. [ bib | http ]
[1053] The Mozilla foundation. The Rust programming language, 2014. [ bib | http ]
[1054] Hayo Thielecke. Comparing control constructs by double-barrelled CPS. Higher-Order and Symbolic Computation, 15(2-3):141-160, 2002. [ bib | .pdf ]
[1055] Hayo Thielecke. From control effects to typed continuation passing. In Principles of Programming Languages (POPL), pages 139-149, January 2003. [ bib | .pdf ]
[1056] Hayo Thielecke. Frame rules from answer types for code pointers. In Principles of Programming Languages (POPL), pages 309-319, January 2006. [ bib | .pdf ]
[1057] Peter Thiemann. ML-style typing, lambda lifting, and partial evaluation. In Latin American Conference on Functional Programming, March 1999. [ bib | .ps.gz ]
[1058] Peter Thiemann. Enforcing security properties using type specialization. In European Symposium on Programming (ESOP), Lecture Notes in Computer Science. Springer, April 2001. [ bib | .ps.gz ]
[1059] Jerzy Tiuryn. Subtype inequalities. In Logic in Computer Science (LICS), pages 308-317, June 1992. [ bib ]
[1060] Jerzy Tiuryn and Pawel Urzyczyn. The subtyping problem for second-order types is undecidable. Information and Computation, 179(1):1-18, 2002. [ bib | http ]
[1061] Jerzy Tiuryn and Mitchell Wand. Type reconstruction with recursive types and atomic subtyping. In Theory and Practice of Software Development (TAPSOFT), volume 668 of Lecture Notes in Computer Science, pages 686-701. Springer, April 1993. [ bib | .dvi ]
[1062] Mads Tofte. Operational semantics and polymorphic type inference. PhD thesis, University of Edinburgh, 1988. [ bib | .ps ]
[1063] Mads Tofte, Lars Birkedal, Martin Elsman, and Niels Hallenberg. A retrospective on region-based memory management. Higher-Order and Symbolic Computation, 17(3):245-265, September 2004. [ bib | .ps.gz ]
[1064] Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value λ-calculus using a stack of regions. In Principles of Programming Languages (POPL), pages 188-201, January 1994. [ bib | .pdf ]
[1065] Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Information and Computation, 132(2):109-176, 1997. [ bib | .pdf ]
[1066] Andrew Tolmach. Combining closure conversion with closure analysis using algebraic types. In Types in Compilation (TIC), June 1997. [ bib | .ps ]
[1067] Andrew Tolmach and Dino P. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming, 8(4):367-412, July 1998. [ bib | http ]
[1068] Jesse A. Tov and Riccardo Pucella. Stateful contracts for affine types. In European Symposium on Programming (ESOP), volume 6012 of Lecture Notes in Computer Science, pages 550-569. Springer, March 2010. [ bib | .pdf ]
[1069] Jesse A. Tov and Riccardo Pucella. Practical affine types. In Principles of Programming Languages (POPL), pages 447-458, January 2011. [ bib | http ]
[1070] Valery Trifonov and Scott Smith. Subtyping constrained types. In Static Analysis Symposium (SAS), volume 1145 of Lecture Notes in Computer Science, pages 349-365. Springer, September 1996. [ bib | .pdf ]
[1071] Matthew S. Tschantz and Michael D. Ernst. Javari: adding reference immutability to Java. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 211-230, October 2005. [ bib | .pdf ]
[1072] Stephen Tse and Steve Zdancewic. Run-time principals in information-flow type systems. In IEEE Symposium on Security and Privacy (S&P), May 2004. [ bib | .pdf ]
[1073] Hideki Tsuiki. On typed calculi with a merge operator. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 880 of Lecture Notes in Computer Science, pages 101-112. Springer, 1994. [ bib | .ps.gz ]
[1074] Thomas Tuerk. Local reasoning about while-loops. Unpublished, August 2010. [ bib | .pdf ]
[1075] David N. Turner. The polymorphic pi-calculus: Theory and implementation. PhD thesis, University of Edinburgh, 1995. [ bib | http ]
[1076] David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. In Functional Programming Languages and Computer Architecture (FPCA), pages 1-11. ACM Press, June 1995. [ bib | .dvi ]
[1077] Aaron Turon, Derek Dreyer, and Lars Birkedal. Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency. In International Conference on Functional Programming (ICFP), pages 377-390, September 2013. [ bib | .pdf ]
[1078] Christian Urban. Nominal techniques in Isabelle/HOL. Journal of Automated Reasoning, 40(4):327-356, 2008. [ bib | .ps ]
[1079] Christian Urban and Tobias Nipkow. Nominal verification of algorithm W. Unpublished, March 2008. [ bib | .pdf ]
[1080] Christian Urban, Andrew Pitts, and Murdoch Gabbay. Nominal unification. Theoretical Computer Science, 323:473-497, 2004. [ bib | .ps ]
[1081] Christian Urban and Christine Tasson. Nominal techniques in Isabelle/HOL. In International Conference on Automated Deduction (CADE), volume 3632 of Lecture Notes in Computer Science, pages 38-53. Springer, July 2005. [ bib | .ps ]
[1082] Viktor Vafeiadis. Concurrent separation logic and operational semantics. Electronic Notes in Theoretical Computer Science, 276:335-351, 2011. [ bib | .pdf ]
[1083] Eelis van der Weegen and James McKinna. A machine-checked proof of the average-case complexity of Quicksort in Coq. In Types for Proofs and Programs, volume 5497 of Lecture Notes in Computer Science, pages 256-271. Springer, March 2008. [ bib | http ]
[1084] Vincent van Oostrom. Confluence by decreasing diagrams. Theoretical Computer Science, 126(2):259-280, April 1994. [ bib | .ps.Z ]
[1085] Eric van Wyk, Oege de Moor, and Simon Peyton Jones. Aspect-oriented compilers. In Generative and Component-Based Software Engineering, volume 1799 of Lecture Notes in Computer Science, pages 121-133. Springer, September 1999. [ bib | .ps.gz ]
[1086] Mandana Vaziri and Daniel Jackson. Checking heap-manipulating procedures with a constraint solver. In Tools and Algorithms for Construction and Analysis of Systems (TACAS), volume 2619 of Lecture Notes in Computer Science. Springer, April 2003. [ bib | .pdf ]
[1087] Bart Vergauwen and Johan Lewi. Efficient local correctness checking for single and alternating Boolean equation systems. In International Colloquium on Automata, Languages and Programming, volume 820 of Lecture Notes in Computer Science, pages 304-315. Springer, 1994. [ bib | http ]
[1088] Bart Vergauwen, Johan Lewi, I. Avau, and A. Poté. Efficient computation of nested fix-points, with applications to model checking. In International Conference on Temporal Logic (ICTL), volume 827 of Lecture Notes in Computer Science, pages 165-179. Springer, July 1994. [ bib | http ]
[1089] Bart Vergauwen, J. Wauman, and Johan Lewi. Efficient fixpoint computation. In Static Analysis Symposium (SAS), volume 864 of Lecture Notes in Computer Science, pages 314-328. Springer, 1994. [ bib | http ]
[1090] Jules Villard, Étienne Lozes, and Cristiano Calcagno. Proving copyless message passing. In Asian Symposium on Programming Languages and Systems (APLAS), volume 5904 of Lecture Notes in Computer Science, pages 194-209. Springer, December 2009. [ bib | .pdf ]
[1091] Jules Villard, Étienne Lozes, and Cristiano Calcagno. Tracking heaps that hop with Heap-Hop. In Tools and Algorithms for Construction and Analysis of Systems (TACAS), volume 6015 of Lecture Notes in Computer Science, pages 275-279. Springer, March 2010. [ bib | .pdf ]
[1092] Dennis Volpano. Provably-secure programming languages for remote evaluation. ACM SIGPLAN Notices, 32(1):117-119, January 1997. [ bib ]
[1093] Dennis Volpano and Geoffrey Smith. Eliminating covert flows with minimum typings. In IEEE Computer Security Foundations Workshop, pages 156-168, June 1997. [ bib | .ps.Z ]
[1094] Dennis Volpano and Geoffrey Smith. A type-based approach to program security. Lecture Notes in Computer Science, 1214:607-621, April 1997. [ bib | .ps.Z ]
[1095] Dennis Volpano, Geoffrey Smith, and Cynthia Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, 1996. [ bib | .ps.Z ]
[1096] Sergei G. Vorobyov. An improved lower bound for the elementary theories of trees. In International Conference on Automated Deduction (CADE), volume 1104 of Lecture Notes in Computer Science, pages 275-287. Springer, 1996. [ bib | .ps.Z ]
[1097] Jérôme Vouillon and Paul-André Melliès. Semantic types: a fresh look at the ideal model for types. In Principles of Programming Languages (POPL), pages 52-63, January 2004. [ bib | .ps.gz ]
[1098] Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers, and Martin Sulzmann. OutsideIn(X): Modular type inference with local assumptions. Journal of Functional Programming, 21(4-5):333-412, 2011. [ bib | .pdf ]
[1099] Dimitrios Vytiniotis and Stephanie Weirich. Dependent types: Easy as PIE. In Trends in Functional Programming (TFP), April 2007. [ bib | .pdf ]
[1100] Dimitrios Vytiniotis, Stephanie Weirich, and Simon Peyton Jones. Boxy types: type inference for higher-rank types and impredicativity. Manuscript, April 2005. [ bib | http ]
[1101] Philip Wadler. Theorems for free! In Functional Programming Languages and Computer Architecture (FPCA), pages 347-359, September 1989. [ bib | .ps.gz ]
[1102] Philip Wadler. Linear types can change the world! In M. Broy and C. Jones, editors, Programming Concepts and Methods. North Holland, April 1990. [ bib | .ps ]
[1103] Philip Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2:461-493, 1992. [ bib | .ps.gz ]
[1104] Philip Wadler. The essence of functional programming. In Principles of Programming Languages (POPL), pages 1-14, 1992. Invited talk. [ bib | .ps ]
[1105] Philip Wadler. The Girard-Reynolds isomorphism (second edition). Theoretical Computer Science, 375(1-3):201-226, May 2007. [ bib | .pdf ]
[1106] Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad-hoc. In Principles of Programming Languages (POPL), pages 60-76, January 1989. [ bib | .ps.gz ]
[1107] Philip Wadler and Peter Thiemann. The marriage of effects and monads. ACM Transactions on Computational Logic, 4(1):1-32, January 2003. [ bib | .ps.gz ]
[1108] Philip L. Wadler. How to replace failure by a list of successes. In Functional Programming Languages and Computer Architecture (FPCA), volume 201 of Lecture Notes in Computer Science, pages 113-128. Springer, September 1985. [ bib | http ]
[1109] David Walker. A type system for expressive security policies. In Principles of Programming Languages (POPL), pages 254-267, January 2000. [ bib | http ]
[1110] David Walker. Substructural type systems. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 1, pages 3-43. MIT Press, 2005. [ bib ]
[1111] David Walker, Karl Crary, and Greg Morrisett. Typed memory management via static capabilities. ACM Transactions on Programming Languages and Systems, 22(4):701-771, 2000. [ bib | .pdf ]
[1112] David Walker and Greg Morrisett. Alias types for recursive data structures. In Types in Compilation (TIC), volume 2071 of Lecture Notes in Computer Science, pages 177-206. Springer, September 2000. [ bib | .pdf ]
[1113] Dan S. Wallach. A new approach to mobile code security. PhD thesis, Princeton University, January 1999. [ bib | .html ]
[1114] Dan S. Wallach, Andrew W. Appel, and Edward W. Felten. Safkasi: A security mechanism for language-based systems. ACM Transactions on Software Engineering and Methodology, 9(4):341-378, October 2000. [ bib | .ps ]
[1115] Dan S. Wallach and Edward Felten. Understanding Java stack inspection. In IEEE Symposium on Security and Privacy (S&P), May 1998. [ bib | http ]
[1116] Mitchell Wand. Continuation-based program transformation strategies. Journal of the ACM, 27(1):164-180, 1980. [ bib | http ]
[1117] Mitchell Wand. Embedding type structure in semantics. In Principles of Programming Languages (POPL), pages 1-6, January 1985. [ bib | http ]
[1118] Mitchell Wand. Finding the source of type errors. In Principles of Programming Languages (POPL), pages 38-43, January 1986. [ bib | http ]
[1119] Mitchell Wand. A simple algorithm and proof for type inference. Fundamenta Informaticæ, 10:115-122, 1987. [ bib | .pdf ]
[1120] Mitchell Wand. Type inference for record concatenation and multiple inheritance. Information and Computation, 93(1):1-15, July 1991. [ bib | .dvi ]
[1121] Mitchell Wand. Type inference for objects with instance variables and inheritance. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming: Types, Semantics and Language Design, pages 97-120. MIT Press, 1994. [ bib | .dvi ]
[1122] Mitchell Wand and Paul A. Steckler. Selective and lightweight closure conversion. In Principles of Programming Languages (POPL), pages 435-445, January 1994. [ bib | http ]
[1123] Martin Ward. Derivation of data intensive algorithms by formal transformation - the Schorr-Waite graph marking algorithm. IEEE Transactions on Software Engineering, 22(9):665-686, September 1996. [ bib | .pdf ]
[1124] D. H. D. Warren. Higher-order extensions to PROLOG: are they needed? In J. E. Hayes, D. Michie, and Y-H. Pao, editors, Machine Intelligence 10, pages 441-454. Ellis Horwood, 1982. [ bib ]
[1125] Alessandro Warth, James R. Douglass, and Todd D. Millstein. Packrat parsers can support left recursion. In ACM Workshop on Evaluation and Semantics-Based Program Manipulation (PEPM), pages 103-110, January 2008. [ bib | .pdf ]
[1126] Stephanie Weirich. Type-safe cast: Functional pearl. In International Conference on Functional Programming (ICFP), pages 58-67, September 2000. [ bib | .pdf ]
[1127] Stephanie Weirich. A typechecker that produces a typed term from an untyped source. Part of the Glasgow Haskell compiler's test suite, September 2004. [ bib | http ]
[1128] Stephanie Weirich. Type-safe run-time polytypic programming. Journal of Functional Programming, 16(10):681-710, November 2006. [ bib | .pdf ]
[1129] J. B. Wells. The undecidability of Mitchell's subtyping relation. Technical Report 95-019, Computer Science Department, Boston University, December 1995. [ bib | .ps.gz ]
[1130] J. B. Wells. Typability and type checking in system F are equivalent and undecidable. Annals of Pure and Applied Logic, 98(1-3):111-156, 1999. [ bib | .ps.gz ]
[1131] J. B. Wells. The essence of principal typings. In International Colloquium on Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 913-925. Springer, 2002. [ bib | .pdf ]
[1132] Benjamin Werner. Une théorie des constructions inductives. PhD thesis, Université Paris 7, 1994. [ bib ]
[1133] Edwin Westbrook, Aaron Stump, and Ian Wehrman. A language-based approach to functionally correct imperative programming. In International Conference on Functional Programming (ICFP), pages 268-279, 2005. [ bib | .pdf ]
[1134] Edwin M. Westbrook. Higher-order encodings with constructors. PhD thesis, Washington University, December 2008. [ bib | .pdf ]
[1135] J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347-348, June 1964. [ bib | http ]
[1136] Jeannette M. Wing, Eugene Rollins, and Amy Moormann Zaremski. Thoughts on a Larch/ML and a new application for LP. In First International Workshop on Larch, pages 297-312, July 1992. [ bib | .ps ]
[1137] Ryan Wisnesky, Gregory Malecha, and Greg Morrisett. Certified web services in Ynot. In Workshop on Automated Specification and Verification of Web Systems, July 2009. [ bib | .pdf ]
[1138] Roger Wolff, Ronald Garcia, Éric Tanter, and Jonathan Aldrich. Gradual typestate. In European Conference on Object-Oriented Programming (ECOOP), volume 6813 of Lecture Notes in Computer Science, pages 459-483. Springer, July 2011. [ bib | .pdf ]
[1139] J. P. L. Woodward. Applications for multilevel secure operating systems. In Proceedings NCC, volume 48, pages 319-328. AFIPS Press, June 1979. [ bib ]
[1140] Andrew K. Wright. Polymorphism for imperative languages without imperative types. Technical Report 93-200, Rice University, February 1993. [ bib ]
[1141] Andrew K. Wright. Simple imperative polymorphism. Lisp and Symbolic Computation, 8(4):343-356, December 1995. [ bib | .ps.gz ]
[1142] Andrew K. Wright and Robert Cartwright. A practical soft type system for Scheme. ACM Transactions on Programming Languages and Systems, 19(1):87-152, January 1997. [ bib | http ]
[1143] Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, November 1994. [ bib | .ps.gz ]
[1144] Hongwei Xi. Dependent types in practical programming. PhD thesis, Carnegie Mellon University, December 1998. [ bib | .ps ]
[1145] Hongwei Xi. Dead code elimination through dependent types. In Practical Aspects of Declarative Languages (PADL), volume 1551 of Lecture Notes in Computer Science, pages 228-242. Springer, January 1999. [ bib | .ps ]
[1146] Hongwei Xi. Dependent ML, 2001. [ bib | .html ]
[1147] Hongwei Xi. Dependently Typed Pattern Matching. Journal of Universal Computer Science, 9(8):851-872, 2003. [ bib | .pdf ]
[1148] Hongwei Xi. Applied type system. In TYPES 2003, volume 3085 of Lecture Notes in Computer Science, pages 394-408. Springer, February 2004. [ bib | .pdf ]
[1149] Hongwei Xi. Dependent ML: an approach to practical programming with dependent types. Journal of Functional Programming, 17(2):215-286, 2007. [ bib | .pdf ]
[1150] Hongwei Xi, Chiyan Chen, and Gang Chen. Guarded recursive datatype constructors. In Principles of Programming Languages (POPL), pages 224-235, January 2003. [ bib | .ps ]
[1151] Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In Principles of Programming Languages (POPL), pages 214-227, January 1999. [ bib | .ps ]
[1152] Hongwei Xi and Carsten Schürmann. CPS transform for Dependent ML. In Workshop on Logic, Language, Information and Computation (WoLLIC), August 2001. [ bib | .pdf ]
[1153] Yichen Xie and Alex Aiken. Scalable error detection using Boolean satisfiability. In Principles of Programming Languages (POPL), pages 351-363, January 2005. [ bib | .pdf ]
[1154] Dana N. Xu. Extended static checking for Haskell. In Haskell workshop, pages 48-59. ACM Press, 2006. [ bib | .ps ]
[1155] Dana N. Xu, Simon Peyton Jones, and Koen Claessen. Static contract checking for Haskell. In Principles of Programming Languages (POPL), pages 41-52, January 2009. [ bib | .ps ]
[1156] Hongseok Yang, Oukseh Lee, Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, and Peter W. O'Hearn. Scalable shape analysis for systems code. In Computer Aided Verification, volume 5123 of Lecture Notes in Computer Science, pages 385-398. Springer, July 2008. [ bib | .pdf ]
[1157] Kwangkeun Yi. Educational pearl: 'proof-directed debugging' revisited for a first-order version. Journal of Functional Programming, 16(6):663-670, 2006. [ bib | .pdf ]
[1158] Nobuko Yoshida. Graph types for monadic mobile processes. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 1180 of Lecture Notes in Computer Science, pages 371-386. Springer, 1996. [ bib | .ps.gz ]
[1159] Nobuko Yoshida. Graph types for monadic mobile processes. Technical Report ECS-LFCS-96-350, University of Edinburgh, 1996. [ bib | http ]
[1160] Nobuko Yoshida, Kohei Honda, and Martin Berger. Linearity and bisimulation. Technical Report MSC-2001/48, University of Leicester, December 2001. [ bib | .ps.gz ]
[1161] Nobuko Yoshida, Kohei Honda, and Martin Berger. Linearity and bisimulation. In Foundations of Software Science and Computation Structures (FOSSACS), Lecture Notes in Computer Science. Springer, April 2002. [ bib | .ps.gz ]
[1162] Nobuko Yoshida, Kohei Honda, and Martin Berger. Logical reasoning for higher-order functions with local state. In Foundations of Software Science and Computation Structures (FOSSACS), volume 4423 of Lecture Notes in Computer Science, pages 361-377. Springer, April 2007. [ bib | .pdf ]
[1163] Steve Zdancewic and Andrew C. Myers. Secure information flow and CPS. In European Symposium on Programming (ESOP), Lecture Notes in Computer Science. Springer, April 2001. [ bib | .ps ]
[1164] Steve Zdancewic and Andrew C. Myers. Secure information flow via linear continuations. Higher Order and Symbolic Computation, 15(2-3):209-234, September 2002. [ bib | .pdf ]
[1165] Olivier Zendra, Dominique Colnet, and Suzanne Collin. Efficient dynamic dispatch without virtual function tables. the SmallEiffel compiler. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 125-141, October 1997. [ bib | .ps.gz ]
[1166] Christoph Zenger. Indexed types. Theoretical Computer Science, 187(1-2):147-165, 1997. [ bib | http ]
[1167] Christoph Zenger. Indizierte typen. PhD thesis, Universität Karlsruhe, July 1998. [ bib | .ps.gz ]
[1168] Lantian Zheng and Andrew C. Myers. Dynamic security labels and noninterference. Technical Report 2004-1924, Cornell University, January 2004. [ bib | .pdf ]
[1169] Dengping Zhu and Hongwei Xi. A typeful and tagless representation for XML documents. In Asian Symposium on Programming Languages and Systems (APLAS), volume 2895 of Lecture Notes in Computer Science, pages 89-104. Springer, November 2003. [ bib | .pdf ]
[1170] Dengping Zhu and Hongwei Xi. Safe programming with pointers through stateful views. In Practical Aspects of Declarative Languages (PADL), volume 3350 of Lecture Notes in Computer Science, pages 83-97. Springer, January 2005. [ bib | .pdf ]
[1171] Yoav Zibin and Yossi Gil. Theory and practice of incremental subtyping tests and message dispatching, December 2001. [ bib | .ps.gz ]
[1172] Yoav Zibin and Yossi Gil. Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 142-160, November 2002. [ bib | .pdf ]
[1173] Yoav Zibin and Yossi Gil. Incremental algorithms for dispatching in dynamically typed languages. In Principles of Programming Languages (POPL), January 2003. [ bib | .pdf ]
[1174] Jan Zwanenburg. A type system for record concatenation and subtyping. Technical report, Eindhoven University of Technology, July 1997. [ bib | .ps ]

This file was generated by bibtex2html 1.96.