FrozenWinters / stlcLinks
This aims to be the most pretentious implementation of stlc in existence
☆65Updated 3 years ago
Alternatives and similar repositories for stlc
Users that are interested in stlc are comparing it to the libraries listed below
Sorting:
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
- Mechanizations of Type Theories☆32Updated last week
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- A tutorial on how Agda infers things☆63Updated 4 months ago
- Lecture notes on realizability☆74Updated 8 months ago
- ☆45Updated 7 months ago
- antifunext☆34Updated last year
- ☆25Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆67Updated this week
- A work-in-progress core language for Agda, in Agda☆59Updated this week
- high-performance cubical evaluation☆75Updated 6 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 3 months ago
- ☆30Updated 2 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- ☆51Updated 2 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last month
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- A TACtic library for Agda☆50Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago