JoeyEremondi / pl-lt-rulesLinks
Rules for writing academic papers and checking them using LTex-ls and LanguageTool
☆19Updated 11 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 last month
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Updated last year
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 11 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- ☆17Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- 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
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 9 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 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 9 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated 3 weeks ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago