emarzion / SystemTLinks
An interpreter for Gödel's System T
☆12Updated 8 years ago
Alternatives and similar repositories for SystemT
Users that are interested in SystemT are comparing it to the libraries listed below
Sorting:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Where my everyday research happens☆54Updated last month
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ☆45Updated 6 years ago
- Haskell geometry library☆17Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 3 months ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- Library of categories, with categorical constructions on them☆57Updated last year
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆14Updated 7 years ago
- rewrite rules for type-level equalities☆62Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Functions and newtype wrappers for traversing Trees☆30Updated 10 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆74Updated 2 months ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- being the materials for Summer 2013's course☆112Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated 9 months ago