Polynomial semantics of linear logic
☆13Apr 15, 2018Updated 7 years ago
Alternatives and similar repositories for polysemantics
Users that are interested in polysemantics are comparing it to the libraries listed below
Sorting:
- [WIP] Optics via the profunctor representation theorem☆20Dec 18, 2019Updated 6 years ago
- A fork of Levy, originally by Bauer and Pretnar. The 'master' branch has some minor code fixes, more examples, and a top-level 'do' notat…☆16Mar 11, 2012Updated 14 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Oct 8, 2020Updated 5 years ago
- A Teeny Type Theory☆27Jun 4, 2022Updated 3 years ago
- An approach to higher algebra in type theory☆23May 12, 2020Updated 5 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- ☆23Aug 30, 2017Updated 8 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆21Jan 3, 2025Updated last year
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 3 months ago
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated 2 years ago
- Rose (n-way) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations.☆16May 13, 2025Updated 10 months ago
- Proof checker for propositional logic☆16Jul 7, 2017Updated 8 years ago
- Category Theory in Agda☆13Jan 16, 2018Updated 8 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- An experimental HTTP framework for Idris☆14Mar 4, 2020Updated 6 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆21Mar 9, 2026Updated last week
- Haskell port of the Tensor Algebra COmpiler☆16Nov 18, 2019Updated 6 years ago
- Idris GraphQL☆16Dec 16, 2017Updated 8 years ago
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated last month
- Compositional type checking for Haskell☆38Apr 14, 2011Updated 14 years ago
- van Laarhoven lenses for Idris☆20Sep 25, 2017Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms☆14Jul 15, 2022Updated 3 years ago
- Notes on how to use the internal language of toposes in algebraic geometry☆61Updated this week
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- A mirror of Isabelle/Scala code from the official Isabelle repository at http://isabelle.in.tum.de/repos/isabelle/. Restructured as Eclip…☆15Jul 10, 2014Updated 11 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Haskell implementation of open games☆13Apr 20, 2016Updated 9 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Apr 29, 2023Updated 2 years ago
- freer monads and cofreer comonads.☆23Jun 26, 2018Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago
- Experiments in implementing functional data structures in Idris☆15Jul 25, 2019Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆13Jul 24, 2021Updated 4 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago