User loginNavigation 
An impure solution to the problem of matching fansSome time ago, I found an impure solution to the problem of matching fans in Lamping's abstract algorithm. It is described in [1] and implemented in [2], the essential part of source code being available in [3]. My understanding is that the algorithm effectively eliminates the need in bookkeeping nodes (socalled "oracle") for optimal reduction in case of arbitrary untyped λterms. Although I have no formal proof for its correctness yet, the amount of testing [4, 5] that have already been done leaves little room for counterexamples. Questions remaining open are: how to (dis)prove correctness of the algorithm as well as how to simplify and improve the algorithm? Any help would be highly appreciated. [1] https://arxiv.org/abs/1710.07516 By Anton Salikhmetov at 20180101 17:08  LtU Forum  previous forum topic  next forum topic  other blogs  3415 reads

Browse archivesActive forum topics 
Recent comments
16 min 13 sec ago
2 hours 24 min ago
9 hours 39 min ago
14 hours 38 min ago
14 hours 49 min ago
16 hours 54 min ago
23 hours 45 min ago
1 day 1 hour ago
1 day 4 hours ago
1 day 4 hours ago