prune-lang 0.2.3

Prune is a constraint logic programming language with branching heuristic.
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

mod common;
use common::{run_example, run_example_sat, run_example_unsat};

#[test]
fn test_unary_arith() {
    run_example("arith/unary_arith.pr");
}
#[test]
fn test_binary_arith() {
    run_example("arith/binary_arith.pr");
}
#[test]
fn test_ternary_arith() {
    run_example("arith/ternary_arith.pr");
}
#[test]
fn test_binary_vec() {
    run_example("arith/binary_vec.pr");
}
#[test]
fn test_reverse_forward() {
    run_example("basic/reverse_forward.pr");
}
#[test]
fn test_reverse_backward() {
    run_example("basic/reverse_backward.pr");
}
#[test]
fn test_concat_forward() {
    run_example("basic/concat_forward.pr");
}
#[test]
fn test_concat_backward() {
    run_example("basic/concat_backward.pr");
}
#[test]
fn test_smt_sat() {
    run_example("features/smt_sat.pr");
}
#[test]
fn test_smt_unsat() {
    run_example("features/smt_unsat.pr");
}
#[test]
fn test_tree_insert_good() {
    run_example_unsat("sym_exec/tree_insert_good.pr");
}
#[test]
fn test_tree_insert_bad() {
    run_example_sat("sym_exec/tree_insert_bad.pr");
}
#[test]
fn test_avl_tree_good() {
    run_example_unsat("sym_exec/avl_tree_good.pr");
}
#[test]
#[ignore = "this test cost too much time!"]
fn test_avl_tree_bad() {
    run_example_sat("sym_exec/avl_tree_bad.pr");
}
#[test]
fn test_avl_tree_gen() {
    run_example("test_gen/avl_tree_gen.pr");
}
#[test]
fn test_avl_tree_arith_gen() {
    run_example("test_gen/avl_tree_arith_gen.pr");
}
#[test]
fn test_lambda_free_gen() {
    run_example("test_gen/lambda_free_gen.pr");
}
#[test]
fn test_stlc_term_gen() {
    run_example("test_gen/stlc_term_gen.pr");
}
#[test]
fn test_mini_lang_gen() {
    run_example("test_gen/mini_lang_gen.pr");
}