sweirich / trellys
Automatically exported from code.google.com/p/trellys
☆46Updated 5 years ago
Alternatives and similar repositories for trellys:
Users that are interested in trellys are comparing it to the libraries listed below
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Work in progress☆34Updated 3 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- being the materials for Summer 2013's course☆112Updated last year
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- ☆84Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The Prettiest Printer☆35Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Web based opetopic editor☆35Updated 4 months ago