Chasing bottoms a case study in program verification in the presence of partial and infinite values

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3125, Issue , 2004, Pages 85-109

  Danielsson, Nils Anders ^a   Jansson, Patrik ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

FIXPOINTS; HASKELL; PRETTY PRINTERS; PROGRAM VERIFICATION;

FUNCTIONAL PROGRAMMING;

EID: 32144436471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27764-4_6     Document Type: Article

References (14)

1. Manuel Chakravarty et al. The Haskell 98 Foreign Function Interface 1.0, An Addendum to the Haskell 98 Report, 2003. Available online at http://www.haskell.org/definition/.
2. Koen Claessen and John Hughes. QuickCheck: A lightweight tool for random testing of Haskell programs. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming, pages 268-279. ACM Press, 2000.
3. Karl-Filip Faxén. A static semantics for Haskell. Journal of Functional Programming, 12(4&5):295-357, July 2002.
4. Jeremy Gibbons and Graham Button. Proof methods for corecursive programs. Submitted to Fundamenta Informaticae Special Issue on Program Transformation. Available online at http://www.cs.nott.ac.uk/gmh/bib.html, March 2004.
5. John Hughes. Why functional programming matters. Computer Journal, 32(2):98-107, 1989.
6. Graham Hutton and Jeremy Gibbons. The generic approximation lemma. Information Processing Letters, 79(4): 197-201, August 2001.
7. Patrik Jansson and Johan Jeuring. Polytypic data conversion programs. Science of Computer Programming, 43(1):35-75, 2002.
8. Patricia Johann and Janis Voigtländer. Free theorems in the presence of seq. In Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 99-110. ACM Press, 2004.
9. Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate: A practical design pattern for generic programming. ACM SIGPLAN Notices, 38(3):26-37, March 2003.
10. Alberto Pardo. Monadic corecursion - definition, fusion laws, and applications -. In Bart Jacobs, Larry Moss, Horst Reichel, and Jan Rutten, editors, Electronic Notes in Theoretical Computer Science, volume 11. Elsevier, 2000.
11. Simon Peyton Jones. Engineering Theories of Software Construction, volume 180 of NATO Science Series: Computer and Systems Sciences, chapter Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell, pages 47-96. IOS Press, 2001. Updated version available online at http://research.microsoft.com/~simonpj/.
12. Simon Peyton Jones, editor. Haskell 98 Language and Libraries, The Revised Report. Cambridge University Press, 2003.
13. D. Sands. Total correctness by local improvement in the transformation of functional programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 18(2):175-234, March 1996.
14. David A. Schmidt. Denotational Semantics: A Methodology for Language Development. W.C. Brown, Dubuque, Iowa, 1988.