- recursive functional
- мат. рекурсивный функционал
Большой англо-русский и русско-английский словарь. 2001.
recursive functional
Смотреть что такое "recursive functional" в других словарях:
Recursive descent parser — A recursive descent parser is a top down parser built from a set of mutually recursive procedures (or a non recursive equivalent) where each such procedure usually implements one of the production rules of the grammar. Thus the structure of the… … Wikipedia
Functional programming — In computer science, functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state and mutable data. It emphasizes the application of functions, in contrast with the… … Wikipedia
Recursive ascent parser — In computer science, Non Deterministic Recursive Ascent Parsing is an implementation technique for bottom up parsers that uses mutually recursive functions instead of a stack automaton. This allows for a more functional, declarative… … Wikipedia
Nominal group (functional grammar) — Those five beautiful shiny Jonathan apples sitting on the chair In systemic functional grammar (SFG), a nominal group is a group of words which expresses an entity. A nominal group is widely regarded as synonymous to noun phrase in other… … Wikipedia
Kent Recursive Calculator — Infobox programming language name = KRC paradigm = functional year = 1981 designer = David Turner developer = latest release version = latest release date = latest test version = latest test date = typing = implementations = dialects = influenced … Wikipedia
List of functional programming topics — This is a list of functional programming topics. Contents 1 Foundational concepts 2 Lambda calculus 3 Combinatory logic 4 Intuitionistic logic … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Inductive inference — This article is about the mathematical concept, for inductive inference in logic, see Inductive reasoning. Around 1960, Ray Solomonoff founded the theory of universal inductive inference, the theory of prediction based on observations; for… … Wikipedia
Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… … Wikipedia
Tail recursion — In computer science, tail recursion (or tail end recursion) is a special case of recursion in which the last operation of the function is a recursive call. Such recursions can be easily transformed to iterations. Replacing recursion with… … Wikipedia
