Verifying haskell programs using constructive type theory

Haskell'05 - Proceedings of the ACM SIGPLAN 2005 Haskell Workshop

Volumn , Issue , 2005, Pages 62-73

  Abel, Andreas ^a   Benke, Marcin ^a   Bove, Ana ^a   Hughes, John ^a   Norell, Ulf ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Ghc core; Haskeil; Monadic translation; Partiality; Type theory; Verification

Indexed keywords

FUNCTIONAL PROGRAMS; PARTIALITY; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES; SEMANTICS; THEOREM PROVING;

COMPUTER SOFTWARE;

EID: 32144434754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088348.1088355     Document Type: Conference Paper

References (19)

1. G. Barthe, J. Hatcliff, and P. Thiemann. Monadic type systems: Pure type systems for impure settings. In A. Gordon, A. Pitts, and C. Talcott, editors, HOOTS II. Second Workshop on Higher-Order Operational Techniques in Semantics, volume 10 of Electronic Notes in Theoretical Computer Science, pages 54-120, 1997.
2. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science. Springer-Verlag, 2004,.
3. V. Capretta. General recursion via coinductive types. Logical Methods in Computer Science, 2005. To appear.
4. K. Claessen and J. Hughes. Quickcheck: A lightweight tool for random testing of haskell programs, 2000.
5. C. Coquand and T. Coquand. Structured type theory. In Proc. Workshop on Logical Frameworks and Meta-languages, 1999.
6. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3):95-120, 1988.
7. M. de Mol, M. C. J. D. van Eekelen, and M. J. Plasmeijer. Theorem proving for functional programmers. In T. Arts and M. Mohnen, editors, Implementation of Functional Languages, 13th International Workshop, IFL 2001, Stockholm, Sweden, September 24-26, 2001, Lecture Notes in Computer Science, pages 55-71. Springer, 2002.
8. J.-C. Filliâtre. Verification of non-functional programs using interpretations in type theory. Journal of Functional Programming, 13(4):709-745, July 2003.
9. T. Hallgren, J. Hook, M. P. Jones, and R. B. Kieburtz. An overview of the programatica toolset. Presented at the High Confidence Software and Systems Conference, HCSS04, 2004.
10. W. L. Harrison and R. B. Kieburtz. A logic of demand in Haskell. Journal of Functional Programming. 2005. Under consideration of publication.
11. W. A. Howard. The formulae-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479-490. Academic Press, London, 1980.
12. C. Kreitz. Formal reasoning about communication systems I: Embedding ML into type theory. Technical report, Cornell University, 1997.
13. C. Kreitz. Building reliable, high-performance networks with the Nuprl proof development system. Journal of Functional Programming, 14(1):21-68, 2004.
14. D. Leivant. Finitely stratified polymorphism. Information and Computation, 93(1):93-113, July 1991.
15. J. Longley and R. Pollack. Reasoning about cbv functional programs in isabelle/hol. In K. Slind, A. Bunker, and G. Gopalakrishnan, editors, Theorem Proving in Higher Order Logics, 17th International Conference, TPHOLs 2004, Park City, Utah, USA. September 14-17, 2004, Proceedings, volume 3223 of Lecture Notes in Computer Science, pages 201-216. Springer, 2004.
16. [16[ P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.
17. F. Pfenning and C. Schürmann. System description: Twelf - A meta-logical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, 1999. Springer-Verlag LNAI 1632.
18. T. Uustalu. Monad translating inductive and coinductive types. In H. Geuvers and F. Wiedijk, editors. Types for Proofs and Programs, Second International Workshop. TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers, volume 2646 of Lecture Notes in Computer Science, pages 299-315. Springer, 2003.
19. P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages, pages 60-76. ACM, Jan. 1989.