Abstract:
A prime concern in the design of any general purpose programming language should be the ease and safety of working with natural numbers, particularly in conjunction with discrete data structures. This theme of commitment to the naturals as the basic numeric data type is explored in the context of a lazy functional language. Non-Title Keywords: structural correspondence, numeric types, total functions, closed systems, functional programming, lazy evaluation.
Citations
|
1415
|
The Definition of Standard ML
– Milner, Tofte, et al.
- 1990
|
|
1122
|
Introduction to Functional Programming
– Bird, Wadler
- 1988
|
|
249
|
Recursive functions of symbolic expressions and their computation by machine
– MCCARTHY
- 1960
|
|
244
|
Why functional programming matters
– Hughes
- 1989
|
|
72
|
CONS should not evaluate its arguments
– Friedman, Wise
- 1976
|
|
65
|
Exact Real Computer Arithmetic with Continued Fractions
– Vuillemin
- 1987
|
|
38
|
Exact real arithmetic: A case study in higher order programming
– Boehm, Cartwright, et al.
- 1986
|
|
34
|
Strictness analysis | a practical approach
– Clack, Jones
- 1985
|
|
30
|
The semantic elegance of applicative languages
– Turner
- 1981
|
|
15
|
Path semantics
– Bloss, Hudak
- 1987
|
|
13
|
eds.). Abstract Interpretation of Declarative Languages
– Abramsky, Hankin
- 1987
|
|
3
|
The C Programming Language, 2nd edition, Prentice-Hall
– Kernighan, Ritchie
- 1988
|
|
3
|
Recursion Equations as a Programming Language", in Functional Programming and its Applications
– Turner
- 1982
|
|
1
|
jr., "A Lazy Evaluator
– Henderson, Morris
- 1976
|
|
1
|
Functional Programming and Proofs of Program Correctness
– Turner
- 1982
|
|
1
|
User Manual and Report (2nd edition), Springer-Verlag
– Wirth, Pascal
- 1975
|