☆14Nov 23, 2016Updated 9 years ago
Alternatives and similar repositories for Program-translations-CC-omega
Users that are interested in Program-translations-CC-omega are comparing it to the libraries listed below
Sorting:
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Logical Relation for MLTT in Coq☆30Jan 14, 2026Updated last month
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- Provides a reference implementation of FeatherweightRust in Java.☆15Oct 28, 2021Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- ☆17Oct 31, 2025Updated 4 months ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- Integration of MathJax, KaTeX and Asymptote with scribble, to typeset math in Racket documentation☆17Jun 11, 2024Updated last year
- ☆12Jul 1, 2025Updated 8 months ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Nov 2, 2019Updated 6 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆33Jun 5, 2019Updated 6 years ago
- Implementatoin of Selinger's Typed Quantum Lambda Calculus☆13Oct 29, 2019Updated 6 years ago
- A translation verifier for Reopt (https://github.com/GaloisInc/reopt)☆20Sep 20, 2021Updated 4 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Authenticated Data Structures☆16Jul 5, 2015Updated 10 years ago
- Dafny for Metatheory of Programming Languages☆29Feb 6, 2026Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- freer monads and cofreer comonads.☆23Jun 26, 2018Updated 7 years ago
- Link to preprints for POPL'18 and colocated events☆86Jun 16, 2018Updated 7 years ago
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 8 years ago
- GHCJS interface for the Javascript Websocket API (DEPRECATED: use ghcjs-base's native websockets!)☆21May 13, 2016Updated 9 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- 🦠 Reusable components based on algebraic effects☆52Nov 21, 2025Updated 3 months ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- A prototypical dependently typed languages with sized types and variances☆115Jan 12, 2026Updated last month
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Folds for recursive types with GHC Generics☆28Aug 9, 2025Updated 6 months ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- OCaml BitTorrent library and client☆42Sep 12, 2022Updated 3 years ago
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- Formalizing convex polyhedra in Coq☆24Jul 8, 2024Updated last year
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago