Ahnfelt / AlgorithmWStepByStep
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:
- Collection of Idris snippets☆21Updated last year
- System F in coq.☆19Updated 10 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆21Updated 8 years ago
- A discouraging story.☆15Updated 7 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- machine fusion☆16Updated 6 years ago
- A bare-bones LCF-style proof assistant☆23Updated 5 years ago
- An experiment at expressing functors in F# the .NET type system.☆17Updated 11 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A tiny statically typed programming language☆18Updated 10 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 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
- Logic for story telling!☆34Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- microkanren in sml☆26Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- The Prettiest Printer☆34Updated last year
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Decision procedures for Presburger arithmetic in Haskell☆29Updated last month
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆27Updated last year
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- Idris-written, correct-by-construction, simply-typed lambda calculus.☆39Updated 6 years ago