zaklogician / typical-antiphrasisView external linksLinks
Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
☆41Oct 5, 2020Updated 5 years ago
Alternatives and similar repositories for typical-antiphrasis
Users that are interested in typical-antiphrasis are comparing it to the libraries listed below
Sorting:
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- ☆18May 10, 2022Updated 3 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- Experiments with higher-order abstract syntax in Agda☆22Jul 14, 2022Updated 3 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago
- ☆21Apr 15, 2018Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated 3 weeks ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Formalization of type theory☆22Jul 5, 2021Updated 4 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- Porting of software foundations book to Agda☆39Feb 16, 2014Updated 11 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- A simple prolog implementation in Rust☆26Nov 14, 2020Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- ☆31Apr 17, 2023Updated 2 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago