• under Church encoding. The Church–Turing thesis asserts that any computable operator (and its operands) can be represented under Church encoding.[dubious...
    48 KB (8,544 words) - 11:33, 30 April 2025
  • structure of sets. Gödel sets can also be used to encode formulas in infinitary languages. Church encoding Description number Gödel numbering for sequences...
    11 KB (1,536 words) - 18:15, 7 May 2025
  • functional programming languages in general. The Church encoding is named in his honor. In his honor the Alonzo Church Award for Outstanding Contributions to Logic...
    24 KB (2,245 words) - 02:40, 27 February 2025
  • lambda calculus. Whereas Church encoding starts with representations of the basic data types, and builds up from it, Scott encoding starts from the simplest...
    10 KB (1,781 words) - 02:54, 7 July 2024
  • 1
    computability theory, natural numbers are represented by Church encoding as functions, where the Church numeral for 1 is represented by the function f {\displaystyle...
    32 KB (3,227 words) - 14:49, 1 April 2025
  • it may even turn out to be more efficient than other kinds of encoding. This encoding also has the advantage of being implementable in a statically typed...
    8 KB (901 words) - 17:00, 15 April 2024
  • apply the fixed-point combinator to may be expressed using an encoding, like Church encoding. In this case particular lambda terms (which define functions)...
    36 KB (5,183 words) - 19:02, 14 April 2025
  • input syntactic representations of terms under a suitable encoding (e.g., Church encoding). One may also consider a toy trivial computation model where...
    42 KB (5,301 words) - 09:10, 5 April 2025
  • projections. In 1936, Alonzo Church created a method for defining functions called the λ-calculus. Within λ-calculus, he defined an encoding of the natural numbers...
    57 KB (6,820 words) - 02:39, 2 May 2025
  • Thumbnail for Range of a function
    predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    6 KB (835 words) - 20:44, 7 January 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    3 KB (436 words) - 07:08, 28 January 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    3 KB (421 words) - 11:48, 16 March 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    4 KB (399 words) - 06:07, 7 May 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    4 KB (500 words) - 18:15, 17 May 2025
  • (2-tuple) can be defined in terms of TRUE and FALSE, by using the Church encoding for pairs. For example, PAIR encapsulates the pair (x,y), FIRST returns...
    89 KB (11,994 words) - 17:12, 1 May 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    4 KB (445 words) - 04:10, 4 October 2024
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    9 KB (863 words) - 22:44, 31 January 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    8 KB (1,098 words) - 15:54, 14 May 2025
  • Thumbnail for Map (mathematics)
    predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    6 KB (708 words) - 08:15, 6 November 2024
  • Thumbnail for Rule of inference
    predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    66 KB (7,292 words) - 09:00, 19 April 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    7 KB (846 words) - 03:34, 23 March 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    6 KB (884 words) - 06:49, 8 April 2025
  • Thumbnail for Domain of a function
    predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    8 KB (962 words) - 11:47, 12 April 2025
  • Thumbnail for Aleph number
    predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    17 KB (2,453 words) - 20:31, 6 May 2025
  • logic", Report No. 15 (2009/2010) of the Mittag-Leffler Institute. Alonzo Church, A formulation of the simple theory of types, The Journal of Symbolic Logic...
    9 KB (1,066 words) - 21:59, 16 April 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    14 KB (1,514 words) - 12:40, 12 May 2025
  • Thumbnail for Complement (set theory)
    predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    12 KB (1,515 words) - 07:59, 27 January 2025
  • Thumbnail for Codomain
    predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    9 KB (1,051 words) - 23:22, 5 March 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    6 KB (848 words) - 23:14, 4 May 2025
  • predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable...
    5 KB (618 words) - 03:46, 5 May 2025