lamcal 0.4.0

A lambda calculus parser and interpreter
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

use super::*;

mod bitand_stop {

    use super::*;

    #[test]
    fn no_and_no_returns_no() {
        assert_eq!(Stop::No & Stop::No, Stop::No);
    }

    #[test]
    fn yes_and_no_returns_no() {
        assert_eq!(Stop::Yes & Stop::No, Stop::No);
    }

    #[test]
    fn no_and_yes_returns_no() {
        assert_eq!(Stop::No & Stop::Yes, Stop::No);
    }

    #[test]
    fn yes_and_yes_returns_yes() {
        assert_eq!(Stop::Yes & Stop::Yes, Stop::Yes);
    }
}

mod bitor_stop {

    use super::*;

    #[test]
    fn no_and_no_returns_no() {
        assert_eq!(Stop::No | Stop::No, Stop::No);
    }

    #[test]
    fn yes_and_no_returns_yes() {
        assert_eq!(Stop::Yes | Stop::No, Stop::Yes);
    }

    #[test]
    fn no_and_yes_returns_yes() {
        assert_eq!(Stop::No | Stop::Yes, Stop::Yes);
    }

    #[test]
    fn yes_and_yes_returns_yes() {
        assert_eq!(Stop::Yes | Stop::Yes, Stop::Yes);
    }
}

mod limit {

    use super::*;

    use term::any_term;

    proptest! {

        #[test]
        fn calling_inspect_any_times_below_the_limit_returns_dont_stop(
            number in (1..=::std::u32::MAX),
            term in any_term(),
        ) {
            let mut limit = Limit { limit: number, count: number - 1 };

            let stop = limit.inspect(&term);

            prop_assert_eq!(stop, Stop::No);
        }

        #[test]
        fn calling_inspect_when_the_limit_is_reached_it_returns_stop(
            number in (0..=::std::u32::MAX),
            term in any_term(),
        ) {
            let mut limit = Limit { limit: number, count: number };

            let stop = limit.inspect(&term);

            prop_assert_eq!(stop, Stop::Yes);
        }
    }
}

mod trace {

    use super::*;

    use reduction::{Enumerate, NormalOrder};
    use term::{any_term, app, lam, var};

    proptest! {

        #[test]
        fn calling_inspect_with_any_term_always_returns_dont_stop(
            term in any_term(),
        ) {
            let mut trace = Trace::new(|_to_trace| ());

            let stop = trace.inspect(&term);

            prop_assert_eq!(stop, Stop::No);
        }
    }

    #[test]
    fn reduction_of_expression_1() {
        let mut term = app(
            lam("x", app(lam("y", app(var("x"), var("y"))), var("z"))),
            var("a"),
        );

        term.reduce_inspected::<NormalOrder<Enumerate>, _>(&mut Trace::new(|to_reduce| {
            println!("reducing: {}", to_reduce)
        }));
    }
}

mod collect {

    use super::*;

    use term::any_term;

    proptest! {

        #[test]
        fn calling_inspect_with_any_term_always_returns_dont_stop(
            term in any_term(),
        ) {
            let mut collect = Collect::default();

            let stop = collect.inspect(&term);

            prop_assert_eq!(stop, Stop::No);
        }
    }
}