23/06/2021

Hashing Modulo Alpha-Equivalence

Krzysztof Maziarz, Tom Ellis, Alan Lawrence, Andrew Fitzgibbon, Simon Peyton Jones

Keywords: hashing, abstract syntax tree, equivalence

Abstract Paper Code Similar Papers

Abstract: 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 existing technique has been shown to achieve this with good efficiency (better than O(n2) in expression size). We present a new, asymptotically efficient way to hash modulo alpha-equivalence. A key insight of our method is to use a weak (commutative) hash combiner at exactly one point in the construction, which admits an algorithm with O(n (logn)2) time complexity. We prove that the use of the commutative combiner nevertheless yields a strong hash with low collision probability. Numerical benchmarks attest to the asymptotic behaviour of the method.

The video of this talk cannot be embedded. You can watch it here:
https://slideslive.com/38956313
(Link will open in new window)
 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at PLDI 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 11:39 
 0
 0
 0
 0
 3:00 
 0
 0
 0
 0
 11:26 
 0
 0
 0
 0
 22:38 
 0
 0
 0
 0
 14:20 
 0
 0
 0
 0
 3:20 
 0
 0
 0
 0
 1:01 
 0
 0
 0
 0
 14:50 
 0
 0
 0
 0
 22:18 
 0
 0
 0
 0
 5:25 
 0
 0
 0
 0
 15:09 
 0
 0
 0
 0
 3:07 
 0
 0
 0
 0
 16:00 
 0
 0
 0
 0
 12:23 
 0
 0
 0
 0
 19:40 
 0
 0
 0
 0
 28:16 
 0
 0
 0
 0
 3:50 
 0
 0
 0
 0
 11:55 
 0
 0
 0
 0
 23:25 
 0
 0
 0
 0
 1:00 
 0
 0
 0
 0
 15:12 
 0
 0
 0
 0
 5:09 
 0
 0
 0
 0
 16:26 
 0
 0
 0
 0
 20:19 
 0
 0
 0
 0
 20:56 
 0
 0
 0
 0
 13:14 
 0
 0
 0
 0
 13:42 
 0
 0
 0
 0
 14:43 
 0
 0
 0
 0
 21:21 
 0
 0
 0
 0
 12:04 
 0
 0
 0
 0
 14:31 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 14:33 
 0
 0
 0
 0
 5:16 
 0
 0
 0
 0
 15:04 
 0
 0
 0
 0
 14:26 
 0
 0
 0
 0
 5:11 
 0
 0
 0
 0
 6:38 
 0
 0
 0
 0
 13:50 
 0
 0
 0
 0
 3:23