JoeyEremondi / pl-lt-rulesLinks
Rules for writing academic papers and checking them using LTex-ls and LanguageTool
☆19Updated 9 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:
- A formalization of System Fω in Agda☆20Updated 9 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆31Updated last year
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Miller/pattern unification in Agda☆66Updated last month
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- ☆17Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- ☆36Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 10 months ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago