Skip to search formSkip to main contentSkip to account menu

Purely functional programming

Known as: Purely functional language, Purely functional programming language, Pure functional language 
In computer science, purely functional programming usually designates a programming paradigm—a style of building the structure and elements of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We present a new programming model for deterministic parallel computation in a pure functional language. The model is monadic and… 
Highly Cited
2011
2006
2006
This article demonstrates how a powerful and expressive abstraction from concurrency theory—monads of resumptions—plays a dual… 
2006
2006
This thesis is about the design and implementation of a debugging tool which helps Haskell programmers understand why their… 
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… 
Highly Cited
1999
Highly Cited
1993
Highly Cited
1993
  • S. JonesP. Wadler
  • ACM-SIGACT Symposium on Principles of Programming…
  • 1993
  • Corpus ID: 9751593
We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is… 
Highly Cited
1992
Highly Cited
1992
"Some half dozen persons have written technically on combinatory logic, and most of these, including ourselves, have published… 
Highly Cited
1992
Highly Cited
1992
  • P. Wadler
  • Mathematical Structures in Computer Science
  • 1992
  • Corpus ID: 251176
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional… 
Highly Cited
1992
Highly Cited
1992
  • W. Chin
  • LFP '92
  • 1992
  • Corpus ID: 16710277
Large functional programs are often constructed by decomposing each big task into smaller tasks which can be performed by simpler…