jsiek / gradual-typing-in-agdaLinks
Formalizations of Gradually Typed Languages in Agda
☆57Updated 7 months ago
Alternatives and similar repositories for gradual-typing-in-agda
Users that are interested in gradual-typing-in-agda are comparing it to the libraries listed below
Sorting:
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- An interactive theorem prover based on lambda-tree syntax☆96Updated 4 months ago
- ☆36Updated 3 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- ☆55Updated this week
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆66Updated last week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- Denotational semantics based on graph and filter models☆23Updated 9 months ago
- The Penn Locally Nameless Metatheory Library☆75Updated 6 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A Coq library for parametric coinduction☆50Updated 8 months ago
- A TACtic library for Agda☆49Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 6 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 2 months ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- high-performance cubical evaluation☆75Updated 5 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- A proof of Abel-Ruffini theorem.☆30Updated 3 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 10 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago