mietek / epigram2Links
Mirror of Epigram 2, by Conor McBride, et al.
☆57Updated 5 years ago
Alternatives and similar repositories for epigram2
Users that are interested in epigram2 are comparing it to the libraries listed below
Sorting:
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- The Mechanization of Standard ML☆74Updated 3 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated 2 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- ☆62Updated 6 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Specification of the Cedille Core language☆34Updated 5 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- ☆85Updated 8 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated this week
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago