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
Sorting:
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ☆18Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆17Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- ☆11Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 5 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 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.☆34Updated 7 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago