karpal-proof 0.6.1

Algebraic law witnesses and refinement types for the Industrial Algebra ecosystem
Documentation 
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147

// Copyright (C) 2026 Industrial Algebra
// SPDX-License-Identifier: Apache-2.0

//! Integration tests for karpal-proof-derive macros.

use karpal_core::{Monoid, Semigroup};
use karpal_proof::{VerifyCommutative, VerifyGroup, VerifyMonoid, VerifySemigroup};

#[derive(Clone, Copy, Debug, PartialEq, Eq, VerifySemigroup)]
#[verify(strategy = "(0i16..100).prop_map(AdditiveS)")]
struct AdditiveS(i16);

impl Semigroup for AdditiveS {
    fn combine(self, other: Self) -> Self {
        AdditiveS(self.0.wrapping_add(other.0))
    }
}

#[derive(Clone, Copy, Debug, PartialEq, Eq, VerifyMonoid)]
#[verify(strategy = "(0i16..100).prop_map(AdditiveM)")]
struct AdditiveM(i16);

impl Semigroup for AdditiveM {
    fn combine(self, other: Self) -> Self {
        AdditiveM(self.0.wrapping_add(other.0))
    }
}

impl Monoid for AdditiveM {
    fn empty() -> Self {
        AdditiveM(0)
    }
}

#[derive(Clone, Copy, Debug, PartialEq, Eq, VerifyGroup)]
#[verify(strategy = "(-50i16..50).prop_map(AdditiveG)")]
struct AdditiveG(i16);

impl Semigroup for AdditiveG {
    fn combine(self, other: Self) -> Self {
        AdditiveG(self.0.wrapping_add(other.0))
    }
}

impl Monoid for AdditiveG {
    fn empty() -> Self {
        AdditiveG(0)
    }
}

impl karpal_algebra::Group for AdditiveG {
    fn invert(self) -> Self {
        AdditiveG(self.0.wrapping_neg())
    }
}

#[derive(Clone, Copy, Debug, PartialEq, Eq, VerifyCommutative)]
#[verify(strategy = "(-50i16..50).prop_map(AdditiveC)")]
struct AdditiveC(i16);

impl Semigroup for AdditiveC {
    fn combine(self, other: Self) -> Self {
        AdditiveC(self.0.wrapping_add(other.0))
    }
}

// ---------------------------------------------------------------------------
// Test type: a lattice (min/max)
// ---------------------------------------------------------------------------

use karpal_proof::VerifyLattice;

#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord, VerifyLattice)]
#[verify(strategy = "(0i32..1000).prop_map(MinMax)")]
struct MinMax(i32);

impl karpal_algebra::Lattice for MinMax {
    fn meet(self, other: Self) -> Self {
        MinMax(self.0.min(other.0))
    }

    fn join(self, other: Self) -> Self {
        MinMax(self.0.max(other.0))
    }
}

// ---------------------------------------------------------------------------
// Test type: a semiring (wrapping arithmetic)
// ---------------------------------------------------------------------------

use karpal_proof::VerifySemiring;

#[derive(Clone, Copy, Debug, PartialEq, Eq, VerifySemiring)]
#[verify(strategy = "(-10i16..10).prop_map(WrapRing)")]
struct WrapRing(i16);

impl karpal_algebra::Semiring for WrapRing {
    fn add(self, other: Self) -> Self {
        WrapRing(self.0.wrapping_add(other.0))
    }

    fn mul(self, other: Self) -> Self {
        WrapRing(self.0.wrapping_mul(other.0))
    }

    fn zero() -> Self {
        WrapRing(0)
    }

    fn one() -> Self {
        WrapRing(1)
    }
}

// ---------------------------------------------------------------------------
// Test type: ring (wrapping arithmetic with negate)
// ---------------------------------------------------------------------------

use karpal_proof::VerifyRing;

#[derive(Clone, Copy, Debug, PartialEq, Eq, VerifyRing)]
#[verify(strategy = "(-10i16..10).prop_map(WrapRingN)")]
struct WrapRingN(i16);

impl karpal_algebra::Semiring for WrapRingN {
    fn add(self, other: Self) -> Self {
        WrapRingN(self.0.wrapping_add(other.0))
    }

    fn mul(self, other: Self) -> Self {
        WrapRingN(self.0.wrapping_mul(other.0))
    }

    fn zero() -> Self {
        WrapRingN(0)
    }

    fn one() -> Self {
        WrapRingN(1)
    }
}

impl karpal_algebra::Ring for WrapRingN {
    fn negate(self) -> Self {
        WrapRingN(self.0.wrapping_neg())
    }
}