blob: ca9b9bbcdab8b9738b859adb4b81b4676a11df98 (
plain)
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
|
mod ast;
mod checker;
mod checker_set;
mod checker_signature;
mod checker_state;
mod parser;
use tracing_subscriber::{layer::SubscriberExt, util::SubscriberInitExt};
use tracing_tree::HierarchicalLayer;
fn main() {
tracing_subscriber::registry()
.with(
HierarchicalLayer::new(2)
.with_targets(false)
.with_bracketed_fields(true),
)
.init();
let src = r#"
// let X be the set Y, call it Z
let set X = record { b : Bool, n : Nat }
let set Y = X
let set Z = record { y : Y }
// make some elements
let element x : X = { .b = true, .n = 41 }
let element z : Z = { .y = x }
// exercise case matching
let set Z_or_Float = variant [ z : Z | f : Float ]
let element injected : Z_or_Float = z. z
let element check_cases : Nat = case injected of [ z. myz => myz .y .n | f. myf => 2 ]
let signature Graph = theory {
Node :: Set,
Edge :: (s : set-of(Node)) (t : set-of(Node)) -> Set
}
let instance natPoset :: Graph = {
.Node = Nat,
.Edge = for (s : Nat) (t : Nat), Bool
}
let element node : set-of(natPoset .Node) = 7
let set NatEdges = record {
source: set-of(natPoset .Node),
target: set-of(natPoset .Node),
connected: set-of(natPoset .Edge source target)
}
"#;
let programme = parser::parser::program(src);
assert!(programme.is_ok());
let programme = programme.unwrap();
println!("Parsed:\n```\n{}\n```\n", programme);
if let Err(e) = programme.check() {
println!("{}", e);
}
}
|
