probcomp / haskell-trace-types
Prototype of the system described in "Trace Types and Denotational Semantics for Sound Programmable Inference in Probabilistic Languages"
☆10Updated 5 years ago
Alternatives and similar repositories for haskell-trace-types:
Users that are interested in haskell-trace-types are comparing it to the libraries listed below
- Fast equality saturation in Haskell☆84Updated 2 months ago
- Notes and handouts from OPLSS 2018☆54Updated 6 years ago
- A Haskell probabilistic programming library.☆19Updated last month
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- HoTT in Lean 3☆79Updated 4 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- Paper and talk☆53Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 3 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A monadic library for symbolic evaluation☆60Updated last week
- ☆21Updated 4 years ago
- Syng: A syntactic approach to concurrent separation logic with propositional ghost state, fully mechanized in Agda☆11Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆106Updated 10 years ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 6 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Lecture notes on realizability☆72Updated 2 months ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆58Updated 7 months ago
- An enhanced unification algorithm for Coq☆55Updated 2 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Lean 4 port of Iris, a higher-order concurrent separation logic framework☆94Updated last week
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- ☆55Updated 3 weeks ago