lambda_calculus 3.0.0

A simple, zero-dependency implementation of pure lambda calculus in Safe Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

#![feature(test)]
extern crate test;

#[macro_use]
extern crate lambda_calculus as lambda;

use test::Bencher;
use lambda::term::*;

#[bench]
fn term_is_supercombinator(b: &mut Bencher) {
    // Large arbitrary lambda term that is a supercombinator
    let big_term = abs!(1000, app!(
        abs!(1000, app!(abs(Var(10)), abs(Var(10)), abs(Var(10)))),
        abs!(2000, app!(abs(Var(20)), abs(Var(20)), abs(Var(20)))),
        abs!(3000, app!(abs(Var(30)), abs(Var(30)), abs(Var(30)))),
        abs!(4000, app!(abs(Var(40)), abs(Var(40)), abs(Var(40)))),
        abs!(5000, app!(abs(Var(50)), abs(Var(50)), abs(Var(50)))),
        abs!(6000, app!(abs(Var(60)), abs(Var(60)), abs(Var(60))))
    ));
    b.iter(|| { assert_eq!(big_term.is_supercombinator(), true) });
}