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.
☆22Updated 8 years ago
Alternatives and similar repositories for TAL0
Users that are interested in TAL0 are comparing it to the libraries listed below
Sorting:
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Quasi-quoting library for agda☆17Updated 6 months ago
- Formalization of type theory☆22Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Experimentation project☆16Updated 11 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated last month
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 9 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆36Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago