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
- ☆231Updated 8 months ago
- Maintenance of the pointfree Hackage package.☆146Updated 6 months ago
- A proof assistant for higher-dimensional type theory☆183Updated this week
- HoTTEST Summer School materials☆297Updated last year
- An experimental library for Cubical Agda☆478Updated last month
- A demo implementation of a simple dependently-typed language☆591Updated 5 months ago
- The Happy parser generator for Haskell☆301Updated 2 months ago
- Functional choreographic programming in Haskell☆93Updated 4 months ago
- 🕵️ Haskell STatic ANalyser☆580Updated 3 months ago
- Number theory: primes, arithmetic functions, modular computations, special sequences☆153Updated last week
- Visual Studio Code extension for Coq☆377Updated this week
- Publishes curated news about the Haskell programming language.☆151Updated last week
- ☆99Updated last week
- Standard library for linear types in Haskell.☆343Updated 2 weeks ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆253Updated this week
- An interpreter for learning and exploring pure λ-calculus☆455Updated 4 years ago
- Formal proof of the Four Color Theorem [maintainer=@ybertot]☆205Updated last week
- Metaprogramming, verified meta-theory and implementation of Rocq in Rocq☆439Updated last week
- Code challenges to solve with Haskell☆139Updated this week
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆366Updated last week
- Reimplementation of Parsley in Haskell, with improvements☆52Updated last year
- Literate Haskell support for Markdown☆140Updated last month
- Lecture notes on univalent foundations of mathematics with Agda☆226Updated last year
- Modern and extensible testing framework for Haskell☆649Updated 3 weeks ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆323Updated last week
- An efficient compact, immutable byte string type (both strict and lazy) suitable for binary or 8-bit character data.☆296Updated last month
- An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework .☆377Updated 2 months ago
- A collection of tools for writing technical documents that mix Coq code and prose.☆254Updated 2 months ago
- Logical manifestations of topological concepts, and other things, via the univalent point of view.☆253Updated this week
- A modern, extensible and well-documented prettyprinter.☆301Updated 5 months ago