Persistent Functional Language
Se> (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) Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 - (6899 Reads) |
