clf / celf
☆59Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for celf
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆69Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Work in progress☆34Updated 3 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 10 months ago
- An idris backend compiling to chez scheme☆47Updated 7 years ago
- Logic for story telling!☆32Updated 6 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- The Prettiest Printer☆35Updated 8 months ago
- Abstracting Definitional Interpreters☆67Updated 6 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 3 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 8 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- ☆82Updated 7 years ago
- Web based opetopic editor☆34Updated 2 weeks ago