Persistent Functional Language
(PFL) A functional database language developed by Carol Small at Birkbeck College, London, UK and Alexandra Poulovassilis (now at {King' s College London}). In PFL, functions are defined equationally and bulk data is stored using a special class of functions called selectors. PFL is a lazy language, supports higher-order functions, has a strong polymorphic type inference system, and allows new user-defined data types and values. All functions, types and values persist in a database. Functions can be written which update all aspects of the database: by adding data to selectors, by defining new equations, and by introducing new data types and values. PFL is "semi-referentially transparent", in the sense that whilst updates are referentially opaque and are executed destructively, all evaluation is referentially transparent. Similarly, type checking is "semi-static" in the sense that whilst updates are dynamically type checked at run time, expressions are type checked before they are evaluated and no type errors can occur during their evaluation. ["{A Functional Approach to Database Updates (http://web.dcs.bbk.ac.uk/CS/Research/DBPL/papers/INFSYS93.abs.html)}", C. Small, Information Systems 18(8), 1993, pp. 581-95]. (1995-04-27) In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ag ] [ al ] [ Alex ] [ am ] [ an ] [ aq ] [ ar ] [ arc ] [ as ] [ aspect ] [ at ] [ az ] [ B ] [ b ] [ ba ] [ base ] [ bb ] [ be ] [ bs ] [ by ] [ C ] [ ca ] [ cc ] [ ch ] [ ci ] [ ck ] [ cl ] [ class ] [ cu ] [ D ] [ data ] [ database ] [ data type ] [ date ] [ DB ] [ DBPL ] [ dd ] [ de ] [ ding ] [ do ] [ du ] [ ec ] [ ed ] [ eg ] [ er ] [ error ] [ es ] [ evaluation ] [ exec ] [ execute ] [ expression ] [ fi ] [ file ] [ FL ] [ fo ] [ for ] [ FS ] [ Fun ] [ function ] [ functional ] [ functional database ] [ functional language ] [ ge ] [ gh ] [ gu ] [ h ] [ hat ] [ higher-order function ] [ hr ] [ ht ] [ id ] [ il ] [ in ] [ inference ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ K ] [ ke ] [ ki ] [ la ] [ language ] [ Lex ] [ li ] [ lk ] [ ls ] [ lu ] [ ly ] [ ma ] [ mall ] [ mil ] [ ml ] [ mo ] [ mod ] [ module ] [ ms ] [ N ] [ na ] [ nc ] [ ne ] [ nf ] [ NFS ] [ ng ] [ ni ] [ no ] [ ns ] [ op ] [ pa ] [ parent ] [ pe ] [ PFL ] [ ph ] [ polymorphic ] [ port ] [ pr ] [ query ] [ rc ] [ re ] [ referentially transparent ] [ rl ] [ ro ] [ roach ] [ ru ] [ run ] [ run time ] [ S ] [ se ] [ selector ] [ semi ] [ si ] [ spec ] [ st ] [ store ] [ struct ] [ su ] [ support ] [ sy ] [ system ] [ th ] [ tm ] [ to ] [ tp ] [ tr ] [ transparent ] [ tron ] [ tt ] [ type ] [ type inference ] [ ua ] [ uk ] [ up ] [ us ] [ user ] [ va ] [ value ] [ ve ] [ ws ] [ Y ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (6806 Reads) |
