mmirman / caledonLinks
higher order dependently typed logic programing
☆174Updated 7 years ago
Alternatives and similar repositories for caledon
Users that are interested in caledon are comparing it to the libraries listed below
Sorting:
- ☆62Updated 6 years ago
- 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
- Miller/pattern unification in Agda☆68Updated 11 years ago
- Charity language interpreters and literature☆114Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆50Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A less devious proof assistant☆226Updated 2 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆149Updated 4 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- an implementation of stuck macros☆145Updated last week
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- A prolog interpreter written in Haskell.☆62Updated 10 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆138Updated 3 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago