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
- Convert lambda expressions to CCC combinators☆149Updated 9 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆149Updated 3 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- second-order abstract syntax☆31Updated 3 years ago
- Categories parametrized by morphism equality, in Agda☆151Updated 6 years ago
- Distributed programming language that desugars to Morte☆92Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- higher order dependently typed logic programing☆174Updated 7 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- The People's Refinement Logic☆228Updated 2 years ago
- ☆45Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- A library for effects in Coq.☆66Updated 3 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- LINear LaNGuage: Type Theory and Process Calculi for Distributed and High-precision programming☆107Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Coq formalizations of functional languages.☆145Updated 5 years ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- Charity language interpreters and literature☆114Updated 6 years ago
- Programming library for Agda☆130Updated last year
- Library of the ##dependent distributed research support group☆116Updated last year