Corecursion and Recursion (computer science)

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Corecursion and Recursion (computer science)

Corecursion vs. Recursion (computer science)

In computer science, corecursion is a type of operation that is dual to recursion. In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem.

Call stack

In computer science, a call stack is a stack data structure that stores information about the active subroutines of a computer program.

Call stack and Corecursion · Call stack and Recursion (computer science) · See more »

Coinduction

In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects.

Coinduction and Corecursion · Coinduction and Recursion (computer science) · See more »

Computer science

Computer science is the study of computation, information, and automation.

Computer science and Corecursion · Computer science and Recursion (computer science) · See more »

Depth-first search

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures.

Corecursion and Depth-first search · Depth-first search and Recursion (computer science) · See more »

Factorial

In mathematics, the factorial of a non-negative denoted is the product of all positive integers less than or equal The factorial also equals the product of n with the next smaller factorial: \begin n! &.

Corecursion and Factorial · Factorial and Recursion (computer science) · See more »

Functional programming

In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions.

Corecursion and Functional programming · Functional programming and Recursion (computer science) · See more »

Haskell

Haskell is a general-purpose, statically-typed, purely functional programming language with type inference and lazy evaluation.

Corecursion and Haskell · Haskell and Recursion (computer science) · See more »

Imperative programming

In computer science, imperative programming is a programming paradigm of software that uses statements that change a program's state.

Corecursion and Imperative programming · Imperative programming and Recursion (computer science) · See more »

Lazy evaluation

In programming language theory, lazy evaluation, or call-by-need, is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (by the use of sharing).

Corecursion and Lazy evaluation · Lazy evaluation and Recursion (computer science) · See more »

Primitive recursive function

In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops (that is, an upper bound of the number of iterations of every loop is fixed before entering the loop).

Corecursion and Primitive recursive function · Primitive recursive function and Recursion (computer science) · See more »

Python (programming language)

Python is a high-level, general-purpose programming language.

Corecursion and Python (programming language) · Python (programming language) and Recursion (computer science) · See more »

Recurrence relation

In mathematics, a recurrence relation is an equation according to which the nth term of a sequence of numbers is equal to some combination of the previous terms.

Corecursion and Recurrence relation · Recurrence relation and Recursion (computer science) · See more »

Recursion

Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself.

Corecursion and Recursion · Recursion and Recursion (computer science) · See more »

Self-reference

Self-reference is a concept that involves referring to oneself or one's own attributes, characteristics, or actions.

Corecursion and Self-reference · Recursion (computer science) and Self-reference · See more »

Stack (abstract data type)

In computer science, a stack is an abstract data type that serves as a collection of elements with two main operations.

Corecursion and Stack (abstract data type) · Recursion (computer science) and Stack (abstract data type) · See more »

Stream (computing)

In computer science, a stream is a sequence of potentially unlimited data elements made available over time.

Corecursion and Stream (computing) · Recursion (computer science) and Stream (computing) · See more »

Tail call

In computer science, a tail call is a subroutine call performed as the final action of a procedure.

Corecursion and Tail call · Recursion (computer science) and Tail call · See more »

Tree traversal

In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting (e.g. retrieving, updating, or deleting) each node in a tree data structure, exactly once.

Corecursion and Tree traversal · Recursion (computer science) and Tree traversal · See more »