ankitku / TAL0
Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
☆21Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for TAL0
- A certified semantics for relational programming workout.☆25Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Experimentation project☆16Updated 10 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 10 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 7 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- ☆35Updated 3 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated last month
- a version of the 2048 game for Coq☆22Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 8 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 weeks ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago