ankitku / TAL0Links
Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
☆23Updated 9 years ago
Alternatives and similar repositories for TAL0
Users that are interested in TAL0 are comparing it to the libraries listed below
Sorting:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Quasi-quoting library for agda☆18Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- ☆17Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- ☆18Updated 3 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Graded Dependent Type systems☆25Updated 2 years ago