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 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for JonPRL
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 8 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- Hopefully verifiable code generation in GHC☆95Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- ☆45Updated 5 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆143Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Distributed programming language that desugars to Morte☆91Updated 2 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- Library of the ##dependent distributed research support group☆110Updated 4 months ago
- The Disco Discus Compiler☆174Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- The People's Refinement Logic☆227Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Convert lambda expressions to CCC combinators☆146Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Coq formalizations of functional languages.☆141Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Web based opetopic editor☆34Updated last month
- being the materials for CS410 Advanced Functional Programming in the 2014-15 session☆68Updated 9 years ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- Implementation of Univalence in Cubical Sets☆145Updated 9 years ago
- SPLV20 course notes☆106Updated 2 years ago