Примери коришћења Functional programming languages на Енглеском и њихови преводи на Српски
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
-
Latin
-
Cyrillic
Abstract machines for functional programming languages.
All functional programming languages are expression-oriented.
Iteration can be approximated using recursive techniques in functional programming languages.
Many functional programming languages can be viewed as elaborations on the lambda calculus.
In Proceedings of the 1981 conference on Functional programming languages and computer architecture(pp. 171-178).
Many functional programming languages can be viewed as embellishments to the lambda calculus.
Memoization is heavily used in compilers for functional programming languages, which often use call by name evaluation strategy.
Some functional programming languages do not define any looping constructs but rely solely on recursion to repeatedly call code.
This led to powerful new approaches to interactive theorem proving andhas influenced the development of many subsequent functional programming languages.
Functional programming languages have largely been emphasized in academia rather than in commercial software development.
It is a mathematical abstraction rather than a programming language-but it forms the basis of almost all current functional programming languages.
Functional programming languages, especially the purely have been more widely used academically than in the development of commercial software.
Though it is a mathematical abstraction rather than a programming language, it forms the basis of almost all functional programming languages today.
Functional programming languages, especially purely functional ones such as Hope, have largely been emphasized in academia rather than in commercial software development.
So, while those optimizations are safe in purely functional programming languages, compilers of typical imperative programming usually have to assume the worst.
A zipper is a technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents,especially in purely functional programming languages.
In strictly functional programming languages such as Haskell, subprograms can have no side effects, which means that various internal states of the program will not change.
Typed lambda calculi are foundational programming languages andare the base of typed functional programming languages such as ML and Haskell and, more indirectly, typed imperative programming languages. .
In functional programming languages, such as Haskell and Scheme, loops can be expressed by using recursion or fixed point iteration rather than explicit looping constructs.
While supporting all of the object-oriented features available in Java(and in fact, augmenting them in various ways),Scala also provides a large number of capabilities that are normally found only in functional programming languages.
For this reason,most programming languages and especially functional programming languages make an effort to prevent the above events from happening except under controlled conditions.
Most purely functional programming languages(notably Miranda and its descendents, including Haskell), and the proof languages of theorem provers, use lazy evaluation, which is essentially the same as call by need.
Unlike Java, Scala has many features of functional programming languages like Scheme, Standard ML and Haskell, including currying, type inference, immutability, lazy evaluation, and pattern matching.
Inductive functional programming, which uses functional programming languages such as Lisp or Haskell, and most especially inductive logic programming, which uses logic programming languages such as Prolog and other logical representations such as description logics, have been more prominent, but other(programming) language paradigms have also been used, such as constraint programming or probabilistic programming. .
Laboratory automation in a functional programming language.
Curry, a logic functional programming language, which allows programming concurrent systems.
Grass is a functional programming language that only uses the characters"W","w", and"v".
Unlambda is a minimalist functional programming language.
Unlambda is a minimal,"nearly pure" functional programming language invented by David Madore.