### bookmarks  (hide)9displayallbookmarks onlybookmarks per page5102050100sort byadded attitleorderascendingdescendingRSSBibTeXXML

•

#### 1PDD: Properties Driven Development - A++ [Eric Torreborre's Blog]

PDD: Properties Driven Development | A++ [Eric Torreborre's Blog]
9 years ago by @draganigajic
(0)

•

•

•

•

#### 1Functional Programming Unit Testing - Part 1 - Matthew Podwysocki

Let's focus on the tooling around testing with functional languages. What kind of options do we have? In the Haskell world just as the F# world, there are several tools at our disposal to do this. * HUnit A traditional xUnit testing framework for unit testing. Analogous to such frameworks as xUnit.net, NUnit and MbUnit in the .NET world. * QuickCheck A program in which the developer provides a specification of the program, in the form of properties which functions should satisfy, and then tests that the properties hold in a large number of randomly generated cases that QuickCheck provides. There are many variants of this tool for most functional languages including F# (FsCheck), Erlang, Scala, Java, Python, Standard ML and others. Today we're going to focus on HUnit as part of developing an API in Haskell.
9 years ago by @draganigajic
(0)

•

#### 1HolBddLib Version 2

In the fully expansive (or LCF-style) approach to theorem proving, theorems are represented by an abstract type whose primitive operations are the axioms and inference rules of a logic. Theorem proving tools are implemented by composing together the inference rules using ML programs. This idea can be generalised to computing valid judgements that represent other kinds of information. In particular, consider judgements (a,r,t,b), where a is a set of boolean terms (assumptions) that are assumed true, r represents a variable order, t is a boolean term all of whose free variables are boolean and b is a BDD. Such a judgement is valid if under the assumptions a, the BDD representing t with respect to r is b, and we will write a r t --> b when this is the case. The derivation of "theorems" like a r t --> b can be viewed as "proof" in the style of LCF by defining an abstract type term_bdd that models judgements a r t --> b analogously to the way the type thm models theorems |- t.
9 years ago by @draganigajic
(0)

•

•

•

• ⟨⟨
• 1
• ⟩⟩

### publications  (hide)displayallpublications onlypublications per page5102050100sort byadded attitleorderascendingdescendinghelp for advanced sorting...RSSBibTeXRDFmore...

No matching posts.
• ⟨⟨
• ⟩⟩