dmurfet / polysemanticsLinks
Polynomial semantics of linear logic
☆13Updated 7 years ago
Alternatives and similar repositories for polysemantics
Users that are interested in polysemantics are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- ☆21Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- ☆17Updated 7 years ago
- topos programming☆31Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Updated 4 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 months ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Updated 2 months ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Hakyll support for Agda literate files☆19Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago