jsiek / denotational_semanticsLinks
Denotational semantics based on graph and filter models
☆23Updated 10 months ago
Alternatives and similar repositories for denotational_semantics
Users that are interested in denotational_semantics are comparing it to the libraries listed below
Sorting:
- Formalizations of Gradually Typed Languages in Agda☆58Updated last week
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Partial Commutative Monoids☆31Updated 4 months ago
- Graded Dependent Type systems☆25Updated 2 years ago
- A style guide for Coq☆18Updated 3 years ago
- Quasi-quoting library for agda☆18Updated 11 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months 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
- An enhanced unification algorithm for Coq☆58Updated 6 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- ☆36Updated 4 years ago
- ☆18Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Constructive Galois connections☆36Updated 7 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 3 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆36Updated last month
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated 2 years ago
- ☆21Updated 4 years 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
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago