Skip to main content

Scoped referential transparency in a functional database language with updates

  • Conference paper
  • First Online:
Advances in Databases (BNCOD 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1405))

Included in the following conference series:

Abstract

We describe in brief a lazy functional database language Relief, which supports an entity-function model and provides for update and the input of data by means of functions with side-effects. An eager let construct is used within the lazy graph reduction mechanism to sequence the effects. To redress the loss of referential transparency we have implemented an effects checker which can identify referentially transparent regions or scopes within Relief.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Ayres and P.J.H. King: Extending the semantic power of functional database query languages with associational facilities. In Actes du Xieme Congres INFORSID, pp301-320, Aix-en-Provence, France, May 1994.

    Google Scholar 

  2. Chih-Ping Chen and Paul Hudak: Rolling Your Own Mutable ADT — A connection between Linear Types and Monads. ACM Symposium on Principles of Programming Languages, January 1997

    Google Scholar 

  3. M. Derakhshan: A Development of the Grid File for the Storage of Binary Relations Ph.D. Thesis, Birkbeck College, University of London, 1989

    Google Scholar 

  4. Anthony J. Field, Peter G. Harrison: Functional Programming. Addison-Wesley 1988

    Google Scholar 

  5. David K. Gilford and John M. Lucassen: Integrating Functional and Imperative Programming. In Proceedings of the ACM Conference on Lisp and Functional Programming, Cambridge, Massachussets, pp28–39, ACM, 1986

    Google Scholar 

  6. Giorgio Ghelli, Renzo Orsini, Alvaro Pereira Paz, Phil Trinder: Design of an Integrated Query and Manipulation Notation for Database Languages, Technical Report FIDE/92/41, University of Glasgow, UK, 1992.

    Google Scholar 

  7. Paul Hudak: Conception, Evolution, and Application of Functional Programming Languages. ACM Computing Surveys, Vol. 21, No. 3, September 1989 pp359–411

    Article  Google Scholar 

  8. Peter King, Mir Derakhshan, Alexandra Poulovassilis, Carol Small: TriStarp — An Investigation into the Implementation and Exploitation of Binary Relational Storage Structures. Proceedings of the 8th BNCOD, York 1990

    Google Scholar 

  9. P.F.Meredith: Extending a Lazy Functional Database Language with Updates. Thesis for Submission. Birkbeck College, University of London, 1998

    Google Scholar 

  10. J. Nievergelt, H. Hinterberger, K.C. Seveik: The Grid File: An Adaptable, Symmetric, Multikey File Structure. ACM TODS, Vol 9, No 1, March 1984, pp38–71

    Article  Google Scholar 

  11. A. Poulovassillis: FDL: An Integration of the Functional Data Model and the Functional Computational Model, Proceedings of the 6th BNCOD, July 1988, Cambridge University Press, pp215–236.

    Google Scholar 

  12. A. Poulovassilis: The Implementation of FDL, a Functional Database Language. The Computer Journal, Vol 35, No 2, 1992

    Google Scholar 

  13. A. Poulovassilis and P. J. H. King: Extending the Functional Data Model to Computational Completeness. Proceedings of EDBT'90, pp75–91, Venice 1990. Springer-Verlag, LNCS 416.

    Google Scholar 

  14. David W. Shipman: The Functionanal Data Model and the Data Language DAPLEX. ACM TODS, Vol 6, No 1, March 1981, pp 140–173

    Article  Google Scholar 

  15. David Sutton, Carol Small: Extending Functional Database Languages to Update Completeness. Proceedings of 13th BNCOD, Manchester, 1995

    Google Scholar 

  16. Phil Trinder: Comprehensions, a Query Notation for DBPLs. The 3rd International Workshop on DBPLs, “Bulk Types and Persistent Data”. August 1991, Nafplion, Greece. Morgan Kaufman Publishers.

    Google Scholar 

  17. G.M.A. Verheijen, J. Van Bekkum: NIAM: An Information Analysis Method. In “Information Systems Design Methodologies: A Comparative Review”, T.W.Olle et al. (eds), North-Holland, 1982

    Google Scholar 

  18. Philip Wadler: Comprehending Monads. ACM Conference on Lisp and Functional Programming, Nice, June 1990

    Google Scholar 

  19. Philip Wadler: Monads for Functional Programming. In “Advanced Functional Programming”, Proceedings of the Bastad Spring School, May 1995, LNCS vol 925

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Suzanne M. Embury Nicholas J. Fiddian W. Alex Gray Andrew C. Jones

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meredith, P.F., King, P.J.H. (1998). Scoped referential transparency in a functional database language with updates. In: Embury, S.M., Fiddian, N.J., Gray, W.A., Jones, A.C. (eds) Advances in Databases. BNCOD 1998. Lecture Notes in Computer Science, vol 1405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053477

Download citation

  • DOI: https://doi.org/10.1007/BFb0053477

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64659-4

  • Online ISBN: 978-3-540-69112-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics