clf / celfLinks
☆64Updated 6 years ago
Alternatives and similar repositories for celf
Users that are interested in celf are comparing it to the libraries listed below
Sorting:
- higher order dependently typed logic programing☆173Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Work in progress☆40Updated 7 months ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆58Updated 5 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Abstracting Definitional Interpreters☆74Updated 8 years ago
- Miller/pattern unification in Agda☆68Updated 3 months ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 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 language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- The Mechanization of Standard ML☆75Updated 3 years ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- ☆29Updated 10 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆123Updated 4 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Constructive Galois connections☆36Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 10 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 nano "theorem prover".☆62Updated 6 years ago