SKI combinators in Typescript
-
Updated
Jun 25, 2024 - TypeScript
SKI combinators in Typescript
Metaheuristic and hyperheuristic library for Rust using an extensible and performant combinator-based approach.
Simple Interpreter for the SKI combinator calculus
Automated CAD assembly generation based on Combinatory Logic Synthesis.
Construct parser combinators in R
Explore combinatory logic
Lambda Calculus Calculator and Combinators Calculus Calculator with Portable Scala Cats and other TypeLeves libraries
Parser-combinators with Multiplatform Kotlin Coroutines
A Scheme interpreter written in Haskell
TypeScript parser combinator library for building fast and convenient parsers.
A small parser combinator library written in Swift 5
[a]synchronous functional programming
CSS eaxmple programs for all. You can learn CSS from these examples. Thank you.
A Flock of Functions: Combinators, Lambda Calculus, & Church Encodings in JS
Combinators are higher-order functions that can combine or transform functions, enabling more abstract and concise code.
Functional assertion combinators.
Golang parser combinator library inspired by haskell parsec
Embedded HTML in Haskell
A PEG parser generator written in C++20.
Add a description, image, and links to the combinators topic page so that developers can more easily learn about it.
To associate your repository with the combinators topic, visit your repo's landing page and select "manage topics."