4
83%
master: 84%

Ran 23 May 2017 03:49AM UTC

Files 6

Run time 0s

Badge

Embed ▾

Committed 23 May 2017 03:46AM UTC coverage: 75.288% (-0.6%) from 75.885%

Job # BUILD=stack ARGS="" TESTARGS="--coverage --haddock"

Build Type

push

travis-ci

Committed by

jbearer

Commit Message

Replace program data structure with distinct self-contained goals.

Instead of creating a unified collection of all clauses in a program,
we store with each 'PredGoal' the list of clauses which can be used to
prove that goal. This has a few advantages:

* Reduces search times for matching clauses in large programs
* Allows clauses to be defined separately, rather than all in one
    "hspl $" block, which makes it easer to write predicates that
    are not part of a program but rather are meant to be imported
    into other HSPL programs.
* Easily allows the attachment of documentation and type annotations
    to each predicate. Providing a type annotation with each predicate
    better utilizes Haskell's type inference, and allows the definition
    of generic predicates.
* Predicates are handled through the corresponding 'Predicate' object,
   rather than at runtime via strings, which reduces the risk of name
   clashes and similar bugs.

Run Details

457 of 607 relevant lines covered (75.29%)

0.75 hits per line

jbearer / hspl / 58 / 4
83%
master: 84%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 58.4 (BUILD=stack ARGS="" TESTARGS="--coverage --haddock")

jbearer / hspl / 58 / 4 83% master: 84%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 58.4 (BUILD=stack ARGS="" TESTARGS="--coverage --haddock")

jbearer / hspl / 58 / 4
83%
master: 84%

README BADGES
x