JoeyEremondi / pl-lt-rulesLinks
Rules for writing academic papers and checking them using LTex-ls and LanguageTool
☆19Updated 6 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 LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated last year
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 7 months ago
- A formalization of System Fω in Agda☆19Updated 6 months ago
- being a particular fragment of Haskell, extended to a proof system☆34Updated last month
- A small NuPRL style proof assistant☆31Updated 6 years ago
- 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☆39Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 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
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 4 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
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 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.☆22Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- ☆17Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Organize mathematical thoughts☆20Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated this week
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- ☆36Updated 3 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago