|
|
- [Lambda], toy functional interpreter,
source and examples.
This is not intended to be a production FP system;
it is written in Pascal and is as small and simple as possible
(and is lacking a type-checker and a garbage collector).
- [PFL], parallel, communicating ~ CCS
- [LambdaLog], LFP = Logic + Functional Programming.
- Search the [bibliography] by keywords.
- Languages
See also [Logic Programming]
and [Programming Languages].
- L.Allison,
'Models for machine learning and data mining in functional programming',
Journal of Functional Programming, 15(1), pp.15-32,
doi:10.1017/S0956796804005301,
2005.
- L. Allison,
'Applications of recursively defined data structures',
Aust. Comp. J., 25(1), pp.14-20,
arxiv:2206.12795,
1993.
- L. Allison,
'Lazy Dynamic-Programming can be Eager',
Information Processing Letters, 43(4), pp.207-212,
doi:10.1016/0020-0190(92)90202-7,
1992.
- L. Allison,
'Circular programs and self-referential structures',
Software Practice and Experience, 19(2), pp.99-109,
doi:10.1002/spe.4380190202,
1989.
- L. Allison,
'Some applications of continuations',
The Computer Journal, 31(1), pp.9-11,
doi:10.1093/comjnl/31.1.9,
1988.
General Material
|
|