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]
☆111Updated 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
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- A library for effects in Coq.☆66Updated 3 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 7 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Convert lambda expressions to CCC combinators☆148Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆147Updated 3 years ago
- Distributed programming language that desugars to Morte☆92Updated 2 years ago
- Library of the ##dependent distributed research support group☆114Updated last year
- Implementation of Univalence in Cubical Sets☆145Updated 9 years ago
- Categories parametrized by morphism equality, in Agda☆150Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated 11 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A simple GUI for Agda☆31Updated 9 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- A library for formalizing Haskell types and functions in Coq☆170Updated last year
- higher order dependently typed logic programing☆173Updated 6 years ago
- Programming library for Agda☆129Updated 10 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago