sweirich / trellysLinks
Automatically exported from code.google.com/p/trellys
☆47Updated 6 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 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Web based opetopic editor☆35Updated 8 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 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
- being bits and pieces I'm inclined to leave lying around☆52Updated last week
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Work in progress☆37Updated last month
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 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
- The Evolution of a Typechecker☆54Updated 6 years ago
- Where my everyday research happens☆53Updated last month
- A simple GUI for Agda☆31Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- System F in coq.☆19Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- ☆45Updated 6 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- ☆26Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year