airlang 0.28.0

Air is a universal, reliable, and lean programming language.
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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170

use const_format::concatcp;

use crate::semantics::cfg::Cfg;
use crate::semantics::core::PREFIX_CELL;
use crate::semantics::core::form::CellForm;
use crate::semantics::core::form::ListForm;
use crate::semantics::core::form::MapForm;
use crate::semantics::core::form::PairForm;
use crate::semantics::core::key::KeyEval;
use crate::semantics::ctx::Ctx;
use crate::semantics::func::DynFunc;
use crate::semantics::val::CallVal;
use crate::semantics::val::CellVal;
use crate::semantics::val::ListVal;
use crate::semantics::val::MapVal;
use crate::semantics::val::PairVal;
use crate::semantics::val::QuoteVal;
use crate::semantics::val::SolveVal;
use crate::semantics::val::Val;
use crate::type_::Call;
use crate::type_::Key;
use crate::type_::Pair;
use crate::type_::Quote;
use crate::type_::Solve;

pub(crate) struct QuoteEval;

impl DynFunc<Val, QuoteVal, Val> for QuoteEval {
    fn call(&self, _cfg: &mut Cfg, _ctx: Ctx<Val>, quote: QuoteVal) -> Val {
        let quote = Quote::from(quote);
        quote.value
    }
}

pub(crate) struct CallEval<'a, Func, Input> {
    pub(crate) func: &'a Func,
    pub(crate) input: &'a Input,
}

impl<'a, Func, Input> DynFunc<Val, CallVal, Val> for CallEval<'a, Func, Input>
where
    Func: DynFunc<Val, Val, Val>,
    Input: DynFunc<Val, Val, Val>,
{
    fn call(&self, cfg: &mut Cfg, mut ctx: Ctx<Val>, call: CallVal) -> Val {
        let call = Call::from(call);
        let func = self.func.call(cfg, ctx.reborrow(), call.func);
        let Val::Func(func) = func else {
            return cfg.abort();
        };
        let input = self.input.call(cfg, ctx.reborrow(), call.input);
        if cfg.is_aborted() {
            return Val::default();
        }
        func.call(cfg, ctx, input)
    }
}

pub const SOLVER: &str = concatcp!(PREFIX_CELL, "solver");

pub(crate) struct SolveEval<'a, Func, Output> {
    pub(crate) func: &'a Func,
    pub(crate) output: &'a Output,
}

impl<'a, Func, Output> DynFunc<Val, SolveVal, Val> for SolveEval<'a, Func, Output>
where
    Func: DynFunc<Val, Val, Val>,
    Output: DynFunc<Val, Val, Val>,
{
    fn call(&self, cfg: &mut Cfg, mut ctx: Ctx<Val>, solve: SolveVal) -> Val {
        let solve = Solve::from(solve);
        let func = self.func.call(cfg, ctx.reborrow(), solve.func);
        let Val::Func(func) = func else {
            return cfg.abort();
        };
        let output = self.output.call(cfg, ctx.reborrow(), solve.output);
        if cfg.is_aborted() {
            return Val::default();
        }
        let Some(solver) = cfg.map.get(&Key::from_str_unchecked(SOLVER)) else {
            return cfg.abort();
        };
        let Val::Func(solver) = solver else {
            return cfg.abort();
        };
        let solver = solver.clone();
        let problem = Val::Pair(Pair::new(Val::Func(func.clone()), output.clone()).into());
        let Val::Fact(fact) = solver.call(cfg, ctx.reborrow(), problem) else {
            return cfg.abort();
        };
        if cfg.is_aborted() {
            return Val::default();
        }
        if *fact.func() != func || *fact.output() != output {
            return cfg.abort();
        }
        fact.input().clone()
    }
}

#[derive(Default, Copy, Clone)]
pub struct Eval;

impl DynFunc<Val, Val, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, val: Val) -> Val {
        if cfg.is_aborted() {
            return Val::default();
        }
        match val {
            Val::Key(key) => self.call(cfg, ctx, key),
            Val::Cell(cell) => self.call(cfg, ctx, cell),
            Val::Pair(pair) => self.call(cfg, ctx, pair),
            Val::List(list) => self.call(cfg, ctx, list),
            Val::Map(map) => self.call(cfg, ctx, map),
            Val::Quote(quote) => self.call(cfg, ctx, quote),
            Val::Call(call) => self.call(cfg, ctx, call),
            Val::Solve(solve) => self.call(cfg, ctx, solve),
            v => v,
        }
    }
}

impl DynFunc<Val, Key, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, key: Key) -> Val {
        KeyEval.call(cfg, ctx, key)
    }
}

impl DynFunc<Val, CellVal, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, cell: CellVal) -> Val {
        Val::Cell(CellForm { value: self }.call(cfg, ctx, cell))
    }
}

impl DynFunc<Val, PairVal, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, pair: PairVal) -> Val {
        Val::Pair(PairForm { left: self, right: self }.call(cfg, ctx, pair))
    }
}

impl DynFunc<Val, ListVal, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, list: ListVal) -> Val {
        Val::List(ListForm { item: self }.call(cfg, ctx, list))
    }
}

impl DynFunc<Val, MapVal, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, map: MapVal) -> Val {
        Val::Map(MapForm { value: self }.call(cfg, ctx, map))
    }
}

impl DynFunc<Val, QuoteVal, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, quote: QuoteVal) -> Val {
        QuoteEval.call(cfg, ctx, quote)
    }
}

impl DynFunc<Val, CallVal, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, call: CallVal) -> Val {
        CallEval { func: self, input: self }.call(cfg, ctx, call)
    }
}

impl DynFunc<Val, SolveVal, Val> for Eval {
    fn call(&self, cfg: &mut Cfg, ctx: Ctx<Val>, solve: SolveVal) -> Val {
        SolveEval { func: self, output: self }.call(cfg, ctx, solve)
    }
}