noamz / linlamLinks
a library for experimental linear lambda calculus
☆20Updated 2 years ago
Alternatives and similar repositories for linlam
Users that are interested in linlam are comparing it to the libraries listed below
Sorting:
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being a particular fragment of Haskell, extended to a proof system☆34Updated 3 weeks ago
- Revised Omega-categorical Typechecker☆27Updated 9 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- ☆29Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- ☆16Updated 3 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Where my everyday research happens☆55Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- NbE course @ Chalmers☆28Updated 11 months ago
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆21Updated last week
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated last week