Persistent Functional Language
Ctional language, database> (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 - (6847 Reads) |
