不動点コンビネータ
1. Fixed-point combinatorIn computer science, a fixed-point combinator (or fixpoint combinator) is a higher-order function that computes a fixed point of other functions. A fixed point of a function f is a value that f doesn't change (x such that x = f). Consider the function f(x) = x. 0 and 1 are fixed points of this function, because 0 = 0 and 1 = 1. This function has no other fixed points. A very different example comes up with many familiar markup languages.
Read “Fixed-point combinator” on English Wikipedia
Read “不動点コンビネータ” on Japanese Wikipedia
Read “Fixed-point combinator” on DBpedia
Read “Fixed-point combinator” on English Wikipedia
Read “不動点コンビネータ” on Japanese Wikipedia
Read “Fixed-point combinator” on DBpedia
Discussions
Log in to talk about this word.