use std::fmt; use std::boxed::Box; use std::rc::Rc; use std::cell::RefCell; use std::convert::From; // todo, strings not symbols? impl From for Form { fn from(item: String) -> Self { Form::Symbol(item) } } impl From<&str> for Form { fn from(item: &str) -> Self { Form::Symbol(item.to_owned()) } } impl From for Form { fn from(item: i32) -> Self { Form::Int(item) } } impl From for Form { fn from(item: bool) -> Self { Form::Bool(item) } } impl, B: Into
> From<(A, B)> for Form { fn from(item: (A, B)) -> Self { Form::Pair(Rc::new(item.0.into()), Rc::new(item.1.into())) } } pub trait FormT: std::fmt::Debug { fn nil() -> Rc; fn truthy(&self) -> bool; fn int(&self) -> Option; fn sym(&self) -> Option<&str>; fn pair(&self) -> Option<(Rc,Rc)>; fn car(&self) -> Option>; fn cdr(&self) -> Option>; fn prim_comb(&self) -> Option<(i32, PrimCombI)>; fn deri_comb(&self) -> Option<(Rc, Option, String, Rc)>; fn cont_comb(&self) -> Option>; fn is_nil(&self) -> bool; fn append(&self, x: Rc) -> Option>; fn assoc(k: &str, v: Rc, l: Rc) -> Rc; fn impl_prim(ins: PrimCombI, e: Rc, ps: Rc, c: Cont, metac: Cont) -> Cursor; } impl FormT for Form { fn prim_comb(&self) -> Option<(i32, PrimCombI)> { match self { Form::PrimComb{ eval_limit, ins } => Some((*eval_limit,*ins)), _ => None, } } fn deri_comb(&self) -> Option<(Rc, Option, String, Rc)> { match self { Form::DeriComb{ se, de, params, body } => Some((Rc::clone(se), de.clone(), params.clone(), Rc::clone(body))), _ => None, } } fn cont_comb(&self) -> Option> { match self { Form::ContComb(c) => Some(c.clone()), _ => None, } } fn nil() -> Rc { Rc::new(Form::Nil) } fn truthy(&self) -> bool { match self { Form::Bool(b) => *b, Form::Nil => false, _ => true, } } fn int(&self) -> Option { match self { Form::Int(i) => Some(*i), _ => None, } } fn sym(&self) -> Option<&str> { match self { Form::Symbol(s) => Some(s), _ => None, } } fn pair(&self) -> Option<(Rc,Rc)> { match self { Form::Pair(car, cdr) => Some((Rc::clone(car),Rc::clone(cdr))), _ => None, } } fn car(&self) -> Option> { match self { Form::Pair(car, _cdr) => Some(Rc::clone(car)), _ => None, } } fn cdr(&self) -> Option> { match self { Form::Pair(_car, cdr) => Some(Rc::clone(cdr)), _ => None, } } fn is_nil(&self) -> bool { match self { Form::Nil => true, _ => false, } } fn append(&self, x: Rc) -> Option> { match self { Form::Pair(car, cdr) => cdr.append(x).map(|x| Rc::new(Form::Pair(Rc::clone(car), x))), Form::Nil => Some(Rc::new(Form::Pair(x, Rc::new(Form::Nil)))), _ => None, } } fn assoc(k: &str, v: Rc, l: Rc) -> Rc { Rc::new(Form::Pair( Rc::new(Form::Pair( Rc::new(Form::Symbol(k.to_owned())), v)), l)) } fn impl_prim(ins: PrimCombI, e: Rc, ps: Rc, c: Cont, metac: Cont) -> Cursor { match ins { PrimCombI::Eval => Cursor { f: ps.car().unwrap(), c: Cont::Eval { e: ps.cdr().unwrap().car().unwrap(), nc: Box::new(c) }, metac }, PrimCombI::Vau => { let de = ps.car().unwrap().sym().map(|s| s.to_owned()); let params = ps.cdr().unwrap().car().unwrap().sym().unwrap().to_owned(); let body = ps.cdr().unwrap().cdr().unwrap().car().unwrap(); Cursor { f: Rc::new(Form::DeriComb { se: e, de, params, body }), c: c, metac: metac } }, PrimCombI::If => if ps.car().unwrap().truthy() { Cursor { f: ps.cdr().unwrap().car().unwrap(), c: Cont::Eval { e: e, nc: Box::new(c) }, metac } } else { Cursor { f: ps.cdr().unwrap().cdr().unwrap().car().unwrap(), c: Cont::Eval { e: e, nc: Box::new(c) }, metac } }, PrimCombI::Reset => Cursor { f: ps.car().unwrap(), c: Cont::Eval { e: e, nc: Box::new(Cont::MetaRet) }, metac: Cont::CatchRet { nc: Box::new(c), restore_meta: Box::new(metac) } }, PrimCombI::Shift => Cursor { f: ps.car().unwrap(), c: Cont::Call { p: Rc::new(Form::Pair(Rc::new(Form::ContComb(c)), Rc::new(Form::Nil))), e: e, nc: Box::new(Cont::MetaRet) }, metac: Cont::CatchRet { nc: Box::new(metac.clone()), restore_meta: Box::new(metac) } }, PrimCombI::Cell => Cursor { f: Rc::new(Form::Cell(RefCell::new(ps.car().unwrap()))), c, metac }, PrimCombI::Set => match &*ps.car().unwrap() { Form::Cell(cell) => Cursor { f: cell.replace(ps.cdr().unwrap().car().unwrap()), c: c, metac }, _ => panic!("set on not cell"), }, PrimCombI::Get => match &*ps.car().unwrap() { Form::Cell(cell) => Cursor { f: Rc::clone(&cell.borrow()), c: c, metac }, _ => panic!("get on not cell"), }, PrimCombI::Cons => Cursor { f: Rc::new(Form::Pair(ps.car().unwrap(), ps.cdr().unwrap().car().unwrap())), c: c, metac }, PrimCombI::Car => Cursor { f: ps.car().unwrap().car().unwrap(), c: c, metac }, PrimCombI::Cdr => Cursor { f: ps.car().unwrap().cdr().unwrap(), c: c, metac }, PrimCombI::Quote => Cursor { f: ps.car().unwrap(), c: c, metac: metac }, PrimCombI::Assert => { let thing = ps.car().unwrap(); if !thing.truthy() { println!("Assert failed: {:?}", thing); } assert!(thing.truthy()); Cursor { f: ps.cdr().unwrap().car().unwrap(), c: Cont::Eval { e: e, nc: Box::new(c) }, metac } }, PrimCombI::Eq => Cursor { f: Rc::new(Form::Bool(ps.car().unwrap() == ps.cdr().unwrap().car().unwrap())), c, metac }, PrimCombI::Lt => Cursor { f: Rc::new(Form::Bool(ps.car().unwrap().int().unwrap() < ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::LEq => Cursor { f: Rc::new(Form::Bool(ps.car().unwrap().int().unwrap() <= ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::Gt => Cursor { f: Rc::new(Form::Bool(ps.car().unwrap().int().unwrap() > ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::GEq => Cursor { f: Rc::new(Form::Bool(ps.car().unwrap().int().unwrap() >= ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::Plus => Cursor { f: Rc::new(Form::Int(ps.car().unwrap().int().unwrap() + ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::Minus => Cursor { f: Rc::new(Form::Int(ps.car().unwrap().int().unwrap() - ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::Mult => Cursor { f: Rc::new(Form::Int(ps.car().unwrap().int().unwrap() * ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::Div => Cursor { f: Rc::new(Form::Int(ps.car().unwrap().int().unwrap() / ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::Mod => Cursor { f: Rc::new(Form::Int(ps.car().unwrap().int().unwrap() % ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::And => Cursor { f: Rc::new(Form::Int(ps.car().unwrap().int().unwrap() & ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::Or => Cursor { f: Rc::new(Form::Int(ps.car().unwrap().int().unwrap() | ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::Xor => Cursor { f: Rc::new(Form::Int(ps.car().unwrap().int().unwrap() ^ ps.cdr().unwrap().car().unwrap().int().unwrap())), c, metac }, PrimCombI::CombP => Cursor { f: Rc::new(Form::Bool(match &*ps.car().unwrap() { Form::PrimComb { eval_limit, ins } => true, Form::DeriComb { .. } => true, _ => false, })), c, metac }, PrimCombI::CellP => Cursor { f: Rc::new(Form::Bool(match &*ps.car().unwrap() { Form::Cell(_c) => true, _ => false, })), c, metac }, PrimCombI::PairP => Cursor { f: Rc::new(Form::Bool(match &*ps.car().unwrap() { Form::Pair(_a,_b) => true, _ => false, })), c, metac }, PrimCombI::SymbolP => Cursor { f: Rc::new(Form::Bool(match &*ps.car().unwrap() { Form::Symbol(_) => true, _ => false, })), c, metac }, PrimCombI::IntP => Cursor { f: Rc::new(Form::Bool(match &*ps.car().unwrap() { Form::Int(_) => true, _ => false, })), c, metac }, PrimCombI::BoolP => Cursor { f: Rc::new(Form::Bool(match &*ps.car().unwrap() { Form::Bool(_) => true, _ => false, })), c, metac }, PrimCombI::NilP => Cursor { f: Rc::new(Form::Bool(ps.car().unwrap().is_nil())), c, metac }, } } } impl fmt::Display for Form { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { match self { Form::Nil => write!(f, "nil"), Form::Int(i) => write!(f, "{i}"), Form::Bool(b) => write!(f, "{b}"), Form::Symbol(s) => write!(f, "{s}"), Form::Cell(c) => write!(f, "@{}", c.borrow()), Form::Pair(car, cdr) => { write!(f, "({}", car)?; let mut traverse: Rc = Rc::clone(cdr); loop { match &*traverse { Form::Pair(ref carp, ref cdrp) => { write!(f, " {}", carp)?; traverse = Rc::clone(cdrp); }, Form::Nil => { write!(f, ")")?; return Ok(()); }, x => { write!(f, ". {x})")?; return Ok(()); }, } } }, Form::PrimComb { eval_limit, ins } => write!(f, "<{eval_limit}> - {ins:?}"), Form::DeriComb { se, de, params, body } => { write!(f, "<{} {} {}>", de.as_ref().unwrap_or(&"".to_string()), params, body) }, Form::ContComb(_) => write!(f, ""), } } } #[derive(Debug, Eq, PartialEq)] pub enum Form { Nil, Int(i32), Bool(bool), Symbol(String), Cell(RefCell>), Pair(Rc,Rc), PrimComb { eval_limit: i32, ins: PrimCombI }, DeriComb { se: Rc, de: Option, params: String, body: Rc }, ContComb(Cont), } //#[derive(Debug, Eq, PartialEq, Clone)] #[derive(Debug, Eq, PartialEq)] pub enum Cont { Exit, MetaRet, CatchRet { nc: Box>, restore_meta: Box> }, Eval { e: Rc, nc: Box> }, Call { p: Rc, e: Rc, nc: Box> }, PramEval { eval_limit: i32, to_eval: Rc, collected: Option>, e: Rc, ins: PrimCombI, nc: Box> }, } impl Clone for Cont { fn clone(&self) -> Self { match self { Cont::Exit => Cont::Exit, Cont::MetaRet => Cont::MetaRet, Cont::CatchRet { nc, restore_meta } => Cont::CatchRet { nc: nc.clone(), restore_meta: restore_meta.clone() }, Cont::Eval { e, nc } => Cont::Eval { e: Rc::clone(e), nc: nc.clone() }, Cont::Call { p, e, nc } => Cont::Call { p: Rc::clone(p), e: Rc::clone(e), nc: nc.clone() }, Cont::PramEval { eval_limit, to_eval, collected, e, ins, nc} => Cont::PramEval { eval_limit: *eval_limit, to_eval: Rc::clone(to_eval), collected: collected.as_ref().map(|x| Rc::clone(x)), e: Rc::clone(e), ins: ins.clone(), nc: nc.clone() }, } } } pub struct Cursor { f: Rc, c: Cont, metac: Cont } pub fn eval(e: Rc, f: Rc) -> Rc { let mut cursor = Cursor:: { f, c: Cont::Eval { e, nc: Box::new(Cont::MetaRet) }, metac: Cont::Exit }; loop { let Cursor { f, c, metac } = cursor; match c { Cont::Exit => { return f; }, Cont::MetaRet => { cursor = Cursor { f: f, c: metac.clone(), metac: metac }; }, Cont::CatchRet { nc, restore_meta } => { cursor = Cursor { f: f, c: *nc, metac: *restore_meta }; }, Cont::PramEval { eval_limit, to_eval, collected, e, ins, nc } => { let next_collected = if let Some(collected) = collected { collected.append(f).unwrap() } else { F::nil() }; if eval_limit == 0 || to_eval.is_nil() { let mut traverse = to_eval; let mut next_collected = next_collected; while !traverse.is_nil() { next_collected = next_collected.append(traverse.car().unwrap()).unwrap(); traverse = traverse.cdr().unwrap(); } cursor = F::impl_prim(ins, e, next_collected, *nc, metac); } else { cursor = Cursor { f: to_eval.car().unwrap(), c: Cont::Eval { e: Rc::clone(&e), nc: Box::new(Cont::PramEval { eval_limit: eval_limit - 1, to_eval: to_eval.cdr().unwrap(), collected: Some(next_collected), e, ins, nc }) }, metac }; } }, Cont::Eval { e, nc } => { if let Some((comb, p)) = f.pair() { cursor = Cursor { f: comb, c: Cont::Eval { e: Rc::clone(&e), nc: Box::new(Cont::Call { p, e, nc }) }, metac } } else if let Some(s) = f.sym() { let mut t = Rc::clone(&e); let mut dist = 0; while s != t.car().unwrap().car().unwrap().sym().unwrap() { t = t.cdr().unwrap(); dist += 1; } cursor = Cursor { f: t.car().unwrap().cdr().unwrap(), c: *nc, metac }; } else { cursor = Cursor { f: Rc::clone(&f), c: *nc, metac }; } }, Cont::Call { p, e, nc } => { if let Some((eval_limit, ins)) = f.prim_comb() { cursor = Cursor { f: F::nil(), c: Cont::PramEval { eval_limit, to_eval: p, collected: None, e, ins, nc: nc }, metac }; } else if let Some((se, de, params, body)) = f.deri_comb() { let mut new_e = se; if let Some(de) = de { new_e = F::assoc(&de, Rc::clone(&e), new_e); } new_e = F::assoc(¶ms, p, new_e); cursor = Cursor { f: body, c: Cont::Eval { e: new_e, nc: nc }, metac }; } else if let Some(c) = f.cont_comb() { cursor = Cursor { f: p.car().unwrap(), c: Cont::Eval { e, nc: Box::new(c.clone()) }, metac: Cont::CatchRet { nc: nc, restore_meta: Box::new(metac) } }; } else { panic!("Tried to call not a Prim/DeriComb/ContComb {:?}, nc was {:?}", f, nc); } }, } } } pub fn assoc_vec(kvs: Vec<(&str, Rc)>) -> Rc { let mut to_ret = Rc::new(Form::Nil); for (k, v) in kvs { to_ret = Form::assoc(k, v, to_ret); } to_ret } #[derive(Debug, Eq, PartialEq, Clone, Copy)] pub enum PrimCombI { Eval, Vau, If, Reset, Shift, Cell, Set, Get, Cons, Car, Cdr, Quote, Assert, Eq, Lt, LEq, Gt, GEq, Plus, Minus, Mult, Div, Mod, And, Or, Xor, CombP, CellP, PairP, SymbolP, IntP, BoolP, NilP, } // Have eval?/maybe Cont?/maybe Cursor? parameterized on value type? // Parameterized on prim implementation? // Should opt impl use same prim implementation but trace values through accessors/constructors? // with some special handling of If/Vau/etc? pub fn root_env() -> Rc { assoc_vec(vec![ ("eval", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Eval })), ("vau", Rc::new(Form::PrimComb { eval_limit: 0, ins: PrimCombI::Vau })), ("if", Rc::new(Form::PrimComb { eval_limit: 1, ins: PrimCombI::If })), ("reset", Rc::new(Form::PrimComb { eval_limit: 0, ins: PrimCombI::Reset })), ("shift", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Shift })), ("cell", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Cell })), ("set", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Set })), ("get", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Get })), ("cons", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Cons })), ("car", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Car })), ("cdr", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Cdr })), ("quote", Rc::new(Form::PrimComb { eval_limit: 0, ins: PrimCombI::Quote })), ("assert", Rc::new(Form::PrimComb { eval_limit: 1, ins: PrimCombI::Assert })), ("=", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Eq })), ("<", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Lt })), ("<=", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::LEq })), (">", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Gt })), (">=", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::GEq })), ("+", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Plus })), ("-", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Minus })), ("*", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Mult })), ("/", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Div })), ("%", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Mod })), ("&", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::And })), ("|", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Or })), ("^", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Xor })), ("comb?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::CombP })), ("cell?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::CellP })), ("pair?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::PairP })), ("symbol?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::SymbolP })), ("int?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::IntP })), ("bool?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::BoolP })), ("nil?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::NilP })), ("true", Rc::new(Form::Bool(true))), ("false", Rc::new(Form::Bool(false))), ("nil", Rc::new(Form::Nil)), ]) }