combinators / cls-scalaLinks
(CL)S - Combinatory Logic Synthesizer
☆12Updated 4 years ago
Alternatives and similar repositories for cls-scala
Users that are interested in cls-scala are comparing it to the libraries listed below
Sorting:
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- generative programming & verification☆34Updated 4 months ago
- Matita (proof assistant) with embedded elpi☆14Updated 7 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last week
- Experiments in implementing functional data structures in Idris☆15Updated 6 years ago
- A formalization of the Dedekind real numbers in Coq [maintainer=@andrejbauer]☆44Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- A very little language☆16Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Denotational semantics based on graph and filter models☆23Updated 11 months ago
- Luck -- A Language for Property-Based Generators☆35Updated 8 months ago
- Dafny for Metatheory of Programming Languages☆26Updated 2 months ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated last month
- ☆18Updated 3 years ago
- Collection of Idris snippets☆23Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Course on Metaprogramming☆72Updated 4 months ago
- ☆12Updated 10 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- ☆17Updated 7 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Constructive Galois connections☆35Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago