ucsd-progsys / 131-webLinks
Public course materials for CSE 131 (Compilers)
☆18Updated 5 years ago
Alternatives and similar repositories for 131-web
Users that are interested in 131-web are comparing it to the libraries listed below
Sorting:
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- System Fω interpreter for use in Advanced Functional Programming course☆66Updated last year
- A nano "theorem prover".☆62Updated 6 years ago
- MetaML and MetaOCaml bibliography☆94Updated 8 months ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 weeks ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 6 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 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
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Example row-polymorphism implementations☆61Updated last year
- A verified compiler for a lazy functional language☆37Updated 2 weeks ago
- A prototype programming language for programming with runners☆91Updated 3 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 7 years ago
- A pretty-printing combinator library for OCaml☆51Updated last year
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 2 months ago