jsiek / denotational_semanticsLinks
Denotational semantics based on graph and filter models
☆23Updated last year
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☆59Updated 2 weeks ago
- Constructive Galois connections☆36Updated 7 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Graded Dependent Type systems☆25Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Quasi-quoting library for agda☆18Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 4 months ago
- Partial Commutative Monoids☆32Updated 6 months 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 certified semantics for relational programming workout.☆26Updated 5 years ago
- Relation algebra library for Coq☆49Updated last month
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- A style guide for Coq☆18Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- ☆18Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 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 9 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆47Updated 8 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A cost-aware logical framework, embedded in Agda.☆69Updated last month
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago