-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtuples.txt
35 lines (31 loc) · 925 Bytes
/
tuples.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
max expr size = 5
|- on conds = 4
max #-tests = 500
min #-tests = 25 (to consider p ==> q true)
max #-vars = 3 (for inequational and conditional laws)
_ :: ()
_ :: Int
_ :: (Int,Int)
_ :: (Int,Int,Int)
() :: ()
id :: () -> ()
id :: Int -> Int
id :: (Int,Int) -> (Int,Int)
id :: (Int,Int,Int) -> (Int,Int,Int)
(,) :: Int -> Int -> (Int,Int)
(,,) :: Int -> Int -> Int -> (Int,Int,Int)
fst :: (Int,Int) -> Int
snd :: (Int,Int) -> Int
swap :: (Int,Int) -> (Int,Int)
right :: (Int,Int,Int) -> (Int,Int,Int)
left :: (Int,Int,Int) -> (Int,Int,Int)
id x == x
fst (x,y) == x
snd (x,y) == y
id xy == xy
(fst xy,snd xy) == xy
swap xy == (snd xy,fst xy)
id xyz == xyz
right (right (right xyz)) == xyz
left xyz == right (right xyz)
right (x,y,z) == (z,x,y)