Examples from our paper "Capturing the Future by Replaying the Past"
☆23Sep 10, 2024Updated last year
Alternatives and similar repositories for thermometer-continuations
Users that are interested in thermometer-continuations are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆11Jul 20, 2016Updated 9 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Haskell implementation of open games☆13Apr 20, 2016Updated 9 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- ☆14Nov 23, 2016Updated 9 years ago
- SubML (prototype) language☆22Mar 20, 2022Updated 4 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.☆23Dec 14, 2016Updated 9 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- Selective applicative functors laws and theorems☆15Mar 12, 2020Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- Certified Machine Learning☆41Mar 10, 2021Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- ☆48Jul 5, 2019Updated 6 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆18Mar 11, 2024Updated 2 years ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- Learn the Agda basics in three 2-hour sessions.☆60Sep 26, 2025Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- ☆21May 9, 2017Updated 8 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Sep 2, 2023Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Mar 16, 2021Updated 5 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- Language mixing functional programming and Ambient Calculus☆12Dec 10, 2024Updated last year
- Notes and handouts from OPLSS 2019☆35Jun 28, 2019Updated 6 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Derivation of Optimized Definitions Based on Specs☆14Sep 28, 2019Updated 6 years ago
- This github repository hosts the code used within my thesis work and my last publication.☆12Jul 20, 2017Updated 8 years ago
- An experimental Haskell library for programming with effectful runners.☆30Dec 6, 2019Updated 6 years ago
- A set of tools for building graph rewriting systems and more specifically, working with the chemlambda rewrite model of computation.☆12Dec 27, 2016Updated 9 years ago
- OCaml binding to LXC with idiomatic (and opionated) OCaml API design☆13Oct 25, 2019Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month