msp-strath / askLinks
being a particular fragment of Haskell, extended to a proof system
☆42Updated last week
Alternatives and similar repositories for ask
Users that are interested in ask are comparing it to the libraries listed below
Sorting:
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Eventually a practical 2-level TT-based compiler☆29Updated 3 weeks ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- ☆29Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- my phd thesis☆26Updated last year
- Extensions to cubical for categorical logic/type theory☆34Updated last week
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- ☆30Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Compiler backend for generating Scheme code☆27Updated this week
- A work-in-progress core language for Agda, in Agda☆59Updated this week
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 2 months ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- ☆51Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 4 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago