sweirich / trellysLinks
Automatically exported from code.google.com/p/trellys
☆47Updated 5 years ago
Alternatives and similar repositories for trellys
Users that are interested in trellys are comparing it to the libraries listed below
Sorting:
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Where my everyday research happens☆53Updated last week
- ☆84Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Web based opetopic editor☆35Updated 8 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Agda programming with holes☆27Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year