Ahnfelt / AlgorithmWStepByStepLinks
Type inference for ML-like languages. A port to F# of "Algorithm W Step by Step" by Martin Grabmüller.
☆10Updated 10 years ago
Alternatives and similar repositories for AlgorithmWStepByStep
Users that are interested in AlgorithmWStepByStep are comparing it to the libraries listed below
Sorting:
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- source code for the bondi programming language☆40Updated 6 years ago
- Collection of Idris snippets☆22Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- ☆21Updated 8 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- Choice operator in OCaml, providing a backtracking monad☆26Updated 3 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Coq library for handling names☆19Updated 2 years ago
- microkanren in sml☆26Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Example row-polymorphism implementations☆61Updated last year
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 2 months ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- For supporting template-based programming☆21Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 2 months ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- New version of the PML language and (classical) proof assistant☆20Updated 2 years ago
- Idris tactics for (commutative) monoids☆20Updated 5 years ago