8l / asif
A Self-Interpreter for F-omega
☆16Updated 8 years ago
Related projects: ⓘ
- A small NuPRL style proof assistant☆32Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- The Alms Programming Language☆43Updated 6 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆11Updated 6 years ago
- Idris, but it's C☆24Updated 6 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Interpreter for Joy in Haskell using extensible-effects☆34Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- ☆14Updated this week
- Mirror of Conor McBride’s 2011 Agda course materials☆10Updated 5 years ago
- Experimentation project☆16Updated 10 years ago
- Austin's supercompiler work☆21Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- a parallel, safe, iterative list operation language for systems programming☆16Updated 4 years ago
- An Assembly-like programming language and interpreter in Haskell☆16Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 3 years ago
- Pure relational SKI combinator calculus interpreter.☆10Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- ☆28Updated 9 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- ☆11Updated 9 years ago