We read computer science books for fun. This is where the secret notes live.
☆80Dec 27, 2021Updated 4 years ago
Alternatives and similar repositories for SMRTYPRTY
Users that are interested in SMRTYPRTY are comparing it to the libraries listed below
Sorting:
- Reading schedule and our library of pdfs☆24Apr 29, 2019Updated 6 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- Translation from FOL to LTL+Past and LTL, via separation of LTL+Past☆10May 22, 2024Updated last year
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Feb 21, 2020Updated 6 years ago
- A helper to save me some keystrokes from nix-prefetch-git.☆13Apr 8, 2019Updated 6 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated 2 months ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Compiler for IMP programming language implemented in Haskell☆16Jun 16, 2020Updated 5 years ago
- A practical application launcher for impractical people☆12Dec 21, 2023Updated 2 years ago
- PL Reading Group Website☆14Jan 12, 2026Updated last month
- Notes and handouts from OPLSS 2018☆55Jul 23, 2018Updated 7 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- Program verification with F* course materials☆12Jul 6, 2019Updated 6 years ago
- being the lecture materials and exercises for the 2016/17 session of Advanced Functional Programming at Strathclyde☆13May 9, 2017Updated 8 years ago
- Examples from the class CMSC 330 during Summer 2015☆49Jul 23, 2015Updated 10 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Oct 22, 2024Updated last year
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- A very little language☆16Jul 1, 2023Updated 2 years ago
- TODA files: an open source cryptographic asset structure☆17Jul 28, 2025Updated 7 months ago
- Implementatoin of Selinger's Typed Quantum Lambda Calculus☆13Oct 29, 2019Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A simple compiler from the lambda calculus to MIPS assembly☆20May 19, 2017Updated 8 years ago
- ☆51Dec 14, 2022Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- Scripts to generate a dataset with static frames from the Arcade Learning Environment☆19May 9, 2014Updated 11 years ago
- A small bifunctor library for idris☆21Dec 28, 2020Updated 5 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 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
- ☆99Sep 22, 2025Updated 5 months ago