halfaya / MusicToolsLinks
☆43Updated 11 months ago
Alternatives and similar repositories for MusicTools
Users that are interested in MusicTools are comparing it to the libraries listed below
Sorting:
- ☆51Updated 4 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- Eventually a practical 2-level TT-based compiler☆29Updated this week
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A formalization of category theory in cubical Agda☆59Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- being an operating system for typechecking processes☆130Updated 2 months ago
- A cost-aware logical framework, embedded in Agda.☆68Updated last month
- Haskell library for doing category theory with a central role for profunctors☆24Updated last week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Horn Clause Constraint Solving for Liquid Types☆155Updated this week
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Agda category theory library for denotational design☆54Updated last month