publication . Part of book or chapter of book . 2007

Monadic, prompt lazy assertions in Haskell

Chitil, Olaf; Huch, Frank;
Open Access
  • Published: 01 Nov 2007
  • Publisher: Springer Berlin Heidelberg
  • Country: United States
Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with assertions. Expected properties can be specified in a parser-combinator like language. The assertions are lazy: they do not force evaluation but only examine what is evaluated by the program. They are also prompt: assertion failure is reported as early as possible. The implementation is based on lazy observations and continuation-based coroutines.
ACM Computing Classification System: TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS
free text keywords: Computer programming, business.industry, business, Theoretical computer science, Assertion, Haskell, computer.programming_language, computer, Monad (functional programming), Coroutine, Computation, Continuation, Computer science, Programming language, computer.software_genre, QA76
Download fromView all 2 versions
Part of book or chapter of book
Provider: UnpayWall
Kent Academic Repository
Part of book or chapter of book . 2007
Part of book or chapter of book
Provider: Crossref

1. Olaf Chitil and Frank Huch. A pattern logic for prompt lazy assertions in Haskell. In Andrew Butterfield Zoltan Horvath, editor, Implementation and Application of Functional Languages: 18th International Workshop, IFL 2006, volume 4449 of LNCS. Springer, 2007.

2. Olaf Chitil, Dan McNeill, and Colin Runciman. Lazy assertions. In Phil Trinder, Greg Michaelson, and Ricardo Pena, editors, Implementation of Functional Languages: 15th International Workshop, IFL 2003, LNCS 3145, pages 1-19. Springer, November 2004.

3. K. Claessen and R. J. M. Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In Proc. 5th Intl. ACM Conference on Functional Programming, pages 268-279. ACM Press, 2000.

4. Nils Anders Danielsson and Patrik Jansson. Chasing bottoms, a case study in program verification in the presence of partial and infinite values. In Dexter Kozen, editor, Proceedings of the 7th International Conference on Mathematics of Program Construction, MPC 2004, LNCS 3125, pages 85-109. Springer-Verlag, July 2004.

5. Robert Bruce Findler and Matthias Felleisen. Contracts for higher-order functions. In ICFP '02: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pages 48-59. ACM Press, 2002.

6. A. Gill. Debugging Haskell by observing intermediate datastructures. Electronic Notes in Theoretical Computer Science, 41(1), 2001. (Proc. 2000 ACM SIGPLAN Haskell Workshop).

7. Ralf Hinze, Johan Jeuring, and Andres L¨oh. Typed contracts for functional programming. In Proceedings of the 8th International Symposium on Functional and Logic Programming, FLOPS 2006, LNCS 3945, pages 208-225, 2006.

8. Graham Hutton and Erik Meijer. Monadic parsing in Haskell. J. Funct. Program., 8(4):437-444, 1998.

9. Chris Okasaki. Functional pearl: Even higher-order functions for parsing or Why would anyone ever want to use a sixth-order function? Journal of Functional Programming, 8(2):195-199, 1998.

10. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, Cambridge, UK, 1998.

11. M. Wallace, O. Chitil, T. Brehm, and C. Runciman. Multiple-view tracing for Haskell: a new Hat. In ACM Workshop on Haskell, 2001. [OpenAIRE]

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Part of book or chapter of book . 2007

Monadic, prompt lazy assertions in Haskell

Chitil, Olaf; Huch, Frank;