logo
首页技术栈工具库讨论
graph-rewriting-ww

graph-rewriting-ww

Evaluate a given λ-term (letrecs may be used) interactively. It uses duplicators to explicitly render fully-lazy sharing according to Wadsworth's approach. The reduction rules are split into two groups, safe rules and unsafe rules, which implement the procedure for unsharing the MFE under one duplicator.
由 
bruceshi2021-01-13 收录
--
推荐
不推荐
更多信息
HACKAGE
carbal install graph-rewriting-ww
查看
标签
根据用户添加的标签生成
暂无标签