translations of a lambda abstraction to combinations of operators
☆18Sep 6, 2019Updated 6 years ago
Alternatives and similar repositories for Intensional-computation
Users that are interested in Intensional-computation are comparing it to the libraries listed below
Sorting:
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆16Feb 18, 2025Updated last year
- Haskell port of the Tensor Algebra COmpiler☆16Nov 18, 2019Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- A stack-based, interpreted programming language implemented in livescript.☆10Sep 11, 2016Updated 9 years ago
- The Titan programming language.☆12Apr 16, 2024Updated last year
- ☆22May 19, 2016Updated 9 years ago
- Closure calculus implementation☆12Jun 25, 2019Updated 6 years ago
- A typed logic programming language embedded in Haskell☆50Mar 3, 2013Updated 13 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- ☆12May 22, 2016Updated 9 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Organizational system for a library☆11Jun 11, 2024Updated last year
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15May 22, 2024Updated last year
- ☆23Sep 22, 2021Updated 4 years ago
- Pawns functional/imperative programming language compiler etc☆11Apr 16, 2025Updated 11 months ago
- Compositional type checking for Haskell☆38Apr 14, 2011Updated 14 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Oct 8, 2020Updated 5 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- Numerical snippets & tests☆12Jan 5, 2026Updated 2 months ago
- A concatenative programming language founded on the unholy trinity of Forth, Lisp and RDF triples.☆71Jan 2, 2011Updated 15 years ago
- Transducers for Idris: a library for composable algorithmic transformation.☆32Jul 28, 2017Updated 8 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- The Brown Benchmark for Table Types (B2T2)☆67Jul 27, 2025Updated 7 months ago
- (early experiments toward) a version-control system for structured data☆19Jul 23, 2023Updated 2 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- The source code translations from The Reasoned Schemer to Clojure core.logic☆14Sep 4, 2018Updated 7 years ago
- source code for the bondi programming language☆45Feb 17, 2019Updated 7 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Feb 22, 2018Updated 8 years ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- Alternative Core language for GHC plugins☆39Feb 15, 2016Updated 10 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated 2 years ago