msp-strath / cs410-advanced-functional-programmingLinks
CS410 "Advanced Functional Programming"
☆27Updated 6 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☆42Updated 3 months ago
- Eventually a practical 2-level TT-based compiler☆29Updated last week
- Meta-programming utilities for Agda.☆20Updated 3 months ago
- ☆29Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated last week
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆31Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- A work-in-progress core language for Agda, in Agda☆59Updated last week
- Extensions to cubical for categorical logic/type theory☆34Updated this week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- A tutorial on how Agda infers things☆63Updated 4 months ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 3 years ago
- Agda category theory library for denotational design☆54Updated 3 weeks ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- ☆36Updated 4 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- ☆51Updated 3 months ago
- Lecture notes on realizability☆74Updated 8 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- 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
- A cost-aware logical framework, embedded in Agda.☆67Updated last week
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- high-performance cubical evaluation☆76Updated 6 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year