Search references for ANONYMOUS RECURSION. Phrases containing ANONYMOUS RECURSION
See searches and references containing ANONYMOUS RECURSION!ANONYMOUS RECURSION
Recursion without calling a function by name
In computer science, anonymous recursion is recursion which does not explicitly call a function by name. This can be done either explicitly, by using a
Anonymous_recursion
Use of functions that call themselves
recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves
Recursion_(computer_science)
Alternate way to define a function in APL
denotes recursion or self-reference by the function, and ∇∇ denotes self-reference by the operator. Such denotation permits anonymous recursion. Error
Direct_function
Decentralized hacktivist collective
Anonymous is an international collective, organized as a decentralized group of activist and hacktivist individuals, best known for orchestrating cyberattacks
Anonymous_(hacker_group)
Higher-order function Y for which Y f = f (Y f)
combinators is sometimes called anonymous recursion. Anonymous function Fixed-point iteration Lambda calculus#Recursion and fixed points Lambda lifting
Fixed-point_combinator
In programming languages, the object or class the currently running code belongs to
recursion, and means that these methods can be overridden by derived classes or objects. By contrast, direct named recursion or anonymous recursion of
This_(computer_programming)
Function definition that is not bound to an identifier
behavior of a generically defined function, such as a loop or recursion pattern. Anonymous functions are a convenient way to specify such function arguments
Anonymous_function
calculus Cartesian closed category Applicative computing systems Anonymous recursion Evaluation strategy Explicit substitution SKI combinator calculus
Categorical_abstract_machine
Programming paradigm based on applying and composing functions
depth of recursion. This could make recursion prohibitively expensive to use instead of imperative loops. However, a special form of recursion known as
Functional_programming
Set of rules defining correctly structured Prolog programs
call optimization (TCO) for deterministic predicates exhibiting tail recursion or, more generally, tail calls: A clause's stack frame is discarded before
Prolog_syntax_and_semantics
Mathematical-logic system based on functions
calculus may be used to model arithmetic, Booleans, data structures, and recursion, as illustrated in the following sub-sections i, ii, iii, and § iv. There
Lambda_calculus
alambda function (alambda (n) (if (= n 0) 1 (* n (self (1- n))))) Anonymous recursion Hygienic macros Macro (computer science) Method chaining this (computer
Anaphoric_macro
Programming language family
storage management, dynamic typing, conditionals, higher-order functions, recursion, the self-hosting compiler, and the read–eval–print loop. The name LISP
Lisp_(programming_language)
Programming language feature
list is returned while the old is left intact.) The Haskell sample uses recursion to traverse the list, while the C sample uses iteration. Again, this is
First-class_function
Sequence of program instructions invokable by other software
suspend while another nested execution of the same callable executes. Recursion is a useful means to simplify some complex algorithms and break down complex
Function (computer programming)
Function_(computer_programming)
British computer scientist (1948-2019)
(b) the function is denoted by a symbol and thereby enables anonymous recursion. In 1996, Scholes invented direct functions or dfns (pronounced "dee funs")
John_M._Scholes
General-purpose programming language
commonly provide tail call optimization to allow for extensive use of recursion without stack overflow problems. Limitations in JVM bytecode complicate
Scala_(programming_language)
Programming paradigm based on objects
self, to refer to the current object. In languages that support open recursion, a method in an object can call other methods in the same object, including
Object-oriented_programming
recursive versus iterative implementation details, especially tail-recursion. In Julia anonymous functions are defined using the syntax (arguments)->(expression)
Examples of anonymous functions
Examples_of_anonymous_functions
Globalization meta-process
allow mutual recursion, which is, in a sense, more lifted than is supported in lambda calculus. Lambda calculus does not support mutual recursion and only
Lambda_lifting
Formalism in computer science
lambda calculus with a type of natural numbers and higher-order primitive recursion; in this system all functions provably computable in Peano arithmetic
Typed_lambda_calculus
Family of higher-order functions
second argument, and the rest of the result is never demanded, then the recursion will stop (e.g., head == foldr (\a b->a) (error "empty list")). This allows
Fold_(higher-order_function)
Hacker group
impairment of a protected computer. He is suspected of using the name "recursion" and assisting LulzSec in their early hack against Sony Pictures Entertainment
LulzSec
Programming language derived from Perl
ways: # Using recursion (with `if\else` construct) sub fact( UInt $n --> UInt ) { if $n == 0 { 1 } else { $n * fact($n-1) } } # Using recursion (with `if`
Raku_(programming_language)
System to identify resources on a network
to excessive length. RD: 1 bit Recursion Desired, indicates if the client means a recursive query. RA: 1 bit Recursion Available, in a response, indicates
Domain_Name_System
General-purpose programming language
language, supporting structured programming, lexical variable scope, and recursion, with a static type system. It was designed to be compiled to provide
C_(programming_language)
Coding language, extension for Erlang
concurrent programming via message passing (Actor model) Emphasis on recursion and higher-order functions instead of side-effect-based looping A full
LFE_(programming_language)
Programming language
features a static type system, type inference, parametric polymorphism, tail recursion, pattern matching, first class lexical closures, functors (parametric
OCaml
Programming language standard
favor the ubiquitous use of recursion that Scheme style prefers—what a Scheme programmer would express with tail recursion, a CL user would usually express
Common_Lisp
Overview of and topical guide to computer programming
Policy-based design Service-oriented architecture Service-oriented modeling Recursion Separation of concerns Threaded coding List of algorithms List of algorithm
Outline of computer programming
Outline_of_computer_programming
General-purpose programming language
documentation. Retrieved 30 April 2026. van Rossum, Guido (22 April 2009). "Tail Recursion Elimination". Neopythonic.blogspot.be. Archived from the original on 19
Python_(programming_language)
Programming language
that combine with primitive functions to perform types of iteration and recursion. Therefore, complex and extended transformations of a dataset can be expressed
K_(programming_language)
Logo programming language dialect
the best facilities for handling lists, files, input/output (I/O), and recursion. It can be used to teach most computer science concepts, as University
UCBLogo
(typically because no change to the current stack is required), and in deep recursion, tail calling can have substantial positive impact on performance, because
Perl_language_structure
Set of rules defining correctly structured programs
line to always be executed, even when x is 0, resulting in an endless recursion. While both space and tab characters are accepted as forms of indentation
Python_syntax_and_semantics
System for inter-process communication
to service such requests. OpenBinder takes care of reference counting, recursion back into the original thread, and the inter-process communication itself
OpenBinder
Mathematical formalism
( M ) {\displaystyle \operatorname {BV} (M)} and can be defined by recursion on the structure of the terms, as follows: An expression that contains
Lambda_calculus_definition
Algorithm for speeding up cellular automaton simulations
subpatterns in the tree are identical to each other and most branches of the recursion are short. For example, the pattern being studied may contain many copies
Hashlife
Cake-cutting problem
value for them is greater than their number, so the precondition for recursion is satisfied. Recursively divide the unmatched pieces Xk+1, ..., Xn among
Symmetric_fair_cake-cutting
Israeli military operation against Syria
men in Daraa". SOHR. 4 November 2025. Retrieved 7 January 2026. "New recursion: Israeli forces infiltrate Khan Arnaba and arrest four members of a family"
Israeli intervention in Syria (2024–present)
Israeli_intervention_in_Syria_(2024–present)
Genus of Asian apes
self-embedded vocal motifs in wild orangutans, and the selective evolution of recursion". Annals of the New York Academy of Sciences. 1549 (1): 219–229. doi:10
Orangutan
Programming statement for branching control based on a value
the basis of the McCarthy formalism: its usage replaces both primitive recursion and the mu-operator. The earliest Fortran compilers supported the computed
Switch_statement
Programma 101 1932 Péter, Rózsa Published a series of papers grounding recursion theory as a separate area of mathematical research, setting the foundation
List of pioneers in computer science
List_of_pioneers_in_computer_science
Computer programming function
Map (parallel pattern) In a non-strict language that permits general recursion, such as Haskell, this is only true if the first argument to fmap is strict
Map_(higher-order_function)
Components of a mathematical or logical formula
distinct ground terms of a height up to h can be computed by the following recursion formula: θ0 = f0, since a ground term of height 0 can only be a constant
Term_(logic)
American activist and programmer (born 1953)
change it to the empty string (that is, no password) instead, to re-enable anonymous access to the systems. Around 20 percent of the users followed his advice
Richard_Stallman
proved (with Robert I. Soare) the low basis theorem, with applications to recursion theory and reverse mathematics Steven E. Jones (Ph.D. 1978) – physicist
List of Vanderbilt University people
List_of_Vanderbilt_University_people
Programming language with English-like syntax
These other features included: Free-form code User-defined functions Recursion Locale-based processing Support for extended character sets such as Unicode
COBOL
2011 edition of the C++ programming language standard
maximum number of types. Though compilers will have an internal maximum recursion depth for template instantiation (which is normal), the C++11 version
C++11
Mathematical theory of data types
inductive types. Two methods of generating inductive types are induction-recursion and induction-induction. A method that only uses lambda terms is Scott
Type_theory
High-level programming language
{decrement 1}} { upvar 1 $varName var incr var [expr {-$decrement}] } Recursion is supported in Tcl and simplified by the tailcall command. The command
Tcl_(programming_language)
Object which stores memory addresses in a computer program
support for pointers to all data types (including pointers to structures), recursion, multitasking, string handling, and extensive built-in functions. PL/I
Pointer (computer programming)
Pointer_(computer_programming)
Formal model in concurrency theory
, behaves like the process P {\displaystyle P} . Recursion Processes can be defined using recursion. Where F ( P ) {\displaystyle F(P)} is any CSP term
Communicating sequential processes
Communicating_sequential_processes
Part of a computer program where a given name binding is valid
them, and requires forward declaration in some cases, notably for mutual recursion. In other languages, such as Python, a name's scope begins at the start
Scope_(computer_programming)
All Latin and Greek roots beginning with G
cursive, cursor, cursory, discourse, excursion, incur, occur, recur, recursion, recursive, succor curv- bent Latin curvus "crooked, curved", from curvare
List of Greek and Latin roots in English/A–G
List_of_Greek_and_Latin_roots_in_English/A–G
Intellectual isolation through internet algorithms
(September 2018). "Redefining Filter Bubbles as (Escapable) Socio-Technical Recursion". Sociological Research Online. 23 (3): 637–654. doi:10.1177/1360780418763824
Filter_bubble
Programming language
function, showcasing implicit returns, default parameters, iterators, recursion, and while loops: proc fib(n: Natural): Natural = if n < 2: return n else:
Nim_(programming_language)
Language that uses manual communication and body language to convey meaning
languages. Such fundamental properties include duality of patterning and recursion. Duality of patterning means that languages are composed of smaller, meaningless
Sign_language
Retrieved 24 February 2015. Bruno, Eric (7 November 2022). "Curly Braces #6: Recursion and tail-call optimization". Archived from the original on 17 July 2024
Comparison of C Sharp and Java
Comparison_of_C_Sharp_and_Java
Basic notion of sameness in mathematics
introduction, it wasn't used again in print until 1618 (61 years later), in an anonymous Appendix in Edward Wright's English translation of Descriptio, by John
Equality_(mathematics)
Aṣṭādhyāyī, which contains the use of metarules, transformations, and recursions, originally for the purpose of systematizing the grammar of Sanskrit.
Timeline_of_mathematics
Programming language
declarations to define pointer types, or when record declarations led to mutual recursion, or when an identifier may or may not have been used in an enumeration
Pascal_(programming_language)
Dialect of Lisp programming language
provides Lisp features such as lists, symbol processing, function mapping, anonymous functions (lambda expressions), s-expressions (excluding improper lists)
NewLISP
Programming language
Double precision floating point numbers First-class function values: anonymous procedures and reporters On the fly interactions: NetLogo command center
NetLogo
American mathematician
MIT News. Retrieved January 16, 2013. Smith, Gerry (January 15, 2013). "Anonymous hacks MIT sites to post Aaron Swartz tribute, call to arms' Source Says"
Hal_Abelson
16-bit IBM minicomputer introduced in 1965
called SIMPL. Without extra arrangements to protect the return address, recursion is impossible: If SIMPL calls itself, or called a subprogram that called
IBM_1130
Comprehensive outline of core abstractions in the field of computer science
Used to encapsulate code, promoting reusability and maintainability. Recursion A method where the solution to a problem depends on solutions to smaller
List of abstractions (computer science)
List_of_abstractions_(computer_science)
Comparison of two programming languages
smaller, though the size impact is only visible in large programs, and that recursion works faster. C allows for functions to accept a variable number of parameters
Comparison_of_Pascal_and_C
ANONYMOUS RECURSION
ANONYMOUS RECURSION
Surname or Lastname
English
English : occupational name for someone who hewed or quarried marl, or a topographic name for someone who lived on a patch of clay soil, from a derivative of Middle English marl (Old French marle, Late Latin margila, from earlier marga, probably of Gaulish origin, with the ending added under the influence of the synonymous argilla).
Surname or Lastname
Jewish (Ashkenazic)
Jewish (Ashkenazic) : occupational name for a cantor in a synagogue, from Yiddish zinger ‘singer’.English : variant of Sanger 2, in fact a Middle English recoinage from the verb sing(en) ‘to sing’.German : variant of Sänger (see Sanger 1) in the sense of ‘poet’.Isaac Merrit Singer, inventor of the eponymous sewing machine, was born in 1811 in Pittstown, NY, the son of German immigrant Adam Reisinger. He had five wives and fathered 24 children. Singer, who incorporated his company as the Singer Manufacturing Company in 1864, left a fortune worth $13 million to his various heirs.
Boy/Male
Arabic, Hindu, Indian
Synonymous of Lord
Surname or Lastname
English
English : occupational name for someone who was employed in the private living quarters of his master, rather than in the public halls of the manor. The name represents a genitive or plural form of Middle English cha(u)mbre ‘chamber’, ‘room’ (Latin camera), and is synonymous in origin with Chamberlain, but as that office rose in the social scale, this term remained reserved for more humble servants of the bedchamber.
ANONYMOUS RECURSION
ANONYMOUS RECURSION
Girl/Female
Muslim
Lioness
Boy/Male
Muslim
Sound, Unimpaired, Sane, Sincere, Safe, Happy, Peaceful
Girl/Female
American, Australian, British, English, French, German, Latin
Lame; Female Version of Claude
Boy/Male
Hindu, Indian, Telugu, Traditional
Large-eared Lord
Girl/Female
Scandinavian
Abbreviation of Katherine. Pure.
Boy/Male
Welsh
God is good.
Girl/Female
Hindu, Indian
She who Eternally Resides in the Forests of Vrindavan
Boy/Male
Hindu
Bestowed of success
Boy/Male
German
Bright; Shining Intellect
Boy/Male
Tamil
ANONYMOUS RECURSION
ANONYMOUS RECURSION
ANONYMOUS RECURSION
ANONYMOUS RECURSION
ANONYMOUS RECURSION
a.
Having the character of a synonym; expressing the same thing; conveying the same, or approximately the same, idea.
n.
One who is anonymous; also sometimes used for "pseudonym."
a.
Troublesome; annoying.
a.
Having the same derivation; allied radically; conjugate; -- said of certain words, as man, mankind, manhood, etc.
a.
Anodyne.
a.
Synonymous.
a.
Published under the name of some one other than the author.
a.
Relating to an eponym; giving one's name to a tribe, people, country, and the like.
n.
The quality or state of being anonymous; anonymousness; also, that which anonymous.
a.
Having a similar sound, but different orthography and different meaning; -- said of certain words, as al/ and awl; hair and hare, etc.
a.
Having joint or equal signification; synonymous.
a.
Not known or mentioned by name; anonymous; as, a nameless writer.
adv.
In an anonymous manner; without a name.
a.
Nameless; of unknown name; also, of unknown or unavowed authorship; as, an anonymous benefactor; an anonymous pamphlet or letter.
n.
The quality of being paronymous; also, the use of paronymous words.
n.
A paronymous word.
a.
Same as Eponymous.
a.
Without an author; without authority; anonymous.
n.
Sometimes synonymous with Gelatin.
n.
The state or quality of being anonymous.