In recent times there has been a great increase in interest in declarative programming languages, which are based on sound mathematical formalisms, independent of the machinery on which they are implemented. Such languages are easier to understand and debug, and have advantages with regard to program transformation and verification, and parallel implementation over conventional, imperative languages. In this essay I will discuss the various paradigms available for declarative programming, and also the object orientated programming paradigm, and put forward various ideas that I feel are of particular interest.
Get full access to this article
View all access options for this article.
References
1.
CardelliL. (1984). A semantics of multiple inheritance. Semantics of Data Types, International Symposium, Lecture Notes in Computer Science173. Springer Verlag.
2.
DarlingtonJ., FieldA. J., and PullH. (1985). The unification of functional and logic programming languages. Imperial College internal paper.
3.
GoldbergA., and RobsonD. (1983). Smalltalk-80. The Language and its Implementation.Addison-Wesley.
4.
HarrisonP. G., and ReeveM. J. (1987). The parallel graph reduction machine, Alice. Graph Reduction, Lecture Notes in Computer Science279. Springer Verlag.
ZanioloC. (1984). Object-orientated Programming in Prolog. Proceedings of the International Symposium on Logic Programming, Atlantic City, NJ. IEEE Computer Society Press, New York.
