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.
☆22Updated 8 years ago
Alternatives and similar repositories for TAL0:
Users that are interested in TAL0 are comparing it to the libraries listed below
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆36Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- IO using sized types and copatterns☆33Updated 4 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 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 3 weeks ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A verified compiler for a lazy functional language☆34Updated 2 weeks ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 7 years ago
- Experimentation project☆16Updated 11 years ago
- Quasi-quoting library for agda☆17Updated 4 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Mtac in Agda☆28Updated 3 years ago
- An enhanced unification algorithm for Coq☆55Updated this week
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago