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 8 years ago
Alternatives and similar repositories for TAL0
Users that are interested in TAL0 are comparing it to the libraries listed below
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Graded Dependent Type systems☆25Updated 2 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Quasi-quoting library for agda☆18Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months 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
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Constructive Galois connections☆36Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago