recursion-ninja / CSCI-499-2021-Fall
CSCI 499 — Advanced Applications: A Hunter Fall 2021 Course
☆28Updated 3 years ago
Alternatives and similar repositories for CSCI-499-2021-Fall:
Users that are interested in CSCI-499-2021-Fall are comparing it to the libraries listed below
- The Incredible Proof Machine☆367Updated last year
- A web site for converting haskell code into pointfree haskell code☆162Updated 2 years ago
- A formal logic framework that runs in the browser☆277Updated last month
- The Ott tool for writing definitions of programming languages and calculi☆355Updated 3 weeks ago
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆353Updated this week
- A proof assistant for higher-dimensional type theory☆157Updated last month
- ☆10Updated last month
- Tutorial Questions for the Programming II course at Imperial College London☆50Updated last year
- Code challenges to solve with Haskell☆117Updated 2 years ago
- HoTTEST Summer School materials☆295Updated last year
- Learning Rust in 6 weeks with ACM @ UCLA!☆10Updated 2 years ago
- A new Categories library for Agda☆374Updated this week
- A demo implementation of a simple dependently-typed language☆581Updated 2 months ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆291Updated this week
- An experimental library for Cubical Agda☆463Updated 2 weeks ago
- Maintenance of the pointfree Hackage package.☆144Updated 3 months ago
- Metaprogramming, verified meta-theory and implementation of Coq in Coq☆411Updated this week
- The Agda standard library☆596Updated this week
- Equational laws for free☆251Updated 10 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Lecture notes on univalent foundations of mathematics with Agda☆221Updated 9 months ago
- ☆224Updated 5 months ago
- Standard library for linear types in Haskell.☆338Updated 2 months ago
- A selection of textbook-like course notes for the Imperial College Computing modules.☆67Updated 9 months ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆249Updated this week
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- ☆63Updated 2 years ago
- agda-mode for neovim☆137Updated this week
- Total Parser Combinators in Agda☆125Updated last year
- A wiki for collaborative work on totally legitimate "category theory"☆104Updated 6 months ago