kmicinski / cmsc330examplesLinks
Examples from the class CMSC 330 during Summer 2015
☆48Updated 9 years ago
Alternatives and similar repositories for cmsc330examples
Users that are interested in cmsc330examples are comparing it to the libraries listed below
Sorting:
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last month
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- Abstracting Definitional Interpreters☆68Updated 7 years ago
- MetaML and MetaOCaml bibliography☆92Updated 6 months ago
- The Mechanization of Standard ML☆73Updated 2 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆121Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆103Updated last year
- A basic library of algorithms and data structures (a la NJlib)☆74Updated 2 months ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- System Fω interpreter for use in Advanced Functional Programming course☆65Updated last year
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- ☆60Updated 6 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Generation of abstract binding trees☆28Updated 8 months ago
- ☆84Updated last year
- MLpolyR☆7Updated 8 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Racket bindings for Z3☆24Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago