corecursion造句
例句與造句
- The discussion below provides several examples in Haskell that distinguish corecursion.
- Corecursion can produce both self-referential data structures.
- This shows the usefulness of corecursion rather than recursion for dealing with infinite data structures.
- Corecursion need not produce an infinite object; a corecursive queue is a particularly good example of this phenomenon.
- Also note that the examples used in this article predate the attempts to define corecursion and explain what it is.
- It's difficult to find corecursion in a sentence. 用corecursion造句挺難的
- Corecursion is related to coinduction, and can be used to compute particular instances of ( possibly ) infinite objects.
- Corecursion is a particularly important concept in functional programming, where corecursion and codata allow total languages to work with infinite data structures.
- Corecursion is a particularly important concept in functional programming, where corecursion and codata allow total languages to work with infinite data structures.
- Such potentially infinite data structures are used for applications such as I / O . Using codata entails the usage of such operations as corecursion.
- An "'apomorphism "'( from " inductive data type, an apomorphism models primitive corecursion over a coinductive data type.
- This is more naturally framed as corecursion, building up from the initial values, tracking at each step two successive values see corecursion : examples.
- This is more naturally framed as corecursion, building up from the initial values, tracking at each step two successive values see corecursion : examples.
- Just as subtrees are natural for recursion ( as in a depth-first search ), forests are natural for corecursion ( as in a breadth-first search ).
- Generating and computing with streams requires lazy evaluation, either implicitly in a lazily evaluated language or by creating and forcing codata and can be iterated over using ( guarded ) corecursion.
- Corecursion is often used in conjunction with lazy evaluation, to produce only a finite subset of a potentially infinite structure ( rather than trying to produce an entire infinite structure at once ).
更多例句: 下一頁(yè)