mmirman / caledonLinks
higher order dependently typed logic programing
☆173Updated 7 years ago
Alternatives and similar repositories for caledon
Users that are interested in caledon are comparing it to the libraries listed below
Sorting:
- Mirror of Epigram 2, by Conor McBride, et al.☆58Updated 5 years ago
- ☆64Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Charity language interpreters and literature☆114Updated 6 years ago
- an implementation of stuck macros☆152Updated last month
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- A prolog interpreter written in Haskell.☆62Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- A less devious proof assistant☆230Updated 3 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆123Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Miller/pattern unification in Agda☆68Updated 3 months ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- The Makam Metalanguage☆199Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Updated 4 years ago
- The Mechanization of Standard ML☆75Updated 3 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 10 years ago
- An implementation of miniKanren in Haskell☆79Updated 12 years ago
- The Disco Discus Compiler☆176Updated 7 years ago
- The Prettiest Printer☆35Updated last year
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- ☆138Updated 3 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Updated 4 years ago
- ☆86Updated 8 years ago