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