Scott encoding

[suhr]

It would be great to have a Scott encoding support for numbers and lists, as an alternative to Church encoding.

[ifrh]

In reply to #11 (comment)

It would be great to have a Scott encoding support for numbers and lists, as an alternative to Church encoding.

From what I see, there is support for Scott numbers, or am I missing something of your point?

lci/src/.lcirc

Lines 117 to 144 in 2deb0d4

	# --- Scott-encoding of numerals --------------------------------------
	#
	# Note: often Scott encoding is presented as
	# 0 = \z.\s.z Succ = \n.\z.\s.s n
	# But this has the annoying side-effect that 0 is the same as True,
	# so we just inverse the two arguments (so Scott-0 == Church-0).
	# '0' = \s.\z.z;
	# Succ = \n.\s.\z.s n;
	# Pred = \n.n I 0;
	# IsZero = \n.n (\x.False) True;
	# Add = \n.n
	# (\pred.\m.Add pred (\s.\z.s m)) # \s.\z.s m is Succ m
	# (\m.m);
	# Monus = \n.n
	# (\n_pred.\m.m
	# (\m_pred.Monus n_pred m_pred)
	# n)
	# (\m.0);
	# Mult = \n.n (\pred.\m.Add m (Mult pred m)) (\m.0);
	# Exp = \n.\m.m (\pred.Mult n (Exp n pred)) 1;
	# Equal = \n.n
	# (\n_pred.\m.m
	# (\m_pred.Equal n_pred m_pred) # n,m != 0
	# False) # n != 0, m == 0
	# IsZero; # n == 0, so check if m == 0

[suhr]

Oh, cool. Are lists also Scott encoded? Also, does it works for pretty-printing too?