ruski 0.0.2

RuSKI is a simple implementation of combinator calculus.
Documentation
  • Coverage
  • 43.75%
    42 out of 96 items documented7 out of 57 items with examples
  • Size
  • Source code size: 56.9 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 5.57 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 10s Average build duration of successful builds.
  • all releases: 10s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • johker/ruski
    0 0 0
  • crates.io
  • Dependencies
    • —
  • Versions
  • Owners
  • johker

RuSKI

Ruski is a simple, zero-dependency implementation of combinator calculus in Rust. It is based on the crate lambda_calculus and adds elements from Wolfram

Features

  • Parser for SKI expressions
  • β reduction of SKI expressions (currently: leftmost outermost, leftmost innermost)
  • Tree representation of expressions with shared subexpressions.
  • Graph representation of reductions with shard reductions paths (draft)