jsiek / denotational_semanticsLinks
Denotational semantics based on graph and filter models
☆23Updated 11 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:
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week
- A style guide for Coq☆18Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Quasi-quoting library for agda☆18Updated last year
- Constructive Galois connections☆36Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Partial Commutative Monoids☆32Updated 6 months ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- 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
- ☆18Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 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.☆23Updated 8 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 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 7 months ago
- ☆36Updated 4 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last week
- 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
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Paper and talk☆55Updated 2 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year