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
- The Evolution of a Typechecker☆54Updated 6 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- Work in progress☆34Updated 2 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Web based opetopic editor☆35Updated 3 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- The Prettiest Printer☆35Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆48Updated 2 months ago
- being the beginnings of at least zero typecheckers☆32Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 10 months ago
- ☆84Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- 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
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Inline, type safe X86-64 assembly programming in Agda☆67Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being the materials for Summer 2013's course☆112Updated last year