My department currently has a course on "Functional Programming" using Haskell. The goal of this little project is to take the Haskell code and reimplement it in a dependently typed language (for now Agda, but I want to try Idris as well) to, for example, encode invariants directly. Hopefully, we can then use the material in the upcomming term to impress students with these wonderful languages.
-
Notifications
You must be signed in to change notification settings - Fork 0
ichistmeinname/DTDatastructures
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Reimplementations of functional data structures (mostly as presented by Okasaki) in a dependently typed language
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published