clf / celf
☆59Updated 5 years ago
Alternatives and similar repositories for celf:
Users that are interested in celf 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
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Work in progress☆34Updated 4 months ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Compositional type checking for Haskell☆37Updated 13 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- Logic for story telling!☆34Updated 7 years ago
- Abstracting Definitional Interpreters☆67Updated 7 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- MetaML and MetaOCaml bibliography☆89Updated 4 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 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
- Constructive Galois connections☆32Updated 7 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago