JoeyEremondi / pl-lt-rulesLinks
Rules for writing academic papers and checking them using LTex-ls and LanguageTool
☆19Updated 10 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 2 weeks ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- 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
- ☆17Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 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
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- ☆36Updated 4 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 11 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- 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
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Papers on aspects of Generalised Algebraic Theories, Contextual Categories and Mathematical Theory Of Data☆41Updated last week