Examples of using Functional programming languages in English and their translations into Bulgarian
{-}
-
Colloquial
-
Official
-
Medicine
-
Ecclesiastic
-
Ecclesiastic
-
Computer
Functional programming languages and computer architecture.
More than a dozen non-strict, purely functional programming languages existed.
Functional programming languages are also called declarative.
This led to new approaches to interactive theorem proving andhas influenced the development of subsequent functional programming languages.
Most functional programming languages are based upon the lambda calculus.
It is a mathematical abstraction rather than a programming language- butit forms the basis of almost all current functional programming languages.
Most functional programming languages, such as ML, Haskell, and API, have garbage collection built in.
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 are designed to sit on the lambda calculus.
So, while those optimizations are safe in purely functional programming languages, compilers of typical imperative programming usually have to assume the worst.
Functional programming languages are typically less efficient in their use of CPU and memory than imperative languages such as C and Pascal.
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.
Functional programming languages, especially the purely have been more widely used academically than in the development of commercial software.
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.
Many functional programming languages can be viewed as elaborations on the lambda calculus.
History==Following the release of Miranda by Research Software Ltd, in 1985, interest in lazy functional languages grew: by 1987,more than a dozen non-strict, purely functional programming languages existed.
Many Functional Programming languages can thus be considered as elaborations on this lambda calculus.
Especially since the development of Hindley- Milner type inference in the 1970s, functional programming languages have tended to use typed lambda calculus, as opposed to the untyped lambda calculus used in Lisp and its variants(such as Scheme).
Functional programming languages, especially purely functional ones such as Hope, have largely been emphasized in academia rather than in commercial software development.
An exception to this common behaviour is found in functional programming languages, where subprograms can have no side effects, and will always return the same result if repeatedly called with the same arguments.
In total functional programming languages, such as Charity and Epigram, all functions are total and must terminate.
In pure functional programming languages such as Haskell, subprograms can have no side effects, and will always return the same result if repeatedly called with the same arguments.
In strictly functional programming languages such as Haskell, subprograms can have no side effects, and will always return the same result if repeatedly called with the same arguments.
However, prominent functional programming languages such as Common Lisp, Scheme, Clojure, Racket, Erlang, OCaml, Haskell, and F have been used in industrial and commercial applications by a wide variety of organizations.
At the conference on Functional Programming Languages and Computer Architecture(FPCA'87) in Portland, Oregon, there was a strong consensus that a committee be formed to define an open standard for such languages. .
At the conference on Functional Programming Languages and Computer Architecture(FPCA'87) in Portland, Oregon, a meeting was held during which participants formed a strong consensus that a committee should be formed to define an open standard for such languages. .