A polarity-based construction plus a conjuring lemma yields free theorems as simple equations, implemented in a compact Haskell tool.
In: Logic in Computer Science, Proceedings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Free Theorems Simply, via Dinaturality
A polarity-based construction plus a conjuring lemma yields free theorems as simple equations, implemented in a compact Haskell tool.