Ahnfelt / AlgorithmWStepByStepLinks
Type inference for ML-like languages. A port to F# of "Algorithm W Step by Step" by Martin Grabmüller.
☆11Updated 11 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☆23Updated last year
- Logic for story telling!☆34Updated 7 years ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Updated 7 years ago
- αProlog☆18Updated 2 years ago
- ☆21Updated 8 years ago
- A pure subset of Prolog, implemented in Haskell☆31Updated 12 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- miniKanren implementation of ' Declarative semantics for functional languages: compositional, extensional, and elementary' by Jeremy Siek…☆15Updated 7 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Pure Type Systems for Functional Programming☆31Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- source code for the bondi programming language☆41Updated 6 years ago
- ☆62Updated 6 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 6 months ago
- Dealing with Flags and Options☆13Updated 4 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago