jsiek / gradual-typing-in-agdaLinks
Formalizations of Gradually Typed Languages in Agda
☆59Updated this week
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☆79Updated 3 months ago
- ☆36Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- An interactive theorem prover based on lambda-tree syntax☆97Updated last week
- An enhanced unification algorithm for Coq☆58Updated this week
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years 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 11 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 8 months ago
- HoTT in Lean 3☆82Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- ☆56Updated last month
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- A cost-aware logical framework, embedded in Agda.☆68Updated 3 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated this week
- A Coq library for parametric coinduction☆51Updated 10 months ago
- Lecture notes on realizability☆75Updated 9 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 8 months ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 4 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago