Static contract checking for haskell

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2009, Pages 41-52

  Xu, Dana N ^a   Jones, Simon Peyton ^b   Claessen, Koen ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MICROSOFT RESEARCH   (United States)

^c CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Contract satisfaction; Static contract checking

Indexed keywords

COMPILE TIME; CONTRACT CHECKING; HASKELL; HIGHER ORDER; HIGHER-ORDER FUNCTIONS; LAZY FUNCTIONAL LANGUAGES; OBJECT-ORIENTED LANGUAGES; PROGRAM ERRORS; RUN-TIME CHECKS; STATIC CONTRACT CHECKING; STATIC VERIFICATION; SYMBOLIC EXECUTION;

COMPUTER SYSTEM FIREWALLS; LINGUISTICS; OBJECT ORIENTED PROGRAMMING; PROGRAM DEBUGGING; QUERY LANGUAGES; UNMANNED AERIAL VEHICLES (UAV);

JAVA PROGRAMMING LANGUAGE;

EID: 67649846627     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480889     Document Type: Conference Paper

References (39)

1. Lennart Augustsson. Cayenne - language with dependent types. In Proceedings of the third ACM SIGPLAN international conference on Functional programming, pages 239- 250, New York, NY, USA, 1998. ACM. (Pubitemid 129686032)
2. Mike Barnett, K. Rustan M. Leino, andWolfram Schulte. The Spec# programming system: An overview. CASSIS, LNCS 3362, 2004. (Pubitemid 41228860)
3. Matthias Blume and David McAllester. Sound and complete models of contracts. J. Funct. Program., 16(4-5):375-414, 2006. (Pubitemid 44229842)
4. L. Burdy, Y. Cheon, D. Cok, M. Ernst, J. Kiniry, G. Leavens, K. Leino, and E. Poll. An overview of JML tools and applications, 2003.
5. Koen Claessen and John Hughes. Specification-based testing with QuickCheck. In Fun of Programming, Cornerstones of Computing, pages 17-40. Palgrave, March 2003.
6. Sa Cui, Kevin Donnelly, and Hongwei Xi. ATS: A language that combines programming with theorem proving. In Bernhard Gramlich, editor, FroCos, volume 3717 of Lecture Notes in Computer Science, pages 310-320. Springer, 2005.
7. Rowan Davies. Refinement-type checker for standard ML. In AMAST '97: Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology, pages 565-566, London, UK, 1997. Springer-Verlag. (Pubitemid 128006405)
8. Peter Dybjer, Qiao Haiyan, and Makoto Takeyama. Verifying Haskell programs by combining testing and proving. In Proceedings of Third International Conference on Quality Software, pages 272-279. IEEE Press, 2003.
9. R. B. Findler, M. Blume, and M. Felleisen. An investigation of contracts as projections. Technical report, University of Chicago Computer Science Department, 2006. Technical Report TR-2004-2102
10. Robert Bruce Findler and Matthias Blume. Contracts as pairs of projections. In Functional and Logic Programming, pages 226-241. Springer Berlin / Heidelberg, 2006. (Pubitemid 44029270)
11. Robert Bruce Findler and Matthias Felleisen. Contracts for higher-order functions. In Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pages 48-59, New York, NY, USA, 2002. ACM.
12. Cormac Flanagan. Hybrid type checking. In Morrisett and Peyton Jones [27], pages 245-256.
13. Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended static checking for Java. In PLDI '02: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 234-245, New York, NY, USA, 2002. ACM. (Pubitemid 34991522)
14. Cormac Flanagan and James B. Saxe. Avoiding exponential explosion: generating compact verification conditions. In POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 193-205, New York, NY, USA, 2001. ACM. (Pubitemid 33720339)
15. Tim Freeman and Frank Pfenning. Refinement types for ML. In PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, pages 268-277, New York, NY, USA, 1991. ACM.
16. Jessica Gronski and Cormac Flanagan. Unifying hybrid types and contracts. In Eighth Symposium on Trends in Functional Programming, April 2007.
17. Thomas Hallgren. Haskell tools from the Programatica project. In Haskell '03: Proceedings of the 2003 ACM SIGPLAN workshop on Haskell, pages 103-106, New York, NY, USA, 2003. ACM.
18. Ralf Hinze, Johan Jeuring, and Andres Löh. Typed contracts for functional programming. In Functional and Logic Programming: 8th International Symposium, pages 208-225, 2006. (Pubitemid 44029269)
19. Kohei Honda and Nobuko Yoshida. A compositional logic for polymorphic higher-order functions. In PPDP '04: Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, pages 191-202, New York, NY, USA, 2004. ACM. (Pubitemid 40062857)
20. Kenneth Knowles and Cormac Flanagan. Type reconstruction for general refinement types. In ESOP '07: Programming Languages and Systems, 16th European Symposium on Programming. Springer-Verlag, April 2007.
21. Kenneth Knowles, Aaron Tomb, Jessica Gronski, Stephen N. Freund, and Cormac Flanagan. SAGE: Unified hybrid checking for first-class types, general refinement types, and dynamic (extended report). Technical report, UC Santa Cruz, 2006. http://sage.soe.ucsc.edu/sage-tr.pdf.
22. K. Rustan M. Leino and Greg Nelson. An extended static checker for Modula-3. In CC '98: Proceedings of the 7th International Conference on Compiler Construction, pages 302-305, London, UK, 1998. Springer-Verlag. (Pubitemid 128055747)
23. Philippe Meunier, Robert Bruce Findler, and Matthias Felleisen. Modular set-based analysis from contracts. In Morrisett and Peyton Jones [27], pages 218-231.
24. Bertrand Meyer. Eiffel: The Language. Prentice Hall International, London, 1992.
25. Neil Mitchell. Transformation and Analysis of Functional Programs. PhD thesis, University of York, 2008.
26. Neil Mitchell and Colin Runciman. Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching. In Haskell '08: Proceedings of the first ACM SIGPLAN symposium on Haskell, pages 49-60, New York, NY, USA, 2008. ACM.
27. J. Gregory Morrisett and Simon L. Peyton Jones, editors. POPL '06: Proceedings of the 33rd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, USA, January 11-13, 2006. ACM, 2006.
28. Aleksandar Nanevski, Amal Ahmed, Greg Morrisett, and Lars Birkedal. Abstract predicates and mutable ADTs in Hoare Type Theory. In Rocco De Nicola, editor, ESOP, volume 4421 of Lecture Notes in Computer Science, pages 189-204. Springer, 2007. (Pubitemid 350259492)
29. Aleksandar Nanevski, Greg Morrisett, and Lars Birkedal. Polymorphism and separation in hoare type theory. In Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, Portland, Oregon, USA, Sept., pages 62-73, 2006. (Pubitemid 44642855)
30. D. L. Parnas. A technique for software module specification with examples. Communications of the ACM, 15(5):330-336, May 1972.
31. Yann Régis-Gianas and François Pottier. A Hoare logic for call-by-value functional programs. In P Audebaud and C Paulin-Mohring, editors, MPC, volume 5133 of Lecture Notes in Computer Science, pages 305-335. Springer, 2008.
32. Tim Sheard. Languages of the future. In OOPSLA '04: Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, pages 116-119, New York, NY, USA, 2004. ACM.
33. The GHC Team. The Glasgow Haskell Compiler user's guide. www.haskell.org/ghc/documentation.html, 1998.
34. J Visser, J. N. Oliveira, Barbosa L. S., J. F. Ferreira, and A. Mendes. CAMILA revival: VDM meets Haskell. In Nico Plat and Peter Gorm Larsen, editors, Overture Workshop (colocated with FM'05), 2005.
35. PhilipWadler and Robert Bruce Findler. Well-typed programs can't be blamed. In Workshop on Scheme and Functional Programming, Sept 2007.
36. Edwin M. Westbrook, Aaron Stump, and Ian Wehrman. A language-based approach to functionally correct imperative programming. In Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, Tallinn, Estonia, pages 268-279, Sept. 2005. (Pubitemid 43907052)
37. Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In POPL '99: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 214-227, New York, NY, USA, 1999. ACM.
38. Dana N. Xu. Extended static checking for Haskell. In Haskell '06: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, pages 48-59, New York, NY, USA, 2006. ACM. (Pubitemid 44747754)
39. Na Xu. Static Contract Checking for Haskell. PhD thesis, University of Cambridge, 2008. http://www.cl.cam.ac.uk/techreports/.