momohatt / hscamlLinks
yet another toy OCaml interpreter in Haskell
☆12Updated 5 years ago
Alternatives and similar repositories for hscaml
Users that are interested in hscaml are comparing it to the libraries listed below
Sorting:
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- First class patterns and pattern matching, using type families☆18Updated 5 years ago
- Haskell library for non-deterministic pattern matching☆17Updated last week
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Template Haskell Implementation of Egison Pattern Matching☆33Updated 5 years ago
- Minimal Haskell Compiler☆63Updated 7 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- ☆84Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated 3 weeks ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- ICFP tutorial☆39Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- MixML prototype interpreter☆27Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 8 months ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- A collection of Notes on GHC☆72Updated 6 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- FEAT☆25Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The Prettiest Printer☆35Updated last year
- Session Types with Priority in Linear Haskell☆27Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 5 months ago