stanford-cs242 / f18-assignments
☆23Updated 6 years ago
Alternatives and similar repositories for f18-assignments:
Users that are interested in f18-assignments are comparing it to the libraries listed below
- A λ-calculus grammar/interpretor written using LALRPOP and `λ!`.☆84Updated 9 months ago
- A collection of programming languages and type systems.☆33Updated 6 months ago
- Book: Introduction to Dependent Types with Idris☆76Updated last year
- Datalog + Egg = Good☆65Updated last year
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago
- A PLT Redex model of a toy language that is almost, but not quite, entirely unlike Rust☆34Updated 11 years ago
- implementation of Pure Type Systems (PTS) in Rust.☆52Updated 7 years ago
- ☆89Updated 3 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- An incremental approach to compiler construction☆81Updated 4 years ago
- Éole, a Lévy-optimal lambda calculus evaluator without oracle☆111Updated 5 years ago
- A library for deadlock-free session-typed communication in Rust.☆46Updated 4 years ago
- Rust implementation of the projects from the book Modern Compiler Implementation in ML☆142Updated 3 weeks ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2021☆18Updated 3 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆102Updated 10 months ago
- A compiler for Standard ML, somewhat☆202Updated 2 years ago
- Advent of Code 2018, in Coq! (https://adventofcode.com/2018)☆140Updated 6 years ago
- A CSS specification and reasoning engine☆94Updated 2 years ago
- A visual interpreter of the template instantiation machine to understand evaluation of lazy functional languages☆69Updated 8 years ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2018☆23Updated 6 years ago
- Writing a Scheme to x86 compiler by following Abdulaziz Ghuloum's "An Incremental Approach to Compiler Construction"☆72Updated 5 years ago
- Sinister's Scheme Compiler!☆24Updated 2 years ago
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Updated 8 years ago
- Reading schedule and our library of pdfs☆24Updated 5 years ago
- Verified hash-based AMQ structures in Coq☆121Updated 4 years ago
- Fungi: Typed incremental computation with names☆67Updated 5 years ago
- Session Type EDSL for Rust☆103Updated 2 years ago
- Apple array system☆66Updated this week
- The language of the future!☆72Updated last year
- Purely functional data structures for OCaml, translated from Chris Okasaki's book "Purely Functional Data Structures"☆146Updated last month