diku-dk / staffeliLinks
DIKU Support Tools for Canvas LMS
☆14Updated last year
Alternatives and similar repositories for staffeli
Users that are interested in staffeli are comparing it to the libraries listed below
Sorting:
- The official interpreter for the Jeopardy language☆16Updated 3 years ago
- Parallel Functional Programming, 2020☆16Updated last year
- Tutorial for using the MPL compiler for Parallel ML☆23Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 2 months ago
- Data Parallel Programming☆22Updated last year
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- Simple autograder for Haskell programming assignments☆17Updated 10 months ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆70Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 5 months ago
- PhD course on Functional Programming and Climate Impact Research☆50Updated 4 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Coq library for handling names☆19Updated 3 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Prototype type inference engine☆205Updated 11 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- PL conference deadline countdowns☆63Updated last month
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- Untitled PL Card Game☆20Updated 4 years ago