5
83%
master: 84%

Ran 10 May 2017 01:39AM UTC

Files 5

Run time 342min

Badge

Embed ▾

Committed 10 May 2017 01:30AM UTC coverage: 75.901% (-0.6%) from 76.471%

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

Build Type

push

travis-ci

Committed by

jbearer

Commit Message

Implement the equivalent of Prolog's =/2.

The goal (|=|) acts as a predicate with special semantics: it
attempts to unify its operands, and succeeds if and only if the
unification succeeds.

Implementing this required a significant overall of the AST and
solver. We introduce a new notion of a Goal, which is any expression
that can appear on the right-hand side of (|-). A goal can be a
predicate, but it can also be a unification goal. This extra level
of abstraction will make it easier to add more special goals in the
future.

Run Details

337 of 444 relevant lines covered (75.9%)

0.76 hits per line

jbearer / hspl / 51 / 5
83%
master: 84%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

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

jbearer / hspl / 51 / 5 83% master: 84%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

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

jbearer / hspl / 51 / 5
83%
master: 84%

README BADGES
x