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 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- ☆12Updated 10 years ago
- ☆14Updated 6 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆45Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- A very little language☆16Updated 2 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago
- Coq code accompanying several articles on semantics of functional programming languages☆11Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆21Updated last month
- Collection of Idris snippets☆23Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- ☆17Updated 6 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 5 months ago
- Invertible parsing for S-expressions☆34Updated 6 months ago
- A talk☆28Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated 2 weeks ago
- A cost-aware logical framework, embedded in Agda.☆66Updated this week
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Experiments with linear types☆14Updated 7 years ago
- an optimizing curry compiler☆14Updated 2 years ago
- ☆18Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago