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☆76Updated 2 weeks ago
- ☆36Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- HoTT in Lean 3☆80Updated 5 years ago
- # A simple variable binding library based on well-scoped indices and environments☆17Updated 3 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Denotational semantics based on graph and filter models☆23Updated 8 months ago
- ☆55Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated 11 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 5 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A Coq library for parametric coinduction☆50Updated 7 months ago
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆53Updated last month
- A TACtic library for Agda☆49Updated 11 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 weeks ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A cost-aware logical framework, embedded in Agda.☆66Updated this week
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Monadic effects and equational reasoning in Rocq☆72Updated last month
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago