JoeyEremondi / pl-lt-rulesLinks
Rules for writing academic papers and checking them using LTex-ls and LanguageTool
☆19Updated 4 months ago
Alternatives and similar repositories for pl-lt-rules
Users that are interested in pl-lt-rules are comparing it to the libraries listed below
Sorting:
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 4 months ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated 10 months ago
- A formalization of System Fω in Agda☆17Updated 4 months ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Organize mathematical thoughts☆20Updated last year
- being a particular fragment of Haskell, extended to a proof system☆32Updated 3 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- a version of the 2048 game for Coq☆22Updated last year
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- Hanoi tower in Coq☆26Updated last month
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- An implementation of scoped algebraic effects and handlers in Agda.☆12Updated 4 years ago
- my phd thesis☆26Updated 10 months ago
- ☆29Updated 3 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last month
- 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 Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Deadlock freedom by type checking☆20Updated 2 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 5 years ago
- A simple λProlog interpreter☆20Updated 3 years ago