pigworker / LEOGLinks
being an implementation of the calculus of constructions
☆17Updated 2 years ago
Alternatives and similar repositories for LEOG
Users that are interested in LEOG are comparing it to the libraries listed below
Sorting:
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆15Updated 2 years ago
- Quasi-quoting library for agda☆18Updated last year
- 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
- a version of the 2048 game for Coq☆22Updated 2 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- my phd thesis☆26Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last week
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- Agda to C compiler☆10Updated 2 months ago
- ☆17Updated 3 years ago
- ☆11Updated 5 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Mechanizations of Type Theories☆32Updated last week
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- Research material of Erik Palmgren (1963–2019)☆21Updated 7 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- Verified NbE via gluing in Agda☆11Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A Coq development of the theory of Indexed W types with function extensionality.☆11Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- ☆21Updated 4 years ago
- antifunext☆34Updated last year
- Organize mathematical thoughts☆20Updated 2 years ago