Her lambda ifadesinin sabit bir noktası vardır ve sabit nokta birleştiricisi bir lambda ifadesini girdi olarak alan ve çıktı olarak bu ifadenin sabit bir noktasını üreten bir "fonksiyon" dur. Önemli bir sabit nokta birleştirici, yinelemeli tanımlar vermek için kullanılan Y birleştiricidir.
Every lambda expression has a fixed point, and a fixed-point combinator is a "function" which takes as input a lambda expression and produces as output a fixed point of important fixed-point combinator is the Y combinator used to give recursive definitions.
Potentially sensitive or inappropriate content
Examples are used only to help you translate the word or expression searched in various contexts. They are not selected or validated by us and can contain inappropriate terms or ideas. Please report examples to be edited or not to be displayed. Potentially sensitive, inappropriate or colloquial translations are usually marked in red or in orange.
