This project features a version of Unlambda reduced to only the S and K combinators, which is the minimum necessary for Turing completeness. It is functionally the same as SKI calculus, but with terms distinguished with a preceding apostrophe as opposed to parentheses; e.g. SKK(KS) = (((SK)K)(KS)) = '''SSK'KS. It also does not have the I combinator, which is actually redundant and is equivalent to ''SKK (that is, for all X, '''SKKX will reduce to the same output as 'IX).
Examples: Formula: '''SKKX Description: equivalent to the I combinator; i.e. '''SKKX evaluates to X Formula: '''S''SKK''SKKX Description: evaluates to 'XX (self-application of X), implemented in normal SKI as SII Formula: ''''S'K'S''SKKKXY Description: evaluates to 'YX (reversal combinator) Formula: '''S'K''S''SKK''SKK''S''S'KSK'K''S''SKK''SKKX Description: Y combinator; creates an infinite chain of self-applied X's Formula: ''''SSS'S''SKKS Description: Just a little thingy.
