effectfully / inference-in-agdaLinks
A tutorial on how Agda infers things
☆58Updated this week
Alternatives and similar repositories for inference-in-agda
Users that are interested in inference-in-agda are comparing it to the libraries listed below
Sorting:
- Benchmarks for capture-avoiding substitution☆119Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- A work-in-progress core language for Agda, in Agda☆53Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Lecture notes on realizability☆74Updated 4 months ago
- A TACtic library for Agda☆48Updated 9 months ago
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- ☆48Updated last month
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 8 months ago
- Paper and talk☆54Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- high-performance cubical evaluation☆74Updated 2 months ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago