Search results

...ast1=McBride|first1=Conor|last2=Paterson|first2=Ross|date=2008-01-01|title=Applicative programming with effects|journal=Journal of Functional Programming|volume=1 ...f> However, [[concatenative languages]] can be functional, while not being applicative.<ref>{{cite web|url=https://evincarofautumn.blogspot.com/2012/02/why-concat ...

....1145/800087.802798 |location=New York, NY, USA |publisher=Association for Computing Machinery |pages=128–135 |doi=10.1145/800087.802798 |isbn=978-1-4503-7396-8 [[Category:Applicative computing systems]] ...

...|last2=Krishnaswami |first2=Neel |title=Bidirectional Typing |journal=ACM Computing Surveys |date=23 May 2021 |volume=54 |issue=5 |page=98:19 |doi=10.1145/3450 .../dl.acm.org/doi/pdf/10.1145/234313.234418 |title=Type Systems |journal=ACM Computing Surveys |date=March 1996 |volume=28 |issue=1 |pages=263–264 |doi=10.1145/23 ...

For example, a nesting of operations in an applicative language like the following: ...ication software|desktop]], and [[web programming]], as [[Target language (computing)|target languages]], and for research purposes. ...

...title = Listlessness is Better than Laziness: An Algorithm that Transforms Applicative Programs to Eliminate Intermediate Lists ...|title=Listlessness is Better than Laziness: An Algorithm that Transforms Applicative Programs to Eliminate Intermediate Lists |publisher=Carnegie Mellon Univers ...

...as a network of asynchronous processes communicating by means of [[stream (computing)|streams]] of structured data chunks, called "information packets" (IPs). I ...al|doi=10.1147/sj.174.0383|title=Data Stream Linkage Mechanism|journal=IBM Systems Journal|volume=17|issue=4|pages=383–408|year=1978|last1=Morrison|first1=J. ...

...]-like programming language which was defined semantically in terms of the applicative expressions of [[lambda calculus]],<ref>{{cite journal |last=Landin |first= ...itle=Talking with Computers: Explorations in the Science and Technology of Computing |url=https://archive.org/details/talkingwithcompu00dean |url-access=registr ...

...[[synchronization (computer science)|synchronizing]] program [[execution (computing)|execution]] in some [[concurrent programming language]]s. Each is an objec | title= The Impact of Applicative Programming on Multiprocessing ...

...tical theory of computation]. Technical Monograph PRG-2, Oxford University Computing Laboratory, Oxford, England, November 1970.</ref><ref name="Research Group ...each other. Also, E1 or E2 might throw an exception which could [[Abort (computing)|terminate]] the execution of the other one. The sections below describe sp ...

...><ref>{{Cite book|url=https://books.google.com/books?id=nyFa5ngYThMC|title=Computing Meaning|editor1-last=Bunt|editor1-first=Harry|editor2-last=Muskens|editor2- In lambda calculus, a [[library (computing)|library]] would take the form of a collection of previously defined functi ...

...tail recursion to use a similar amount of memory as an equivalent [[loop (computing)|loop]]. The special case of tail-recursive calls, when a function calls it ...uter must "remember" the place it was called from, the ''[[Return address (computing)|return address]]'', so that it can return to that location with the result ...

...rification/holloway/nasa-97-16dasc-cmh.pdf|publisher=16th Digital Avionics Systems Conference (27–30 October 1997)|access-date=2006-11-16|url-status=dead|arch ...]s, [[automata theory]], [[control theory]], [[program semantics]], [[type systems]], and [[type theory]].<ref>Monin, pp.3-4</ref> ...

...c computations. In simpler terms, monads can be thought of as [[Interface (computing)|interfaces]] implemented on type constructors, that allow for functions to ...uage)|Haskell]], even offer pre-built definitions in their core [[library (computing)|libraries]] for the general monad structure and common instances.<ref name ...

...rogramming language|strict languages]] (also called eager languages, where applicative evaluation order is applied). The Z combinator has the next argument define ..._1\to t_2</math>. No fixed-point combinator can in fact be typed; in those systems, any support for recursion must be explicitly added to the language. ...

The mtl [[Library (computing)|library]], which is shipped with [[Glasgow Haskell Compiler]] (GHC), has t when (b < 0 || a < 0) (exitF 0.0) -- when :: Applicative f => Bool -> f () -> f () ...

===Computing=== ...689.2960081 |page=80 |location=New York, NY, US |publisher=Association for Computing Machinery |doi=10.1145/2959689.2960081 |isbn=978-1-4503-4464-7}}</ref>{{rp| ...

...as a data structure, giving rise to the [[macro (computer science)|macro]] systems that allow programmers to create new syntax or new [[domain-specific langua ...|first2=Richard L. |year=1978 |isbn=0127450408 |publisher=Association for Computing Machinery |pages=173–183}}</ref> He was inspired by [[Information Processin ...

==In computing== * [[Applicative computing systems]] ...

...volution, and application of functional programming languages |journal=ACM Computing Surveys |volume=21 |issue=3 |pages=359–411 |date=September 1989 |url=http:/ ...|J]], [[K (programming language)|K]] and [[Q (programming language from Kx Systems)|Q]] in financial analysis, and [[XQuery]]/[[XSLT]] for [[XML]].<ref name=" ...

...rency, CLOS-based IO) have been provided by implementations and [[Library (computing)|libraries]]. The Common Lisp ''[[character (computing)|character]]'' type is not limited to [[ASCII]] characters. Most modern imp ...