Skip to content
tanvimoharirPublic

About

An attempt at implementing Hashing Modulo Alpha- Equivalence

Resources

Stars

1 star

Watchers

1 watching

Forks

Latest commit

 

History

6 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 

Repository files navigation

Efficient Hash-Consing

Students: Tanvi Ashwin Moharir

The goal of this project is to extend hashing mechanism of sharesem with a hash function that maps name-equivalent types to the same hash value. Example:

hash({X1 = true | (X1, X1)}) = hash({X2 = true | (X3, X3), X3 = true | (X3, X3)})

Resources:

Notes:

  • The recursive equation names (e.g. $X_1$) are function references in minsem and of type ty_ref() in sharesem.

Deliverables:

  • Hashsem implementation in Erlang
  • At least for the following co-inductively defined type grammar: $\tau = true | (\tau, \tau) | \tau ∪ \tau | !\tau$
  • Test cases which show-case sharing of recursive types

About

An attempt at implementing Hashing Modulo Alpha- Equivalence

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages