effectfully / inference-in-agdaLinks
A tutorial on how Agda infers things
☆63Updated 5 months ago
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☆121Updated 6 months ago
- A work-in-progress core language for Agda, in Agda☆61Updated this week
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆53Updated 4 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- ☆51Updated 4 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Lecture notes on realizability☆75Updated 10 months ago
- A TACtic library for Agda☆50Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- high-performance cubical evaluation☆76Updated 7 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- Demo for dependent types + runtime code generation☆72Updated 10 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆59Updated last week
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Eventually a practical 2-level TT-based compiler☆29Updated last week
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- antifunext☆34Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 weeks ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago