JoeyEremondi / pl-lt-rules
Rules for writing academic papers and checking them using LTex-ls and LanguageTool
☆18Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for pl-lt-rules
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 3 weeks ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- Organize mathematical thoughts☆19Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆22Updated 2 months ago
- being an implementation of the calculus of constructions☆15Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A type theory with native support for Polynomial Functors.☆38Updated last year
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- ☆16Updated 7 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Hanoi tower in Coq☆24Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆23Updated 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…☆19Updated 2 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- ☆35Updated 3 years ago
- ☆28Updated 2 years ago
- An implementation of scoped algebraic effects and handlers in Agda.☆11Updated 3 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 8 months ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆25Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Denotational semantics based on graph and filter models☆17Updated last year