Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Theorem proving and Unit testing

by sleepingsquirrel (Chaplain)
on Aug 25, 2004 at 20:24 UTC ( [id://385808]=note: print w/replies, xml ) Need Help??


in reply to Theorem proving and Unit testing

You might want to take a look at something like QuickCheck to get further inspiration.
QuickCheck is a tool for testing Haskell programs automatically. The programmer provides a specification of the program, in the form of properties which functions should satisfy, and QuickCheck then tests that the properties hold in a large number of randomly generated cases.

-- All code is 100% tested and functional unless otherwise noted.

Replies are listed 'Best First'.
Re^2: Theorem proving and Unit testing
by stvn (Monsignor) on Aug 25, 2004 at 22:26 UTC

    Thanks for the link, this looks really interesting, very much what I am thinking about. Now only if there were a perl version,... hmmm. Have you yourself ever used this system?

    -stvn
[reply]
      Nope. Never used it myself, although I've been planning to for a while now. And if you look at the bottom of the page you'll see people have imported the idea to languages like Erlang, Scheme, Common Lisp, and Python, so I'd think a perl version wouldn't be too tough.

      -- All code is 100% tested and functional unless otherwise noted.
[reply]

In Section Meditations

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://385808]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others meditating upon the Monastery: (3)
As of 2024-04-24 02:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found