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
- System F in coq.☆19Updated 10 years ago
- Collection of Idris snippets☆21Updated last year
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Educational implementation of dependent types☆19Updated 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
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆21Updated 7 years ago
- An experiment at expressing functors in F# the .NET type system.☆17Updated 11 years ago
- source code for the bondi programming language☆40Updated 6 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Signature documentation tool for Standard ML☆14Updated last year
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A discouraging story.☆15Updated 6 years ago
- Logic for story telling!☆34Updated 7 years ago
- Decision procedures for Presburger arithmetic in Haskell☆29Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- machine fusion☆16Updated 6 years ago
- Idris tactics for (commutative) monoids☆20Updated 4 years ago
- ☆26Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Choice operator in OCaml, providing a backtracking monad☆25Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago