mmirman / caledon
higher order dependently typed logic programing
☆170Updated 6 years ago
Alternatives and similar repositories for caledon:
Users that are interested in caledon are comparing it to the libraries listed below
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 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
- A pure Haskell implementation of Datalog☆104Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A SuperCompiler for Martin-Löf's Type Theory☆120Updated 3 years ago
- ☆59Updated 5 years ago
- A less devious proof assistant☆223Updated 2 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- A prolog interpreter written in Haskell.☆62Updated 9 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Statically typed embedding of miniKanren relational programming language into OCaml☆116Updated last month
- The Disco Discus Compiler☆174Updated 6 years ago
- An implementation of miniKanren in Haskell☆78Updated 11 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- ☆84Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- The Mechanization of Standard ML☆72Updated 2 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- Pure Type Systems for Functional Programming☆31Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- ECMAScript back end for Functional Reactive Programming in Agda☆104Updated 7 years ago