sstucki / system-f-agda
A formalization of the polymorphic lambda calculus extended with iso-recursive types
☆70Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for system-f-agda
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- Where my everyday research happens☆53Updated 2 months ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 7 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- ☆45Updated 5 years ago
- The Evolution of a Typechecker☆52Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- being the materials for Summer 2013's course☆110Updated last year
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆94Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆69Updated 2 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆74Updated 6 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆38Updated 2 years ago
- A TACtic library for Agda☆48Updated last month
- Unification and type inference algorithms☆123Updated 9 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Library of categories, with categorical constructions on them☆54Updated last year