Applicative expressions for relational programming

dc.contributor.author	Ibrahim, Husain Ibrahim Haji	en_US
dc.date.accessioned	2024-08-14T17:52:55Z
dc.date.available	2024-08-14T17:52:55Z
dc.date.copyright	1992	en_US
dc.date.issued	1992
dc.degree.department	Department of Computer Science
dc.degree.level	Master of Science M.Sc.	en
dc.description.abstract	Functional programming comes in two flavors: one where "functions are first-class citizens" (we call this applicative) and one based on equations (we call this declarative). In relational programming, clauses play the role of equations. Hence pure Prolog is declarative. This thesis provides a basis for the relational analog of applicative functional programming. We provide a new concept of table. We define tables and relations with operators sufficient to translate Horn clauses into applicative form, and establish basic mathematical properties of these operators. We investigate applicative relational programming, and prove the existence of the least model for our applicative transformations of Horn-clause programs. We show how relations can be first-class citizens, using first-order relational variables and expressions. We devise mechanisms for modularity and genericity, and for local scoping of predicates.	en
dc.format.extent	72 pages
dc.identifier.uri	https://hdl.handle.net/1828/18278
dc.rights	Available to the World Wide Web	en_US
dc.subject	UN SDG 16: Peace, Justice, and Strong Institutions	en
dc.title	Applicative expressions for relational programming	en_US
dc.type	Thesis	en_US

Files

Now showing 1 - 1 of 1