• In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator): p.26  is a higher-order function (i.e., a function which...
    36 KB (5,182 words) - 18:42, 26 June 2025
  • first-order logic Lawvere's fixed-point theorem Discrete fixed-point theorems Earle-Hamilton fixed-point theorem Fixed-point combinator, which shows that every...
    11 KB (1,278 words) - 00:51, 3 February 2024
  • Thumbnail for Fixed point (mathematics)
    computer science, a fixed-point combinator is a higher-order function f i x {\displaystyle {\mathsf {fix}}} that returns a fixed point of its argument function...
    14 KB (1,696 words) - 10:48, 30 May 2025
  • Thumbnail for Least fixed point
    fixed point (lfp or LFP, sometimes also smallest fixed point) of a function from a partially ordered set ("poset" for short) to itself is the fixed point...
    10 KB (1,474 words) - 07:07, 10 May 2025
  • Combinatory logic (redirect from Combinator)
    interesting combinator is the fixed point combinator or Y combinator, which can be used to implement recursion. S and K can be composed to produce combinators that...
    42 KB (5,301 words) - 09:10, 5 April 2025
  • Y combinator may refer to: Y Combinator, an American tech startup accelerator Y combinator (mathematics), a fixed-point combinator This disambiguation...
    170 bytes (51 words) - 04:44, 19 November 2023
  • rec is an extension of the simple let expression which uses the fixed-point combinator to implement recursion. Dana Scott's LCF language was a stage in...
    41 KB (5,006 words) - 18:17, 2 December 2023
  • attractor and, with probability 1, form a dense set in the latter. Fixed-point combinator Cobweb plot Markov chain Infinite compositions of analytic functions...
    15 KB (2,172 words) - 08:33, 25 May 2025
  • The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it...
    22 KB (3,236 words) - 23:13, 15 May 2025
  • "Fixed-Point Combinators in JavaScript". Bene Studio. Medium. Retrieved 2 August 2020. "CS 6110 S17 Lecture 5. Recursion and Fixed-Point Combinators"...
    90 KB (12,117 words) - 02:29, 15 June 2025
  • {Y}}N)} , where Y {\displaystyle {\textsf {Y}}} denotes Curry's fixed-point combinator. Then X = ( N X ) = ( ( m X ) Z ) {\displaystyle X=(NX)=((mX)Z)}...
    15 KB (2,406 words) - 04:27, 24 April 2025
  • or "getting your fix", taking addictive drugs (from the 1960s) Fixed point combinator, in mathematics All pages with titles beginning with Fix All pages...
    2 KB (221 words) - 23:04, 6 October 2024
  • convenience. (This expression above is simply `Yk, where Y denotes a fixed point combinator.) More built-ins were introduced in Unlambda version 2. Input is...
    8 KB (964 words) - 02:59, 11 August 2024
  • Phonetic Alphabet letter for a close front rounded vowel Y combinator, a fixed-point combinator in combinatory logic Y, the Bessel function Y, dependent...
    5 KB (702 words) - 20:19, 11 April 2025
  • expressible in first-order logic with the addition of a suitable least fixed-point combinator. Recursive functions can be defined with this and the order relation...
    63 KB (7,784 words) - 06:53, 25 April 2025
  • Thumbnail for Quine (computing)
    program, and then solving for a fixed point. Computer programming portal Diagonal lemma Droste effect Fixed point combinator Self-modifying code Self-interpreter...
    25 KB (2,564 words) - 00:57, 20 March 2025
  • \lambda } -calculus, but also important differences exist (e.g. fixed point combinator Y has normal form in combinatory logic but not in λ {\displaystyle...
    18 KB (2,168 words) - 17:36, 27 May 2025
  • Thumbnail for Recursion
    awakening – Vivid and convincing dream about awakening from sleep Fixed point combinator – Higher-order function Y for which Y f = f (Y f)Pages displaying...
    31 KB (3,669 words) - 01:15, 24 June 2025
  • semantics, where another least fixed point theorem is used for the same purpose as the first recursion theorem. Fixed-point combinators, which are used in lambda...
    21 KB (3,095 words) - 15:38, 17 March 2025
  • abstraction Church–Rosser theorem Extensionality Church numeral Fixed point combinator SKI combinator calculus B, C, K, W system SECD machine Graph reduction...
    3 KB (205 words) - 20:20, 20 February 2025
  • as g = foldr f v Also, in a lazy language with infinite lists, a fixed point combinator can be implemented via fold, proving that iterations can be reduced...
    39 KB (2,787 words) - 17:28, 5 December 2024
  • factorial n = foldl (*) 1 [1..n] -- Point-free style factorial = foldr (*) 1 . enumFromTo 1 Using Haskell's Fixed-point combinator allows this function to be written...
    50 KB (4,584 words) - 23:45, 3 June 2025
  • Thumbnail for Eigenfunction
    λ is a complex scalar eigenvalue. Eigenvalues and eigenvectors Fixed point combinator Fourier transform eigenfunctions Hilbert–Schmidt theorem Spectral...
    17 KB (2,338 words) - 18:46, 20 June 2025
  • Thumbnail for Legacy of Alan Turing
    Good–Turing frequency estimation Turing completeness Turing degree Turing fixed-point combinator Turing Institute Turing Lecture Turing machine Turing patterns Turing...
    65 KB (5,815 words) - 17:58, 17 June 2025
  • \lambda } -calculus, but also important differences exist (e.g. fixed point combinator Y has normal form in combinatory logic but not in λ {\displaystyle...
    21 KB (3,293 words) - 20:34, 1 June 2025
  • Statement in mathematical logic Fixed point (mathematics) – Element mapped to itself by a mathematical function Fixed-point combinator – Higher-order function...
    2 KB (353 words) - 09:17, 5 June 2025
  • available, but can instead be expressed with a fixed point combinator. But unfortunately, the fixpoint combinator cannot be formulated in a typed version of...
    61 KB (8,534 words) - 19:20, 10 March 2025
  • 7. Larry Wos, William McCune (September 1988). "Searching for Fixed Point Combinators by Using Automated Theorem Proving: A Preliminary Report" (PDF)...
    6 KB (703 words) - 02:38, 24 March 2025
  • arbitrary collection of base types, product types (tuples) and a fixed point combinator: data Lam :: * -> * where Lift :: a -> Lam a -- ^ lifted value Pair...
    14 KB (1,325 words) - 23:03, 23 December 2024
  • function. This anonymous recursion can be produced generically via fixed-point combinators. Anonymous recursion is primarily of use in allowing recursion...
    12 KB (1,514 words) - 12:49, 30 April 2025