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 small implementation of a proof refinement logic.☆50Updated 8 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 10 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Updated 4 years ago
- The Disco Discus Compiler☆176Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Library of the ##dependent distributed research support group☆117Updated last year
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- The People's Refinement Logic☆228Updated 2 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- Distributed programming language that desugars to Morte☆92Updated 3 years ago
- Convert lambda expressions to CCC combinators☆149Updated 9 years ago
- A language based on homotopy type theory with an interval☆84Updated 10 years ago
- a theorem prover for intuitionistic propositional logic in Idris, with metaprogramming features☆121Updated 7 years ago
- A library for effects in Coq.☆65Updated 3 years ago
- second-order abstract syntax☆31Updated 4 years ago
- LINear LaNGuage: Type Theory and Process Calculi for Distributed and High-precision programming☆108Updated 2 years ago
- Categories parametrized by morphism equality, in Agda☆152Updated 6 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆79Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year