Dijkstra's shortest path algorithm implemented at type level with Haskell
☆20Dec 11, 2017Updated 8 years ago
Alternatives and similar repositories for typelevel-dijkstra-sp
Users that are interested in typelevel-dijkstra-sp are comparing it to the libraries listed below
Sorting:
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- A Language and its compiler on Ethereum Virtual Machine☆14Dec 17, 2018Updated 7 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- A compiler from mini-STG to Wasm (**far from complete**)☆14Jun 13, 2017Updated 8 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 8 years ago
- concise json parsing in Haskell using lenses☆20Oct 2, 2017Updated 8 years ago
- Translation from FOL to LTL+Past and LTL, via separation of LTL+Past☆10May 22, 2024Updated last year
- A monadic interface for DAG construction.☆24May 11, 2021Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- doom☆17Mar 8, 2016Updated 10 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- ☆12May 22, 2016Updated 9 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Haskell Interface for getting overall system statistics