john-ml / pi-calculus
Compiler for untyped π-calculus + simple C FFI
☆9Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for pi-calculus
- Prolog + SMT☆7Updated 4 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 8 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated 8 months ago
- A verified Implementation of a mini prolog☆13Updated last year
- A SKI combinators interpreter written in assembly☆17Updated 4 years ago
- Linear algebra formalization in Agda☆16Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- A simple supercompiler formally verified in Agda☆29Updated 7 years ago
- Design, play with, and analyze sequent calculus proof systems.☆13Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- A simple functional programming language.☆21Updated 3 years ago
- A simple λProlog interpreter☆20Updated 2 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆15Updated 10 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- A Henkin-style completeness proof for the modal logic S5☆13Updated 3 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- Agda to C compiler☆10Updated last year
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- NbE course @ Chalmers☆28Updated last month
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 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
- MIRROR of https://codeberg.org/catseye/Mascarpone : You are lost in a twisty maze of meta-circular interpreters, all alike.☆21Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Coq library for handling names☆18Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago