UlfNorell / x86-agdaView external linksLinks
Inline, type safe X86-64 assembly programming in Agda
☆69Jan 3, 2019Updated 7 years ago
Alternatives and similar repositories for x86-agda
Users that are interested in x86-agda are comparing it to the libraries listed below
Sorting:
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- The theory of algebraic graphs formalised in Agda☆91Jul 15, 2018Updated 7 years ago
- Collaborative work on reversible computing☆25Oct 30, 2021Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A Haskell library for parsing, pretty-printing, and evaluating the Ninja build language.☆35Feb 6, 2018Updated 8 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Feb 5, 2020Updated 6 years ago
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Feb 21, 2016Updated 9 years ago