Function lambda_calculus::combinators::k

pub fn k() -> Term

K - the constant / discarding combinator.

K := λxy.x = λ λ 2 = true

Example

use lambda_calculus::combinators::k;
use lambda_calculus::arithmetic::{zero, one};
use lambda_calculus::reduction::beta_full;

assert_eq!(beta_full(k().app(zero()).app(one())), zero());