nrnrnr / build-prove-compare-student-code
Student-facing code from the book *Programming Languages: Build, Prove, and Compare* by Norman Ramsey
☆24Updated last year
Related projects ⓘ
Alternatives and complementary repositories for build-prove-compare-student-code
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated last week
- Standard ML compiler based on typed intermediate languages.☆46Updated 10 years ago
- CMSC 430 Design and Implementation of Programming Languages☆47Updated this week
- A custom parser/auto-formatter for Standard ML☆68Updated 11 months ago
- Rules for writing academic papers and checking them using LTex-ls and LanguageTool☆18Updated 2 years ago
- ☆85Updated 3 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 3 years ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated 9 months ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 7 years ago
- Experiments about intermediate representations in compilers☆25Updated 12 years ago
- The Mechanization of Standard ML☆72Updated 2 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆37Updated 2 years ago
- Course web page for Fall 2021.☆21Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 2 years ago
- Parallel ML compiler☆71Updated 4 years ago
- A deterministic parser with fused lexing☆71Updated last year
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆60Updated 2 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆41Updated 4 months ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 6 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆54Updated 6 months ago
- ☆40Updated 7 months ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆30Updated 5 years ago
- Accompanying materials for "A Core Calculus for Documents"☆31Updated last year
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- An experimental language server for SomewhatML☆24Updated last year
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- A basic library of algorithms and data structures (a la NJlib)☆74Updated last year