polymorphic recursion (also referred to as Milner–Mycroft typability or the Milner–Mycroft calculus) refers to a recursive parametrically polymorphic...

articles Subtype polymorphism and Generic programming). Parametricity Polymorphic recursion Type class#Higher-kinded polymorphism Trait (computer programming)...

necessary for disambiguation. For instance, type inference with polymorphic recursion is known to be undecidable. Furthermore, explicit type annotations...

depth of recursion. This could make recursion prohibitively expensive to use instead of imperative loops. However, a special form of recursion known as...

natural numbers (System T) or even full recursion (like PCF). In contrast, systems that introduce polymorphic types (like System F) or dependent types...

Knuth–Bendix completion algorithm List of undecidable problems Polymorphic recursion Risch algorithm Semidecidability Complexity Zoo: Class RE Korfhage...

algorithm. However, many extensions to the type system of ML, such as polymorphic recursion, can make the inference of the principal type undecidable. Other...

Procedures can return multiple results. Tail recursion is explicitly requested with the "jump" keyword. /* Tail recursion */ export sp; sp( bits32 n ) { jump sp_help(...

imperative language. Used in this way, the Y combinator implements simple recursion. The lambda calculus does not allow a function to appear as a term in...

recursion, and means that these methods can be overridden by derived classes or objects. By contrast, direct named recursion or anonymous recursion of...

elimination is important since all iteration in Flix is expressed through recursion. The Flix compiler disallows most forms of unused or redundant code, including:...

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...

high-level, functional programming language. It is known for its use of the polymorphic Hindley–Milner type system, which automatically assigns the data types...

fact many template implementations implement flow control only through recursion, as seen in the example below. Though the syntax of template metaprogramming...

polymorphism. Essentially, a polymorphic function or datatype constructor may require that one of its arguments is also polymorphic. Generalized algebraic data...

virtual method) Rapid application development (sometimes Rapid prototyping) Recursion Refinement Reflective programming (reflection) Responsibility-driven design...

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...

Phil.) from the University of Oxford in 1984 with a dissertation titled "Recursion theories on the continuous functionals". Thompson's doctoral adviser was...

typically correspond to error conditions such as undefined behavior, infinite recursion, or unrecoverable errors. In Bounded Quantification with Bottom, Pierce...

motivations for these quantifiers. In applications of the language to recursion theory, such as the arithmetical hierarchy, bounded quantifiers add no...

that would only allow the writer to construct valid proofs with its polymorphic type system. ML was turned into a compiler to simplify using LCF on different...

-> [b] map _ [] = [] map f (x : xs) = f x : map f xs In Haskell, the polymorphic function map :: (a -> b) -> [a] -> [b] is generalized to a polytypic...

and Bertrand Russell. Simple types is sometimes also meant to exclude polymorphic and dependent types. First-order logic quantifies only variables that...

admit a restricted kind of polymorphic types, that is the types in prenex normal form. However, because they feature some recursion operators, their computing...

Milner's algorithm is complete and extended it to support systems with polymorphic references. In the simply typed lambda calculus, types T are either atomic...

call optimization (TCO) for deterministic predicates exhibiting tail recursion or, more generally, tail calls: A clause's stack frame is discarded before...

terms of a fold and the C sample in terms of recursion. Finally, the Haskell function has a polymorphic type, as this is not supported by C we have fixed...

that explored the connections between diverse mathematical theories like recursion theory, type theory, category theory, and denotational semantics, and...

the first functional programming language. Unlike Fortran, it supported recursion and conditional expressions, and it also introduced dynamic memory management...

definitions must be available to the translation unit that uses them. Recursion can be used with a function of this type, but the recursive call must...