RobertHarper / pl-syntaxLinks
PL syntax macros.
☆21Updated 3 weeks ago
Alternatives and similar repositories for pl-syntax
Users that are interested in pl-syntax are comparing it to the libraries listed below
Sorting:
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- my phd thesis☆26Updated last year
- A cost-aware logical framework, embedded in Agda.☆68Updated last month
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- ☆36Updated 4 years ago
- ☆16Updated 3 years ago
- Mechanizations of Type Theories☆32Updated 2 weeks ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- haha I'm graduating☆14Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- IO for Gallina☆33Updated last week
- A LaTeX package to reproduce (an enhanced version of) the numbered paragraph style from classic French mathematics books.☆19Updated 4 years ago
- Quasi-quoting library for agda☆18Updated last year
- Denotational semantics based on graph and filter models☆23Updated last year
- A formalization of the theory behind the mugen library☆19Updated last year
- Research material of Erik Palmgren (1963–2019)☆21Updated 8 months ago
- ☆21Updated 4 years ago
- HoTT Book formalisations in Rzk.☆19Updated 2 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 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
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Implementation of sprintf for Coq☆18Updated 5 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 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- ☆17Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago