type-operators 0.3.5

A macro system for creating type operators in Rust and writing type-level logic.
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

extern crate bit_vec;

#[macro_use]
extern crate type_operators;


use bit_vec::BitVec;


pub struct State {
    loc: usize,
    bits: BitVec,
}


type_operators! {
    [A, B, C, D, E]
    
    data Program {
        Empty,
        Left(Program = Empty),
        Right(Program = Empty),
        Flip(Program = Empty),
        Loop(Program = Empty, Program = Empty),
    }

    concrete Bit => bool {
        F => false,
        T => true,
    }

    concrete List => BitVec {
        Nil => BitVec::new(),
        Cons(B: Bit, L: List = Nil) => { let mut tail = L; tail.push(B); tail },
    }

    concrete Smallfsck => State {
        St(L: List, C: Bit, R: List) => {
            // So, R is backwards here. That's a problem! But no worries - we
            // know it's a problem, so now it's less of a problem. ;)

            let mut bits = L;
            let loc = bits.len();
            bits.push(C);
            bits.extend(R.into_iter().rev());

            State {
                loc: loc,
                bits: bits,
            }
        },
    }

    (Run) Running(Program, Smallfsck): Smallfsck {
        forall (P: Program, L: List, C: Bit) {
            [(Left P), (St L C Nil)] => (# P (St (Cons C L) F Nil))
        }
        forall (P: Program, C: Bit, R: List) {
            [(Right P), (St Nil C R)] => (# P (St Nil F (Cons C R)))
        }
        forall (P: Program, L: List, C: Bit, N: Bit, R: List) {
            [(Left P), (St L C (Cons N R))] => (# P (St (Cons C L) N R))
            [(Right P), (St (Cons N L) C R)] => (# P (St L N (Cons C R)))
        }
        forall (P: Program, L: List, R: List) {
            [(Flip P), (St L F R)] => (# P (St L T R))
            [(Flip P), (St L T R)] => (# P (St L F R))
        }
        forall (P: Program, Q: Program, L: List, R: List) {
            [(Loop P Q), (St L F R)] => (# Q (St L F R))
            [(Loop P Q), (St L T R)] => (# (Loop P Q) (# P (St L T R)))
        }
        forall (S: Smallfsck) {
            [Empty, S] => S
        }
    }
}


macro_rules! sf {
    (< $($prog:tt)*) => { Left<sf!($($prog)*)> };
    (> $($prog:tt)*) => { Right<sf!($($prog)*)> };
    (* $($prog:tt)*) => { Flip<sf!($($prog)*)> };
    ([$($prog:tt)*]) => { Loop<sf!($($prog)*)> };
    () => { Nil };
}


type Example = sf!{
    > * > * > * > [ * < ]
};