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  5534 reads

Browse archivesActive forum topics 
Recent comments
1 hour 3 min ago
1 hour 12 min ago
1 hour 17 min ago
8 hours 32 min ago
8 hours 48 min ago
13 hours 30 min ago
16 hours 4 min ago
22 hours 15 min ago
1 day 4 hours ago
1 day 6 hours ago