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 6 years ago
Alternatives and similar repositories for JonPRL:
Users that are interested in JonPRL are comparing it to the libraries listed below
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆108Updated 7 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 9 years ago
- Distributed programming language that desugars to Morte☆91Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- Convert lambda expressions to CCC combinators☆146Updated 8 years ago
- Coq formalizations of functional languages.☆142Updated 4 years ago
- A library for effects in Coq.☆64Updated 2 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- ☆45Updated 5 years ago
- A language based on homotopy type theory with an interval☆84Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆146Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- ☆84Updated 7 years ago
- Web based opetopic editor☆35Updated 4 months ago
- Implementation of Univalence in Cubical Sets☆144Updated 9 years ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- Unification and type inference algorithms☆124Updated 10 years ago
- Categories parametrized by morphism equality, in Agda☆149Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Work in progress☆34Updated 2 months ago
- Type provider library for Idris☆94Updated 7 years ago