Persistent Functional Language
ATabase> (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 - (6887 Reads) |
