☆16Jun 17, 2017Updated 8 years ago
Alternatives and similar repositories for Problems
Users that are interested in Problems are comparing it to the libraries listed below
Sorting:
- Explaining category theory by example☆10Jun 30, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Polynomial semantics of linear logic☆13Apr 15, 2018Updated 7 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20May 10, 2017Updated 8 years ago
- Yet another haskell term rewriting library☆18Aug 27, 2025Updated 6 months ago
- UDP-only netcat implementation with OCaml / MirageOS☆14Mar 21, 2017Updated 8 years ago
- Experiments with linear types☆14Feb 23, 2018Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆21Oct 15, 2023Updated 2 years ago
- A web page with resources for teaching with formal methods and tools.☆14Apr 8, 2023Updated 2 years ago
- Documented version of a simple type-theoretic language: Mini-TT☆18May 5, 2019Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆37Mar 17, 2025Updated 11 months ago
- Spacemacs Layer for LiquidHaskell☆13Jun 10, 2017Updated 8 years ago
- Foundational Verification of Hybrid Systems☆15Mar 23, 2017Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A Coq plugin that implements exceptions in Coq☆13Jan 7, 2021Updated 5 years ago
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 8 years ago
- A fornalisation of Grobner basis in ssreflect☆12Jan 29, 2026Updated last month
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- A Coq library for reasoning (co)inductively on infinite sequences using LTL-like modal operators☆17Jan 7, 2023Updated 3 years ago
- ☆43Nov 2, 2018Updated 7 years ago
- A type checker for the Lean theorem prover☆40Mar 6, 2021Updated 4 years ago
- Authenticated Data Structures☆16Jul 5, 2015Updated 10 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Jan 19, 2017Updated 9 years ago
- gallina frontend for CompCert☆19Jul 6, 2019Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 8 years ago
- Writeup that goes along with this:☆16Apr 19, 2018Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Mechanizing Types and Programming Languages using Beluga☆21May 29, 2020Updated 5 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 10 months ago
- A language based on homotopy type theory with an interval☆84Apr 5, 2015Updated 10 years ago
- State machines in Idris☆37Nov 6, 2016Updated 9 years ago
- Linear Algebra Done...Lean☆19Jan 15, 2018Updated 8 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
- ☆27Jun 30, 2014Updated 11 years ago