sweirich / talLinks
An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
☆147Updated 3 years ago
Alternatives and similar repositories for tal
Users that are interested in tal are comparing it to the libraries listed below
Sorting:
- Coq formalizations of functional languages.☆144Updated 4 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 2 weeks ago
- Randomized Property-Based Testing Plugin for Coq☆264Updated last week
- A library for formalizing Haskell types and functions in Coq☆170Updated last year
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A library for effects in Coq.☆65Updated 3 years ago
- Programming library for Agda☆128Updated 9 months ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Convert Haskell source code to Coq source code☆281Updated 4 years ago
- Library of the ##dependent distributed research support group☆113Updated 10 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆209Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- A proof assistant for general type theories☆303Updated 7 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆98Updated 7 months ago
- The People's Refinement Logic☆229Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- SPLV20 course notes☆108Updated 2 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆152Updated 2 months ago
- ☆84Updated 7 years ago
- Benchmarks for capture-avoiding substitution☆114Updated this week
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆115Updated 4 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated 11 months ago