8l / asifLinks
A Self-Interpreter for F-omega
☆16Updated 10 years ago
Alternatives and similar repositories for asif
Users that are interested in asif are comparing it to the libraries listed below
Sorting:
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Idris, but it's C☆24Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- The Alms Programming Language☆44Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- αProlog☆18Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 5 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆55Updated 5 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- 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
- a self-hosting lambda calculus compiler☆37Updated 8 months ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Standard ML compiler based on typed intermediate languages.☆50Updated 11 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago