JoeyEremondi / pl-lt-rules
Rules for writing academic papers and checking them using LTex-ls and LanguageTool
☆19Updated last month
Alternatives and similar repositories for pl-lt-rules:
Users that are interested in pl-lt-rules are comparing it to the libraries listed below
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆29Updated 8 months ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated last month
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- ☆29Updated 2 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Organize mathematical thoughts☆20Updated last year
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- A formalization of System Fω in Agda☆17Updated 2 months ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- my phd thesis☆26Updated 8 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
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆9Updated last week
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A reflection-based proof tactic for lattices in Coq☆21Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 4 months ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 4 months ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago