diff options
Diffstat (limited to 'dev-haskell/chasingbottoms')
| -rw-r--r-- | dev-haskell/chasingbottoms/metadata.xml | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/dev-haskell/chasingbottoms/metadata.xml b/dev-haskell/chasingbottoms/metadata.xml index bf0a95f2eed0..21f906bf63f3 100644 --- a/dev-haskell/chasingbottoms/metadata.xml +++ b/dev-haskell/chasingbottoms/metadata.xml @@ -32,13 +32,13 @@ Showing partial and infinite values (@\\\/!@ is join and @\/\\!@ is meet): - [@> approxShow 4 $ (True, bottom) \\\/! (bottom, \'b\')@] @\"Just (True, \'b\')\"@ + [@> approxShow 4 $ (True, bottom) \\\/! (bottom, \'b\')@] @\"Just (True, \'b\')\"@ - [@> approxShow 4 $ (True, bottom) \/\\! (bottom, \'b\')@] @\"(_|_, _|_)\"@ + [@> approxShow 4 $ (True, bottom) \/\\! (bottom, \'b\')@] @\"(_|_, _|_)\"@ - [@> approxShow 4 $ ([1..\] :: [Int\])@] @\"[1, 2, 3, _\"@ + [@> approxShow 4 $ ([1..\] :: [Int\])@] @\"[1, 2, 3, _\"@ - [@> approxShow 4 $ (cycle [bottom\] :: [Bool\])@] @\"[_|_, _|_, _|_, _\"@ + [@> approxShow 4 $ (cycle [bottom\] :: [Bool\])@] @\"[_|_, _|_, _|_, _\"@ Approximately comparing infinite, partial values: @@ -47,16 +47,16 @@ [@> approx 100 [2,4..\] \/=! approx 100 (filter even [bottom..\] :: [Int\])@] @True@ The code above relies on the fact that @bottom@, just as @error - \"...\"@, @undefined@ and pattern match failures, yield + \"...\"@, @undefined@ and pattern match failures, yield exceptions. Sometimes we are dealing with properly non-terminating computations, such as the following example, and then it can be nice to be able to apply a time-out: - [@> timeOut' 1 (reverse [1..5\])@] @Value [5,4,3,2,1]@ + [@> timeOut' 1 (reverse [1..5\])@] @Value [5,4,3,2,1]@ - [@> timeOut' 1 (reverse [1..\])@] @NonTermination@ + [@> timeOut' 1 (reverse [1..\])@] @NonTermination@ - The time-out functionality can be used to treat \"slow\" computations as + The time-out functionality can be used to treat \"slow\" computations as bottoms: [@> let tweak = Tweak &#x7b; approxDepth = Just 5, timeOutLimit = Just 2 &#x7d;@] @@ -86,8 +86,8 @@ [@ @] @Value ()@ For the underlying theory and a larger example involving use of - QuickCheck, see the article \"Chasing Bottoms, A Case Study in Program - Verification in the Presence of Partial and Infinite Values\" + QuickCheck, see the article \"Chasing Bottoms, A Case Study in Program + Verification in the Presence of Partial and Infinite Values\" (<http://www.cse.chalmers.se/~nad/publications/danielsson-jansson-mpc2004.html>). The code has been tested using GHC. Most parts can probably be |