Hope programming language interpreter
☆42May 30, 2025Updated 9 months ago
Alternatives and similar repositories for hope
Users that are interested in hope are comparing it to the libraries listed below
Sorting:
- Label dependent dependent session types☆16May 2, 2024Updated last year
- 👁️ Isometric 3D Graphing / Rendering module for Haskell☆15Sep 2, 2017Updated 8 years ago
- An interpreted lambda calculus with Algebraic and Recursive Types.☆20Jul 13, 2021Updated 4 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- Austin's supercompiler work☆21Nov 17, 2019Updated 6 years ago
- A categorical framework for circuit construction☆31Sep 27, 2016Updated 9 years ago
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- Streaming parsers collection☆17Jun 19, 2020Updated 5 years ago
- typesafe implementation of tensor algebra in Haskell☆13Feb 27, 2021Updated 5 years ago
- The legacy CamlDBM library for accessing NDBM/GDBM database files☆12Jul 11, 2024Updated last year
- A simple way to query constructors, like cases but slightly more concise☆11Mar 7, 2018Updated 8 years ago
- All the code I've ever written in Ltac2☆11Jan 19, 2021Updated 5 years ago
- Shared Cheat Sheet for Coq☆10Sep 8, 2016Updated 9 years ago
- Zettelkasten file processor☆12Oct 7, 2020Updated 5 years ago
- Accepted papers for PLDI 2014☆15May 19, 2016Updated 9 years ago
- Coq & Haskell code for Calculating Correct Compilers II☆12Feb 22, 2022Updated 4 years ago
- Sometimes when I feel sad I implement a dependently typed lambda calculus.☆15Mar 26, 2020Updated 5 years ago
- The generalized intensional compiler for a Haskell-like language.☆14Nov 27, 2017Updated 8 years ago
- Resurrection of the EuLisp definition and the Youtoo, EuXLisp and Eu2C implementations☆64Feb 27, 2011Updated 15 years ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆46Jan 5, 2020Updated 6 years ago
- The language of the future!☆72Jan 7, 2024Updated 2 years ago
- being the notes and materials for CS410 in the 2013/14 academic session☆30May 27, 2014Updated 11 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆21Nov 26, 2023Updated 2 years ago
- A tiny statically typed programming language☆18Jul 22, 2014Updated 11 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- TkS*LIDE - Tk/TCL based Snobol4/Spitbol IDE☆13Feb 19, 2026Updated 2 weeks ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- ScopeT and ScopeH☆13Aug 3, 2024Updated last year
- The newt programming language☆12Sep 23, 2018Updated 7 years ago
- Type Inference Prototyping Engine from Relational specifications of type systems☆11Jun 24, 2020Updated 5 years ago
- Zippers for cofree types☆14Dec 7, 2021Updated 4 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- ☆13Apr 5, 2020Updated 5 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- nominal sets in haskell☆19Nov 18, 2018Updated 7 years ago
- checkers for algebra driven design☆34Nov 19, 2022Updated 3 years ago
- Demo for dependent types + runtime code generation☆72Feb 18, 2025Updated last year
- A compiled language that is halfway between C and Go/Swift/Rust☆12Jul 7, 2016Updated 9 years ago