Skip to content

yihozhang/Hatafun

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 

Repository files navigation

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