msp-strath / cs410-advanced-functional-programmingLinks
CS410 "Advanced Functional Programming"
☆27Updated 4 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:
- being a particular fragment of Haskell, extended to a proof system☆39Updated 2 months ago
- Extensions to cubical for categorical logic/type theory☆32Updated this week
- Eventually a practical 2-level TT-based compiler☆27Updated last week
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated last year
- ☆29Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 3 weeks ago
- Meta-programming utilities for Agda.☆19Updated 2 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- ☆48Updated last month
- Lecture notes on realizability☆74Updated 7 months ago
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- Compiler backend for generating Scheme code☆26Updated last year
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 8 months ago
- ☆36Updated 3 years ago
- # A simple variable binding library based on well-scoped indices and environments☆17Updated 2 weeks ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Formalizations of Gradually Typed Languages in Agda☆57Updated 8 months ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆12Updated last year
- antifunext☆34Updated last year
- Distributors - Unifying Parsers, Printers & Grammars☆56Updated 2 weeks ago
- ☆30Updated 2 years ago