Andromedans / andromeda
A proof assistant for general type theories
☆298Updated 3 months ago
Alternatives and similar repositories for andromeda:
Users that are interested in andromeda are comparing it to the libraries listed below
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- The People's Refinement Logic☆228Updated 2 years ago
- Convert Haskell source code to Coq source code☆279Updated 4 years ago
- Implementation of the λΠ-calculus modulo rewriting☆200Updated 2 months ago
- Lecture notes on univalent foundations of mathematics with Agda☆221Updated 9 months ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆112Updated last week
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆370Updated last year
- Spartan type theory☆261Updated 7 months ago
- A function definition package for Coq☆226Updated last month
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆145Updated 3 years ago
- A small implementation of higher-order unification☆184Updated 7 years ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆163Updated 2 months ago
- 😎TT☆221Updated last year
- Programming library for Agda☆125Updated 4 months ago
- Coq formalizations of functional languages.☆142Updated 4 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- Randomized Property-Based Testing Plugin for Coq☆260Updated this week
- The Makam Metalanguage☆196Updated last year
- Proof assistant based on the λΠ-calculus modulo rewriting☆291Updated this week
- Fake dependent types in Haskell using singletons☆288Updated this week
- Total Parser Combinators in Agda☆125Updated last year
- Parser combinators for Idris☆240Updated 5 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆51Updated 4 years ago
- Embeddable Lambda Prolog Interpreter☆296Updated this week
- The LLVM LHC Haskell Optimization System☆198Updated 4 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 7 months ago
- A less devious proof assistant☆222Updated last year
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week