Purely functional programming
Semantic Scholar uses AI to extract papers important to this topic.
We study a probabilistic version of coherence spaces and show that these objects provide a model of linear logic. We build a… Expand This article demonstrates how a powerful and expressive abstraction from concurrency theory—monads of resumptions—plays a dual… Expand We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The… Expand We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is… Expand We answer the following question: Can a deque (doubleended queue) be implemented in a purely functional language such that each… Expand "Some half dozen persons have written technically on combinatory logic, and most of these, including ourselves, have published… Expand Category theorists invented monads in the 1960’s to concisely express certain aspects of universal algebra. Functional… Expand Large functional programs are often constructed by decomposing each big task into smaller tasks which can be performed by simpler… Expand Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional… Expand