The foundations of functional programming languages are examined from both historical and technical perspectives. Their evolution is traced through several critical periods: early work on lambda calculus and combinatory calculus, Lisp, Iswim, FP, ML, and modern functional languages such as Miranda ’ and Haskell. The fundamental premises on which
|
1418
|
The Definition of Standard ML
– Milner, Tofte, et al.
- 1997
|
|
812
|
A theory of type polymorphism in programming
– Milner
- 1978
|
|
715
|
On computable numbers, with an application to the Entscheidungsproblem
– Turing
- 1936
|
|
482
|
The Implementation of Functional Programming Languages
– Jones
- 1987
|
|
390
|
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
– Stoy
- 1977
|
|
308
|
Towards a theory of type structure
– Reynolds
- 1974
|
|
280
|
How to make ad-hoc polymorphism less ad hoc
– Wadler, Blott
- 1989
|
|
160
|
Lectures on a mathematical theory of computation
– Scott
- 1981
|
|
131
|
Miranda: A non-strict functional language with polymorphic types
– TURNER
- 1985
|
|
104
|
Views: A way for pattern matching to cohabit with data abstraction
– WADLER
- 1987
|
|
92
|
Revised report on the algorithmic language scheme
– Rees, Clinger
- 1986
|
|
86
|
Operational Semantics and Polymorphic Type Inference
– Tofte
- 1987
|
|
70
|
Partial polymorphic type inference and higher-order uni cation
– Pfenning
- 1988
|
|
69
|
A Theory of Programming Language Semantics
– Milne, Strachey
- 1976
|
|
65
|
Three approaches to type structure
– Reynolds
- 1985
|
|
50
|
Lucid, the Dataflow Programming Language
– Wadge, Ashcroft
- 1985
|
|
33
|
Recursion Equations as a Programming Language
– Turner
|
|
31
|
The Semantic Elegance of Applicative Languages
– Turner
|
|
20
|
Correct and optimal implementations of recursion in a simple programming language
– Vuillemin
- 1974
|
|
17
|
Highlights of the history of the lambda-calculus
– Rosser
- 1992
|
|
15
|
From Frege to Gödel
– Heijenoort
- 1967
|
|
14
|
A survey of proposed architectures for the execution of functional languages
– Vegdahl
- 1984
|
|
14
|
A new array operation
– Wadler
- 1986
|
|
14
|
Evaluation of functional programs on the Flagship machine
– Watson, Watson
- 1987
|
|
13
|
Matrix Algebra and Applicative Programming
– Wise
- 1987
|
|
12
|
A Mathematics of Arrays
– Mullin
- 1988
|
|
12
|
A new scheme for writing functional operating systems
– Stoye
- 1984
|
|
10
|
final revision accepted
– Received
- 1983
|
|
9
|
Systolic programming: a paradigm of parallel processing
– Shapiro
- 1985
|
|
7
|
GRIP---A High-Performance Architecture for Parallel Graph Reduction
– Jones, Clack, et al.
- 1987
|
|
5
|
FAC: a functional APL language
– Tu, Perlis
- 1986
|
|
5
|
Introduction to ORWELL
– Wadler
- 1985
|
|
3
|
Efficient compilation of pattern-matching. In The implementation of Functional Programming
– Wadler
- 1987
|
|
2
|
Id Nouveau. Computation Structures Group Memo 265
– Nikhil, Pingali, et al.
- 1986
|
|
2
|
ber die Bausteine der mathematischen Logik
– Schnfinkel
- 1924
|
|
2
|
FAC: Functional Array Calculator and its Application to APL and Functional Programming
– Tu
- 1986
|
|
2
|
The English Language
– Turner
- 1966
|
|
2
|
The Semantic Analysis of Functional Programs: Theory and Practice
– YOUNG
- 1988
|
|
1
|
Detecting global variables in denotational specifications
– A
- 1985
|
|
1
|
Semi-applicative programming: An example
– SRIDHARAN
- 1985
|
|
1
|
Selected Reprints on Dataflow and Reduction Architectures. The Computer
– THAKKAR
- 1987
|
|
1
|
Comparing the Church and Turing approaches: Two prophetic messages
– TRAKHTENBROT
- 1988
|
|
1
|
driven computer architectures
– TRELEAVEN, BROWNBRIDGE, et al.
- 1982
|
|
1
|
Computability and X-definability
– TURING
- 1937
|
|
1
|
A new implementation techinque for applicative languages
– TURNER
- 1979
|
|
1
|
Standard ML
– WIKSTRM
- 1988
|
