haskell-implementations / hugs
Haskell User's Gofer System
☆25Updated 9 years ago
Alternatives and similar repositories for hugs:
Users that are interested in hugs are comparing it to the libraries listed below
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 5 months ago
- A talk☆28Updated 4 years ago
- The Iowa Agda Library☆47Updated 4 months ago
- xmonad in Coq☆45Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Jhc: Haskell Compiler☆37Updated 9 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Invertible parsing for S-expressions☆34Updated 3 weeks ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Fast parser combinator library for Haskell with two strategies (Fast acceptor and slower reporter with decent error messages)☆59Updated 4 years ago
- Automatic piecewise-mutable references for your types☆42Updated 4 years ago
- ☆30Updated 6 years ago
- Pre-processor for .hsc files☆41Updated last month
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆38Updated 10 months ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- An efficient graph library for Haskell☆39Updated 8 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Tiny type-checker with dependent types☆77Updated 11 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 5 years ago
- a self-hosting lambda calculus compiler☆35Updated 3 weeks ago
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21Updated 2 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆57Updated 11 months ago
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆25Updated 11 years ago
- Lecture notes for teaching Haskell to those who want to read it☆55Updated 2 years ago
- My Own Linear Lisp☆40Updated 6 years ago
- apkg - package manager for Agda☆37Updated 3 years ago