Talk:Binary combinatory logic

I think this article may not have reliable sources, but it deserves to live at least because of very concise and elegant definition of it's subject. Even if this is an original investigation, I suppose that it has no chances to be published standalone, yet contains useful information. I myself being logician haven't even realized that S and K combinators can be written in prefix codes in this way. But it's so obvious and elegant.

87.110.182.18 (talk) 21:40, 5 June 2012 (UTC)Anatoly.

External links modified

Hello fellow Wikipedians,

I have just modified one external link on Binary combinatory logic. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

• Added archive https://web.archive.org/web/20051119172250/http://homepages.cwi.nl:80/~tromp/cl/cl.html to http://homepages.cwi.nl/~tromp/cl/cl.html

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at {{Sourcecheck}}).

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

• If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
• If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 19:31, 2 November 2016 (UTC)