sweirich / pi-forall
A demo implementation of a simple dependently-typed language
☆591Updated 4 months ago
Alternatives and similar repositories for pi-forall:
Users that are interested in pi-forall are comparing it to the libraries listed below
- Minimal implementations for dependent type checking and elaboration☆656Updated 2 months ago
- Experimental implementation of Cubical Type Theory☆579Updated last year
- Examples of Dependently-typed programs in Haskell☆304Updated 2 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆609Updated last week
- The Ott tool for writing definitions of programming languages and calculi☆369Updated 3 months ago
- Demo for high-performance type theory elaboration☆541Updated last year
- A new Categories library for Agda☆377Updated 2 weeks ago
- Spartan type theory☆262Updated 10 months ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆253Updated last week
- Software Foundations in Idris☆454Updated 5 years ago
- Development of homotopy type theory in Agda☆424Updated 6 years ago
- being the lecture materials and exercises for the 2017/18 session of CS410 Advanced Functional Programming at the University of Strathcly…☆263Updated 6 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆53Updated 4 years ago
- Generalized bananas, lenses and barbed wire☆345Updated 4 months ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆376Updated last year
- Classic Algorithm W for type inference.☆253Updated 15 years ago
- Convert Haskell source code to Coq source code☆280Updated 4 years ago
- A course on homotopy theory and type theory, taught jointly with Jaka Smrekar☆290Updated last year
- Compiling to Categories☆448Updated last year
- Randomized Property-Based Testing Plugin for Coq☆263Updated 2 weeks ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,038Updated last year
- Fake dependent types in Haskell using singletons☆290Updated last month
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆366Updated this week
- A bare-bones calculus-of-constructions☆377Updated 2 years ago
- Functional programming with fewer indirections☆759Updated 4 years ago
- An introductory course to Homotopy Type Theory☆365Updated 4 years ago
- A prototype successor to Idris☆540Updated 5 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆370Updated last year
- A fast, flexible, fused effect system for Haskell☆654Updated 3 months ago