Skip to content

yihozhang/Hatafun

master
Switch branches/tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
 
 
 
 

Datafun

This is an implementation of Datafun in Haskell with high-order abstract syntax (HOAS) and tagless-final. In particular, the monotonic type system presented in the original paper is embedded into Haskell. For techniques behind, see the references.

Examples

There are three tiny examples that are currently included: computing transitive closures for finite semilattices, computing transitive closures for infinite semilattices with an upper bound, and CKY parsing algorithm for Context-Free Grammars.

References

About

Embedded Datafun in Haskell

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published