Examples from the class CMSC 330 during Summer 2015
☆49Jul 23, 2015Updated 10 years ago
Alternatives and similar repositories for cmsc330examples
Users that are interested in cmsc330examples are comparing it to the libraries listed below
Sorting:
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Jan 8, 2017Updated 9 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- My PhD thesis, titled "Reasonably Programmable Syntax"☆15Aug 28, 2018Updated 7 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Jul 26, 2022Updated 3 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- ☆26Jul 18, 2022Updated 3 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
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 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
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- SML On Stilts☆37Feb 6, 2014Updated 12 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 2 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated 2 months ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- bil verification tool☆12Jun 30, 2022Updated 3 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- DOrder -- Automatically Learning Shape Specifications☆20Jun 19, 2017Updated 8 years ago
- ☆12Jul 10, 2020Updated 5 years ago
- An OCaml EDSL for describing and solving strategic games☆17Sep 10, 2023Updated 2 years ago
- Samples and solutions from Chris Okasaki's "Purely Functional Data Structures", written in OCaml.☆12Jun 13, 2021Updated 4 years ago