coq-community / fav-ssr
Functional Algorithms Verified in SSReflect [maintainer=@clayrat]
☆45Updated 2 weeks ago
Alternatives and similar repositories for fav-ssr:
Users that are interested in fav-ssr are comparing it to the libraries listed below
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆43Updated 2 years ago
- A course on formal verification at https://compsciclub.ru/en, Spring term 2021☆57Updated last year
- Proof theory seminar☆32Updated 3 years ago
- Facilities for generating dependently-typed data☆24Updated this week
- Coq Lecture Notes (WIP)☆51Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- Experiments with sequent calculi☆26Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- ☆47Updated last month
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated 3 months ago
- A tutorial on how Agda infers things☆38Updated 4 years ago
- Refinement types + dependent types = ❤️☆58Updated 2 years ago
- A core language and API for dependently typed languages☆89Updated last year
- A repository for the material of my course on lambda-calculus and categories☆41Updated 4 years ago
- Материалы и задания по курсу "Программирование с зависимыми типами" 2018 года☆15Updated 6 years ago
- Learn the Agda basics in three 2-hour sessions.☆57Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 3 months ago
- A library for doing generic programming in Agda☆31Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆108Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆44Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆56Updated 7 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆69Updated 3 years ago
- Simple theorem prover for the tope layer of Riehl and Shulman type theory with shapes.☆17Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆96Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆79Updated last month
- high-performance cubical evaluation☆69Updated last month