Information for "Binary combinatory logic"

From HandWiki

Basic information

Display titleBinary combinatory logic
Default sort keyBinary combinatory logic
Page length (in bytes)4,845
Namespace ID0
Page ID249401
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Steve2012
Date of page creation18:30, 6 February 2024
Latest editorimported>Steve2012
Date of latest edit18:30, 6 February 2024
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (30)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
Binary combinatory logic (BCL) is a computer programming language that uses binary terms 0 and 1 to create a complete formulation of combinatory logic using only the symbols 0 and 1. Using the S and K combinators, complex boolean algebra functions can be made. BCL has applications in the theory of program...
Information from Extension:WikiSEO