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:
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A very little language☆16Updated 2 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- Matita (proof assistant) with embedded elpi☆15Updated 8 years ago
- Denotational semantics based on graph and filter models☆23Updated last year
- ☆12Updated 10 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆123Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- CLP(SMT) on top of miniKanren☆39Updated 3 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- ☆18Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- ☆17Updated 7 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated last year
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- ☆11Updated 8 years ago
- A formalization of the Dedekind real numbers in Coq [maintainer=@andrejbauer]☆45Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆47Updated 9 months ago