Graded Dependent Type systems
☆28Jun 28, 2023Updated 3 years ago
Alternatives and similar repositories for graded-haskell
Users that are interested in graded-haskell are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Implementation of Quantitative Type Theory (in TypeScript)☆14Dec 16, 2020Updated 5 years ago
- Dependently typed programming language written in Haskell☆22Feb 14, 2022Updated 4 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Implementation of Polymorphic Gradual Typing☆12Sep 16, 2018Updated 8 years ago
- ☆12Mar 13, 2025Updated last year
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 7 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆18Aug 30, 2024Updated 2 years ago
- A formalization of the theory behind the mugen library☆20Jul 5, 2026Updated 4 months ago
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Jan 10, 2023Updated 3 years ago
- Racket Equivalence Graph Library☆19May 24, 2022Updated 4 years ago
- A formalisation of the Calculus of Constructions☆74Jul 24, 2024Updated 2 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated 2 years ago
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- Cyclic theorem prover for equalitional reasoning using egraphs☆28Oct 24, 2023Updated 3 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- ☆14Aug 5, 2026Updated 3 months ago
- A work-in-progress structure editor for the cooltt proof assistant.☆18Jul 28, 2022Updated 4 years ago
- Denotational semantics based on graph and filter models☆25Nov 13, 2026Updated last week
- A cost-aware logical framework, embedded in Agda.☆80Updated this week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Oct 4, 2020Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆91Sep 13, 2021Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45May 31, 2022Updated 4 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆26May 13, 2026Updated 6 months ago
- Materials for OPLSS 2021☆11Jun 1, 2021Updated 5 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Quantitative Type Theory implementation☆55Jun 2, 2021Updated 5 years ago
- Deadlock freedom by type checking☆20Jun 2, 2023Updated 3 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆14Oct 9, 2023Updated 3 years ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆13Sep 3, 2020Updated 6 years ago
- Semantics of Programming Languages☆13Aug 8, 2019Updated 7 years ago
- Low-overhead effect management for concrete monads☆39Mar 25, 2022Updated 4 years ago
- Port of Jeremy Ong's SIMD-enabled projective geometric algebra library☆16Oct 23, 2020Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Mar 16, 2021Updated 5 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 8 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 4 years ago
- Term project for TaPL. A mini coq-like proof assistant.☆17Jun 17, 2018Updated 8 years ago
- Composable intrincially-typed definitional interpreters☆17Nov 13, 2022Updated 4 years ago
- Rules for writing academic papers and checking them using LTex-ls and LanguageTool☆20Feb 18, 2025Updated last year
- YieldFSM, a DSL for describing finite state machines in Clash☆13Sep 28, 2022Updated 4 years ago
- Logical Relation for MLTT in Coq☆37Apr 7, 2026Updated 7 months ago
- 😎TT☆252Nov 20, 2025Updated last year
Are these results useful?