Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-15T06:52:13.575Z Has data issue: false hasContentIssue false

Functional programming languages for AI problem solving

Published online by Cambridge University Press:  07 July 2009

Eleanor Bradley
Affiliation:
Artificial Intelligence Applications institute, University of Edinburgh, UK

Abstract

Many problem domains exhibit inherent parallelism, and parallel systems which capture and exploit this can be used to look for efficient solutions to AI problems. Functional programming languages are expected to be efficiently realisable on fifth generation hardware. A rational reconstruction of AI programming paradigms is used to investigate the programmability and performance of functional languages in this particular area.

Three languages—Standard ML, Hope+ and Miranda—are used in the rational reconstruction, each language being used to implement three applications. Results indicate that functional programming languages have become much more useable in recent years, and have the potential to become useful tools in AI problem solving. A brief annotated bibliography of texts which covers the introduction to, theory and implementation issues of, functional programming languages, is included.

Type
Research Article
Copyright
Copyright © Cambridge University Press 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Burstall, RM, MacQueen, DB and Sanella, DT, 1980, HOPE: An experimental applicative language. Technical Report CSR-62–80, Department of Computer Science, University of Edinburgh.CrossRefGoogle Scholar
Bradley, E, 1988a, ALICE progress: Applications study. Technical Report AIAI/PSG123/88, AIAI, University of Edinburgh.Google Scholar
Bradley, E, 1988b, “An overview of the ALICE system at AIAI” airing 5.Google Scholar
Cripps, MD, Darlington, J, Field, AJ, Harrison, PG and Reeve, MJ, 1987, The design and implementation of ALICE: A parallel graph reduction machine. Technical report, ICST.Google Scholar
Church, A, 1941, The Calculi of Lambda Conversion, Princeton University Press, Princeton, NJ.Google Scholar
Gabriel, RP, 1985 Performance and Evaluation of Lisp Systems, Computer Systems Series, The MIT Press.CrossRefGoogle Scholar
Glaser, H, 1987, ALICE Hope Interpreter User Manual. Technical Report IC/FPR/DOC/4, ICST.Google Scholar
Harper, R, 1986, Introduction to Standard ML. Technical Report ECS-LFCS-86–14, LFCS, University of Edinburgh.Google Scholar
Harper, R, MacQueen, D and Milner, R, 1986, Standard ML, Technical Report ECS-LFCS-86–2, LFCS, University of Edinburgh.Google Scholar
Hopkins, S, Michaelson, GJ and Wallace, AM, 1989, “Parallel imperative and functional approaches to visual scene labelling”, Image & Vision Computing, 7(3) 178193.CrossRefGoogle Scholar
Perry, N, 1987, Hope+C: A continuation extension for Hope+. Technical Report IC/FPR/LANG2.5.1/21, ICST.Google Scholar
Perry, N, 1988, Hope+. Technical Report IC/FPR/LANG/2.5.1/17, ICST.Google Scholar
Prideaux, T, 1987, ALICE Hope User Manual. Technical Report IC/FPR/DOC/1, ICST.Google Scholar
Perry, N and Sephton, KM, 1988, Hope+ Compiler Release 3.2 (SUN3 UNIX). Technical Report IC/FPR/ LANG/2.5.1/14, ICST.Google Scholar
Trehan, R, 1988, A Comparison of Committed Choice Non-Deterministic Logic Languages through the Prolog Equation Solving System (PRESS). Technical Report AIAI-PR-13, AIAI, University of Edinburgh.Google Scholar
Turner, D, 1985, “Miranda: a non-strict functional language with polymorphic types” In: IFIP International Conference on Functional Programming Languages and Computer Architectures.CrossRefGoogle Scholar
Turner, D, 1986, “An overview of Miranda” SIGPLAN Notices.CrossRefGoogle Scholar
Wikström, Å, 1987, Functional Programming Using Standard ML, Prentice-Hall.Google Scholar