fortlang / fortLinks
Compiler for the fort programming language
☆14Updated last week
Alternatives and similar repositories for fort
Users that are interested in fort are comparing it to the libraries listed below
Sorting:
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- Linearizability Hoare Logic☆14Updated 3 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- File format and optimizer for programs encoded in binary lambda calculus☆15Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- a self-hosting lambda calculus compiler☆35Updated 3 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A toy dependent typed language.☆30Updated this week
- Experiments with Cubical Agda☆11Updated last month
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A 65C02 Assembly eDSL in Haskell☆16Updated 7 years ago
- SKI combinators☆55Updated 8 years ago
- Journey to the Center of the Lambda Calculus☆14Updated last year
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Haskell to brainfuck compiler☆30Updated 11 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A general-purpose language inspired by Scheme and Rust and Haskell and ML and cetera☆21Updated 3 years ago
- A sudoku game where you have to prove that your deductions are valid☆114Updated 2 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- Label dependent dependent session types☆16Updated last year
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- ☆90Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆73Updated 8 years ago