decrn / tilogicsLinks
Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.
☆10Updated 11 months ago
Alternatives and similar repositories for tilogics
Users that are interested in tilogics are comparing it to the libraries listed below
Sorting:
- Quasi-quoting library for agda☆17Updated 8 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- my phd thesis☆26Updated last year
- ☆16Updated last month
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- ☆17Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- ☆17Updated 3 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- ☆18Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- https://metaborg.github.io/mj.agda/☆13Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A style guide for Coq☆18Updated 3 years ago
- ☆16Updated 3 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- ☆21Updated 3 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago