论文信息 - Lazy Assertions

Lazy Assertions

Assertions test expected properties of run-time values without disrupting the normal working of a program. So in a lazy functional language assertions should be lazy – not forcing evaluation, but only examining what is evaluated by other parts of the program. We explore the subtle semantics of lazy assertions and describe sequential and concurrent variants of a method for checking lazy assertions. All variants are implemented in Haskell.

[1] Philip Wadler. XQuery: A Typed Functional Language for Querying XML , 2002, Advanced Functional Programming.

[2] Koen Claessen,et al. Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat , 2002, Advanced Functional Programming.

[3] Werner Kluge,et al. Implementation of Functional Languages , 1996, Lecture Notes in Computer Science.

[4] Ralf Hinze,et al. Haskell 98 — A Non−strict‚ Purely Functional Language , 1999 .

[5] Gill Andy. Debugging Haskell by Observing Intermediate Data Structures , 2001 .

[6] Simon L. Peyton Jones,et al. Stretching the Storage Manager: Weak Pointers and Stable Names in Haskell , 1999, IFL.

[7] Koen Claessen,et al. QuickCheck: a lightweight tool for random testing of Haskell programs , 2000, ICFP.

[8] Manfred Broy,et al. Engineering Theories of Software Construction , 2001 .

[9] Bernhard Möller,et al. Applicative Assertions , 1989, MPC.

[10] Simon Peyton Jones,et al. Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell , 2005 .

[11] Andy Gill. Debugging Haskell by Observing Intermediate Data Structures , 2000, Electron. Notes Theor. Comput. Sci..

[12] Colin Runciman,et al. Multiple-View Tracing for Haskell: a New Hat , 2001 .