ucsd-progsys / 131-web
Public course materials for CSE 131 (Compilers)
☆18Updated 4 years ago
Related projects: ⓘ
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆80Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆42Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆66Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Higher-order optimization library☆73Updated last year
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆41Updated last year
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- A verified compiler for a lazy functional language☆31Updated this week
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 4 years ago
- Example row-polymorphism implementations☆59Updated 11 months ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- MetaML and MetaOCaml bibliography☆84Updated 3 weeks ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆86Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆28Updated last year
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- The Software Foundations book, in GHC☆81Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- ☆74Updated this week
- System Fω interpreter for use in Advanced Functional Programming course☆65Updated 11 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago