Absys
| Paradigm | Logic programming |
|---|---|
| First appeared | 1967 |
| Influenced | |
| Prolog | |
Absys was an early declarative programming language from the University of Aberdeen.[1] It anticipated a number of features of Prolog such as negation as failure, aggregation operators, the central role of backtracking[2] and constraint solving.[1] Absys was the first implementation of a logic programming language.[1]
The name Absys was chosen as an abbreviation for Aberdeen System.[1]
See also
References
- 1 2 3 4 Elcock, E.W. (1990). "Absys: the first logic programming language —A retrospective and a commentary". The Journal of Logic Programming. 9 (1): 1–17. doi:10.1016/0743-1066(90)90030-9.
- ↑ Kowalski, R. A. (1988). "The early years of logic programming" (PDF). Communications of the ACM. 31: 38. doi:10.1145/35043.35046.
- "ABSYS: An Incremental Compiler for Assertions", J.M. Foster et al., Mach Intell 4, Edinburgh U Press, 1969, pp. 423–429
This article is issued from
Wikipedia.
The text is licensed under Creative Commons - Attribution - Sharealike.
Additional terms may apply for the media files.