Deciding equivalence with sums and the empty type — mentioned by Kutta

Fri, 15 Sep 2017 07:40:26 GMT

Unfortunately, beta-eta reduction on Church-coded terms (as in Morte) is much weaker than what is commonly understood as supercompilation, and it is false that "no matter how many layers of indirection you might add the binary size and runtime performance would be unaffected". This kind of statement can only theoretically hold for something like simple type theory with strong finite products and coproducts, for which (quasi) normalization has been recently shown in https://arxiv.org/abs/1610.01213

Paper and discussion history. A mention is not an endorsement.

Deciding equivalence with sums and the empty type · HackerPapers discussions

Deciding equivalence with sums and the empty type — mentioned by Kutta