uds-psl / autosubst-ocamlLinks
☆16Updated 4 months ago
Alternatives and similar repositories for autosubst-ocaml
Users that are interested in autosubst-ocaml are comparing it to the libraries listed below
Sorting:
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆15Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Quasi-quoting library for agda☆18Updated 10 months ago
- Mechanizations of Type Theories☆32Updated 2 months ago
- a version of the 2048 game for Coq☆22Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 2 weeks ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- Verified NbE via gluing in Agda☆11Updated last year
- Research material of Erik Palmgren (1963–2019)☆21Updated 6 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last week
- Finite sets and maps for Coq with extensional equality☆30Updated 4 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- my phd thesis☆26Updated last year
- ☆11Updated 5 years ago
- ☆17Updated 3 years ago
- proof script associated to tutorial material☆17Updated last year
- ☆21Updated 4 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆20Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- ☆30Updated 2 years ago
- A style guide for Coq☆18Updated 3 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago