8l / asif
A Self-Interpreter for F-omega
☆16Updated 9 years ago
Alternatives and similar repositories for asif:
Users that are interested in asif are comparing it to the libraries listed below
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 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
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Idris, but it's C☆24Updated 6 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 5 months ago
- The Alms Programming Language☆44Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Linear map categories in Agda☆5Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Used libraries: llvm-general, llvm-general-pure - 3.4.2-1; llvm version: 3.4.2-1; Based on http://www.stephendiehl.com/llvm/ solution.☆7Updated 9 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆15Updated 6 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago