[Haskell-cafe] Chuch encoding of data structures in Haskell

[Brandon S. Allbery KF8NH]

On May 27, 2010, at 19:07 , Brandon S. Allbery KF8NH wrote:
> reordered_cons  :: (t -> (t1 -> t2)) -> t -> (t1 -> t2)
> churchedNumeral :: (t -> t         ) -> t -> t
>
> t unifies with (t1 -> t2), giving us a Church numeral made up of  
> (t1,t2).  (I think.)


Which also explains why that record representation isn't used:  it's  
as inefficient as Peano numbers are.

-- 
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery at kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery at ece.cmu.edu
electrical and computer engineering, carnegie mellon university    KF8NH


-------------- next part --------------
A non-text attachment was scrubbed...
Name: PGP.sig
Type: application/pgp-signature
Size: 195 bytes
Desc: This is a digitally signed message part
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20100527/a32232b0/PGP.bin