SKNPR Calculus

From Esolang
Jump to navigation Jump to search
SKNPR Calculus
Paradigm(s) Functional
Designed by User:Hakerh400
Appeared in 2022
Computational class Turing complete
Major implementations Implemented
File extension(s) .txt

SKNPR Calculus is an esoteric computational model invented by User:Hakerh400 in 2022.

Overview

SKNPR calculus has the following combinators: S, K, N, P and R. It has the following reduction rules:

K a b          --->  a
S a b c        --->  a c (b c)
R a b N        --->  a
R a b (P c d)  --->  b c d

Two combinators are equal iff they have the same name. Two expressions are equal iff both of them can be reduced to the same expression using reduction rules, plus function extensionality (Expression a is equal to expression b if for any expression x, expressions a x and b x can be reduced to the same expression).