jonsterling / JonPRL
An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: https://github.com/redprl/sml-redprl]
☆110Updated 6 years ago
Alternatives and similar repositories for JonPRL:
Users that are interested in JonPRL are comparing it to the libraries listed below
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆108Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- Convert lambda expressions to CCC combinators☆146Updated 9 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- A library for effects in Coq.☆64Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆146Updated 3 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 9 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- Distributed programming language that desugars to Morte☆92Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- ☆45Updated 5 years ago
- A language based on homotopy type theory with an interval☆85Updated 10 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- being the materials for CS410 Advanced Functional Programming in the 2014-15 session☆70Updated 9 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Implementation of Univalence in Cubical Sets☆144Updated 9 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Categories parametrized by morphism equality, in Agda☆150Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆77Updated 4 years ago
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆162Updated 4 years ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- Dependently Typed Lambda Calculus in Haskell☆114Updated 4 years ago