Abstract
This paper explores the consequences of enforcing referential transparency in database languages. It is argued that preserving referential transparency is the fundamental difference between functional and procedural languages. The significant features of a database implemented, manipulated and queried using functional languages are briefly described. The consequences of preserving referential transparency in the implementation, manipulation and query languages are described.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
