sweirich / pi-forall
A demo implementation of a simple dependently-typed language
☆563Updated this week
Related projects ⓘ
Alternatives and complementary repositories for pi-forall
- Minimal implementations for dependent type checking and elaboration☆619Updated 2 months ago
- Experimental implementation of Cubical Type Theory☆572Updated last year
- Spartan type theory☆257Updated 6 months ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆243Updated last week
- The Ott tool for writing definitions of programming languages and calculi☆349Updated 2 months ago
- Compiling to Categories☆437Updated 8 months ago
- Convert Haskell source code to Coq source code☆279Updated 4 years ago
- A new Categories library for Agda☆369Updated last week
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆592Updated this week
- 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
- Examples of Dependently-typed programs in Haskell☆302Updated 2 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆369Updated last year
- Development of homotopy type theory in Agda☆416Updated 5 years ago
- Randomized Property-Based Testing Plugin for Coq☆254Updated this week
- Demo for high-performance type theory elaboration☆522Updated last year
- 15-819 (Homotopy Type Theory) Lecture Notes☆48Updated 4 years ago
- The home of the Glamorous Glambda interpreter☆219Updated 4 months ago
- Software Foundations in Idris☆452Updated 5 years ago
- Generalized bananas, lenses and barbed wire☆337Updated 5 months ago
- A course on homotopy theory and type theory, taught jointly with Jaka Smrekar☆287Updated 9 months ago
- An experimental library for Cubical Agda☆459Updated last week
- A proof assistant for general type theories☆297Updated last month
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆365Updated last year
- Haskell bindings for LLVM☆511Updated 4 months ago
- The People's Refinement Logic☆227Updated last year
- A fast, flexible, fused effect system for Haskell☆647Updated 3 months ago
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆350Updated last week
- A prototype successor to Idris☆539Updated 5 years ago
- A curated list of awesome Coq frameworks, libraries and software.☆236Updated this week
- Fake dependent types in Haskell using singletons☆287Updated 3 weeks ago