BekaValentine / SimpleFPLinks
A series of implementations of a simple functional programming language.
☆30Updated 9 years ago
Alternatives and similar repositories for SimpleFP
Users that are interested in SimpleFP are comparing it to the libraries listed below
Sorting:
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Epic - a Supercombinator Compiler☆65Updated 10 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- The Alms Programming Language☆44Updated 6 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- Type provider library for Idris☆94Updated 7 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated last month
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 6 years ago
- second-order abstract syntax☆31Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆26Updated 8 years ago
- A prolog interpreter written in Haskell.☆62Updated 10 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- The Spire Programming Language☆59Updated 10 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Link to preprints for POPL'18 and colocated events☆87Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago