RedPRL / sml-final-pretty-printerLinks
A Standard ML port of Christiansen, Darais and Ma's Final Pretty Printer
☆11Updated 7 years ago
Alternatives and similar repositories for sml-final-pretty-printer
Users that are interested in sml-final-pretty-printer are comparing it to the libraries listed below
Sorting:
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 2 months ago
- Session types in Idris2!☆27Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- ☆17Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- Specification of Agda.☆25Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆12Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- OCaml backend for Agda☆40Updated 6 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 weeks ago
- Mechanizing Types and Programming Languages using Beluga☆18Updated 5 years ago