msp-strath / cs410-advanced-functional-programmingLinks
CS410 "Advanced Functional Programming"
☆25Updated 2 months ago
Alternatives and similar repositories for cs410-advanced-functional-programming
Users that are interested in cs410-advanced-functional-programming are comparing it to the libraries listed below
Sorting:
- Eventually a practical 2-level TT-based compiler☆27Updated this week
- being a particular fragment of Haskell, extended to a proof system☆33Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 3 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated 11 months ago
- A tutorial on how Agda infers things☆60Updated 3 weeks ago
- Meta-programming utilities for Agda.☆19Updated this week
- Lecture notes on realizability☆74Updated 5 months ago
- ☆29Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- Extensions to cubical for categorical logic/type theory☆30Updated this week
- ☆48Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- ☆36Updated 3 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- high-performance cubical evaluation☆74Updated 3 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated last week
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Compiler backend for generating Scheme code☆26Updated last year
- A TACtic library for Agda☆49Updated 10 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- NbE course @ Chalmers☆28Updated 10 months ago