Skip to content

Commit 2016547

Browse files
Remove --exact-data-cons from tests
1 parent ee9a90b commit 2016547

5 files changed

Lines changed: 7 additions & 12 deletions

File tree

‎tests/typed-holes/Example2.hs‎

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,11 @@
11
{-@ LIQUID "--expect-error-containing=Hole Found" @-}
2-
{-@ LIQUID "--exact-data-cons" @-}
32
{-@ LIQUID "--warn-on-term-holes" @-}
43
-- Based on https://ucsd-progsys.github.io/liquidhaskell-blog/2016/10/06/structural-induction.lhs/
54

65
module Example2 where
76
import Prelude hiding ((<>))
87
import Language.Haskell.Liquid.ProofCombinators ((===), (***), QED(QED), Proof)
9-
8+
109
hole = undefined
1110

1211
{-@ reflect empty @-}
@@ -24,7 +23,7 @@ module Example2 where
2423
leftId x
2524
= empty <> x
2625
=== hole
27-
=== x
26+
=== x
2827
*** QED
2928

3029
{-@ rightId :: x:[a] -> { (x <> empty) == x } @-}

‎tests/typed-holes/Example3.hs‎

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,4 @@
11
{-@ LIQUID "--expect-error-containing=Hole Found" @-}
2-
{-@ LIQUID "--exact-data-cons" @-}
32
{-@ LIQUID "--warn-on-term-holes" @-}
43
-- Based on paper: Theorem Proving for All: Equational Reasoning in Liquid Haskell (Functional Pearl)
54

@@ -8,7 +7,7 @@ module Example3 where
87
import Language.Haskell.Liquid.ProofCombinators ((===), (***), QED(QED), Proof)
98

109
hole = undefined
11-
10+
1211
{-@ length :: [a] -> {v:Int | 0 <= v } @-}
1312
length :: [a] -> Int
1413
length [] = 0

‎tests/typed-holes/Example4.hs‎

Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,4 @@
11
{-@ LIQUID "--expect-error-containing=Hole Found" @-}
2-
{-@ LIQUID "--exact-data-cons" @-}
32
{-@ LIQUID "--warn-on-term-holes" @-}
43
-- Based on paper: Theorem Proving for All: Equational Reasoning in Liquid Haskell (Functional Pearl)
54

@@ -30,11 +29,11 @@ module Example4 where
3029

3130
{-@ reverseApp :: xs:[a] -> ys:[a] -> {zs:[a] | zs == reverse xs ++ ys} @-}
3231
reverseApp :: [a] -> [a] -> [a]
33-
reverseApp [] ys
32+
reverseApp [] ys
3433
= reverse [] ++ ys
35-
=== [] ++ ys
34+
=== [] ++ ys
3635
=== ys
37-
reverseApp (x:xs) ys
36+
reverseApp (x:xs) ys
3837
= reverse (x:xs) ++ ys
3938
=== (reverse xs ++ [x]) ++ ys
4039
=== (reverse xs ++ [x] ++ ys) ? hole -- I need a lemma here! Can the hole help me?

‎tests/typed-holes/Example5.hs‎

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,4 @@
11
{-@ LIQUID "--expect-error-containing=Hole Found" @-}
2-
{-@ LIQUID "--exact-data-cons" @-}
32
{-@ LIQUID "--warn-on-term-holes" @-}
43
-- Based on paper: Theorem Proving for All: Equational Reasoning in Liquid Haskell (Functional Pearl)
54

@@ -29,7 +28,7 @@ module Example5 where
2928
(x:xs) ++ ys = x : (xs ++ ys)
3029
{-@ infixl ++ @-}
3130
{-@ reflect ++ @-}
32-
31+
3332

3433
{-@ flattenApp :: t:Tree -> ns:[Int] -> { v:[Int] | v == flatten t ++ ns } @-}
3534
flattenApp :: Tree -> [Int] -> [Int]

‎tests/typed-holes/Example6.hs‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,4 @@
11
{-@ LIQUID "--expect-error-containing=Hole Found" @-}
2-
{-@ LIQUID "--exact-data-cons" @-}
32
{-@ LIQUID "--warn-on-term-holes" @-}
43
-- Based on paper: Theorem Proving for All: Equational Reasoning in Liquid Haskell (Functional Pearl)
54
{-@ infix : @-}

0 commit comments

Comments
 (0)