Examples from the class CMSC 330 during Summer 2015
☆49Jul 23, 2015Updated 11 years ago
Alternatives and similar repositories for cmsc330examples
Users that are interested in cmsc330examples are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A bare-bones LCF-style proof assistant☆26Aug 13, 2019Updated 7 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 9 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆39Aug 19, 2022Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆34Jan 12, 2026Updated 9 months ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆37Jan 8, 2017Updated 9 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 13 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆47Oct 18, 2022Updated 3 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆26Jul 26, 2022Updated 4 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 9 years ago
- My PhD thesis, titled "Reasonably Programmable Syntax"☆15Aug 28, 2018Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 10 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 13 years ago
- Experiment with synthetic domain theory in cubical agda☆15Nov 8, 2022Updated 3 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated last year
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆13May 15, 2017Updated 9 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆63Jun 30, 2022Updated 4 years ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 7 years ago
- Notes for CIS 700 (Fall '19) at Syracuse U.☆13Nov 6, 2019Updated 6 years ago
- ☆21Apr 15, 2018Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Jun 3, 2022Updated 4 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- secret project☆17Mar 14, 2018Updated 8 years ago
- Experimental functional language☆17Dec 24, 2025Updated 9 months ago
- bil verification tool☆12Jun 30, 2022Updated 4 years ago
- An implementation of the OutsideIn(X) constraint-based type inference engine "as seen in GHC"☆17Jan 26, 2018Updated 8 years ago
- SML On Stilts☆37Feb 6, 2014Updated 12 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 9 years ago
- OCaml bindings for libgccjit☆29Feb 13, 2017Updated 9 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 5 years ago
- A Datalog implementation with an OCaml inspired module system☆45Apr 24, 2026Updated 5 months ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 11 years ago
- Samples and solutions from Chris Okasaki's "Purely Functional Data Structures", written in OCaml.☆11Jun 13, 2021Updated 5 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11May 18, 2026Updated 4 months ago
- ☆12Jul 10, 2020Updated 6 years ago
- An interpreter of F-ing modules☆19Jun 21, 2019Updated 7 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 9 years ago
- ☆26Jul 18, 2022Updated 4 years ago