JoeyEremondi / pl-lt-rules
Rules for writing academic papers and checking them using LTex-ls and LanguageTool
☆18Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for pl-lt-rules
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Organize mathematical thoughts☆19Updated last year
- Generalized syntax & semantics for universe hierarchies☆28Updated 10 months ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 weeks ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A type theory with native support for Polynomial Functors.☆38Updated last year
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated this week
- Session types in Idris2!☆27Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆20Updated this week
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆25Updated this week
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- a version of the 2048 game for Coq☆22Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- ☆13Updated last year
- my phd thesis☆26Updated 3 months ago
- being an implementation of the calculus of constructions☆15Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- ☆28Updated 2 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 8 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆23Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 7 months ago
- ☆35Updated 3 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 6 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 4 months ago