jsiek / denotational_semanticsLinks
Denotational semantics based on graph and filter models
☆23Updated 8 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☆57Updated 6 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Quasi-quoting library for agda☆18Updated 9 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated this week
- A style guide for Coq☆18Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.☆64Updated last week
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- ☆18Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- PL syntax macros.☆19Updated 2 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- ☆36Updated 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
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last week
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 weeks ago
- An enhanced unification algorithm for Coq☆56Updated 4 months ago