Skip to search formSkip to main contentSemantic Scholar
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.
2006
2006
This article demonstrates how a powerful and expressive abstraction from concurrency theory—monads of resumptions—plays a dual… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method… Expand
Is this relevant?
2006
2006
This thesis is about the design and implementation of a debugging tool which helps Haskell programmers understand why their… Expand
Is this relevant?
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
Is this relevant?
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
Is this relevant?
1993
1993
We answer the following question: Can a deque (doubleended queue) be implemented in a purely functional language such that each… Expand
Is this relevant?
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
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Category theorists invented monads in the 1960’s to concisely express certain aspects of universal algebra. Functional… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional… Expand
Is this relevant?