msp-strath / cs316-functional-programmingLinks
CS316 "Functional Programming" lecture notes
☆14Updated 8 months ago
Alternatives and similar repositories for cs316-functional-programming
Users that are interested in cs316-functional-programming are comparing it to the libraries listed below
Sorting:
- A Teeny Type Theory☆26Updated 3 years ago
- An Agda library for programming with ternary relations☆17Updated 4 months ago
- ☆48Updated last week
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- ☆29Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- A tutorial on how Agda infers things☆60Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- NbE course @ Chalmers☆28Updated 10 months ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- being a particular fragment of Haskell, extended to a proof system☆33Updated 2 weeks ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- antifunext☆34Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Learn the Agda basics in three 2-hour sessions.☆60Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- ☆21Updated 3 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- # A simple variable binding library based on well-scoped indices and environments☆14Updated this week
- Eventually a practical 2-level TT-based compiler☆27Updated 3 weeks ago
- A Really Cool Calculator written in Haskell... or is it?☆43Updated 3 years ago