Abstract
The advantages ensuing from the availability of set data abstractions in a high-level programming language are widely recognized. In particular, sets can be used conveniently in languages for rapid software prototyping, where the speed of execution—although desirable—is not the most stringent requirement; and in problem-specification languages, where specifications are not even expected to be always executable. Highly representative languages which embody sets are Z [Spi88], SETL [SDDS86], and Gödel [HL94].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cantone, D., Omodeo, E., Policriti, A. (2001). Logic Programming with Sets. In: Set Theory for Computing. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3452-2_13
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3452-2_13
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2905-1
Online ISBN: 978-1-4757-3452-2
eBook Packages: Springer Book Archive