ucsd-progsys / 230-wi19-web
Public course materials for CSE 230 (Winter 2019)
☆27Updated 2 years ago
Related projects: ⓘ
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Minimal binary serialization library with focus on performance☆17Updated 3 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆15Updated 8 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 4 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆13Updated 5 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Haskell's Core in K.☆20Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆19Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 3 months ago
- Austin's supercompiler work☆21Updated 4 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆22Updated 2 years ago
- System F in coq.☆19Updated 9 years ago
- The Prettiest Printer☆35Updated 7 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Generic pretty-printer for program output☆12Updated 8 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆10Updated 5 years ago
- ☆22Updated 11 months ago
- GHC-WPC is an extended GHC that exports the STG and other IR (.modpak) for the compiled modules and linker metadata (.ghc_stgapp) at appl…☆10Updated 7 months ago
- A talk☆28Updated 3 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 6 years ago
- Type inference for 'type level computation one step at a time'☆12Updated 6 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated last week
- ☆11Updated 9 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 5 months ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 4 years ago
- Specification of Agda.☆25Updated 5 years ago
- A tiny implementation of dependent types.☆11Updated 6 years ago