jonsterling / JonPRLLinks
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
Sorting:
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Updated 8 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 10 years ago
- Convert lambda expressions to CCC combinators☆149Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Updated 4 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Categories parametrized by morphism equality, in Agda☆152Updated 6 years ago
- The People's Refinement Logic☆229Updated 3 years ago
- The Disco Discus Compiler☆176Updated 6 years ago
- Distributed programming language that desugars to Morte☆92Updated 3 years ago
- A language based on homotopy type theory with an interval☆84Updated 10 years ago
- A library for effects in Coq.☆65Updated 3 years ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- second-order abstract syntax☆31Updated 4 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- ☆45Updated 6 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Library of the ##dependent distributed research support group☆118Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last year
- Simplified Observational Type Theory☆87Updated 2 years ago
- Programming library for Agda☆134Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- A simple GUI for Agda☆31Updated 10 years ago