85 citations · 85 across the 2 of their papers we have counts for
2 papers
cs.PL2021
Hashing Modulo Alpha-Equivalence
Krzysztof Maziarz, Tom Ellis, Alan Lawrence +2
In many applications one wants to identify identical subtrees of a program syntax tree. This identification should ideally be robust to alpha-renaming of the program, but no existi…
cs.PL2017★ 85 cited
Linear Haskell: practical linearity in a higher-order polymorphic language
Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton +2
Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear ty…