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:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Quasi-quoting library for agda☆17Updated 7 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 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☆24Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 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 normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 11 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- ☆18Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago