ayberkt / sml-system-t
SML implementation of System T from PFPL.
☆11Updated 7 years ago
Alternatives and similar repositories for sml-system-t:
Users that are interested in sml-system-t are comparing it to the libraries listed below
- ☆11Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- ☆18Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- ☆17Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago