A programming model and foundation for lineage-based distributed computation
The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model, we call function passing, designed to provide a more principled substrate, or middleware, upon which to build data-centric distributed systems like Spark. A key idea is to buil...
Uložené v:
| Vydané v: | Journal of functional programming Ročník 28 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Cambridge, UK
Cambridge University Press
2018
|
| Predmet: | |
| ISSN: | 0956-7968, 1469-7653, 1469-7653 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model, we call function passing, designed to provide a more principled substrate, or middleware, upon which to build data-centric distributed systems like Spark. A key idea is to build up a persistent functional data structure representing transformations on distributed immutable data by passing well-typed serializable functions over the wire and applying them to this distributed data. Thus, the function passing model can be thought of as a persistent functional data structure that is distributed, where transformations performed on distributed data are stored in its nodes rather than the distributed data itself. One advantage of this model is that failure recovery is simplified by design – data can be recovered by replaying function applications atop immutable data loaded from stable storage. Deferred evaluation is also central to our model; by incorporating deferred evaluation into our design only at the point of initiating network communication, the function passing model remains easy to reason about while remaining efficient in time and memory. Moreover, we provide a complete formalization of the programming model in order to study the foundations of lineage-based distributed computation. In particular, we develop a theory of safe, mobile lineages based on a subject reduction theorem for a typed core language. Furthermore, we formalize a progress theorem that guarantees the finite materialization of remote, lineage-based data. Thus, the formal model may serve as a basis for further developments of the theory of data-centric distributed programming, including aspects such as fault tolerance. We provide an open-source implementation of our model in and for the Scala programming language, along with a case study of several example frameworks and end-user programs written atop this model. |
|---|---|
| AbstractList | The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model, we call function passing, designed to provide a more principled substrate, or middleware, upon which to build data-centric distributed systems like Spark. A key idea is to build up a persistent functional data structure representing transformations on distributed immutable data by passing well-typed serializable functions over the wire and applying them to this distributed data. Thus, the function passing model can be thought of as a persistent functional data structure that is distributed, where transformations performed on distributed data are stored in its nodes rather than the distributed data itself. One advantage of this model is that failure recovery is simplified by design – data can be recovered by replaying function applications atop immutable data loaded from stable storage. Deferred evaluation is also central to our model; by incorporating deferred evaluation into our design only at the point of initiating network communication, the function passing model remains easy to reason about while remaining efficient in time and memory. Moreover, we provide a complete formalization of the programming model in order to study the foundations of lineage-based distributed computation. In particular, we develop a theory of safe, mobile lineages based on a subject reduction theorem for a typed core language. Furthermore, we formalize a progress theorem that guarantees the finite materialization of remote, lineage-based data. Thus, the formal model may serve as a basis for further developments of the theory of data-centric distributed programming, including aspects such as fault tolerance. We provide an open-source implementation of our model in and for the Scala programming language, along with a case study of several example frameworks and end-user programs written atop this model. The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model, we call function passing , designed to provide a more principled substrate, or middleware, upon which to build data-centric distributed systems like Spark. A key idea is to build up a persistent functional data structure representing transformations on distributed immutable data by passing well-typed serializable functions over the wire and applying them to this distributed data. Thus, the function passing model can be thought of as a persistent functional data structure that is distributed , where transformations performed on distributed data are stored in its nodes rather than the distributed data itself. One advantage of this model is that failure recovery is simplified by design – data can be recovered by replaying function applications atop immutable data loaded from stable storage. Deferred evaluation is also central to our model; by incorporating deferred evaluation into our design only at the point of initiating network communication, the function passing model remains easy to reason about while remaining efficient in time and memory. Moreover, we provide a complete formalization of the programming model in order to study the foundations of lineage-based distributed computation. In particular, we develop a theory of safe, mobile lineages based on a subject reduction theorem for a typed core language. Furthermore, we formalize a progress theorem that guarantees the finite materialization of remote, lineage-based data. Thus, the formal model may serve as a basis for further developments of the theory of data-centric distributed programming, including aspects such as fault tolerance. We provide an open-source implementation of our model in and for the Scala programming language, along with a case study of several example frameworks and end-user programs written atop this model. |
| ArticleNumber | e7 |
| Author | HALLER, PHILIPP MÜLLER, NORMEN MILLER, HEATHER |
| Author_xml | – sequence: 1 givenname: PHILIPP surname: HALLER fullname: HALLER, PHILIPP email: phaller@kth.se organization: School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, SE-100 44 Stockholm, Sweden (e-mail: phaller@kth.se) – sequence: 2 givenname: HEATHER surname: MILLER fullname: MILLER, HEATHER email: heather.miller@epfl.ch organization: School of Computer and Communication Sciences, EPFL, CH-1015 Lausanne, Switzerland – sequence: 3 givenname: NORMEN surname: MÜLLER fullname: MÜLLER, NORMEN organization: Safeplace, DE-40667 Meerbusch, Germany |
| BackLink | https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-225189$$DView record from Swedish Publication Index (Kungliga Tekniska Högskolan) |
| BookMark | eNp9kFtLxDAQhYMouLv6A3wr-FxNmubSx2W9woIPXl5D0iY1a9vUpEX892btiqDovMzAfGc4c-Zgv3OdBuAEwTMEETu_hwWhrKAccRgLkz0wQzktUkYJ3gez7Trd7g_BPIRNRHhG-Aysl0nvXe1l29quTlpX6SaRXZUYN3aVHKzr4uiTxnZa1jpVMugqqWwYvFXjEOfStf04fJJH4MDIJujjXV-Ax6vLh9VNur67vl0t12mJCz6kGaUlkSwzKFdGEQW5ybk2muZUQcINZoQozDCmlGrIC57lmYIFM9IwanSOFyCd7oY33Y9K9N620r8LJ624sE9L4XwtXoZnkWUE8SLypxMfX30ddRjExo2-ixZFhmEMheU5jBSbqNK7ELw2orTTX4OXthEIim3U4lfUUYl-KL8c_afBO41slbdVrb9N_a36AEfOkRY |
| CitedBy_id | crossref_primary_10_1145_3563320 crossref_primary_10_1145_3360570 crossref_primary_10_1109_ACCESS_2019_2891285 crossref_primary_10_1145_3689772 |
| Cites_doi | 10.1145/2509136.2509547 10.1145/1159789.1159795 10.1007/978-3-662-44202-9_13 10.1017/S095679689700261X 10.1145/1408681.1408682 10.1145/1327452.1327492 10.1145/1086365.1086370 10.1145/237721.237794 10.1145/1272996.1273005 10.7551/mitpress/1086.001.0001 10.1145/2034675.2034690 10.1145/1159876.1159881 10.1016/0890-5401(92)90008-4 10.1017/S0956796804005209 10.1007/978-3-642-14107-2_17 10.1145/1806596.1806638 10.1016/j.tcs.2008.09.019 10.1145/2509136.2509516 |
| ContentType | Journal Article |
| Copyright | Copyright © Cambridge University Press 2018 |
| Copyright_xml | – notice: Copyright © Cambridge University Press 2018 |
| DBID | AAYXX CITATION 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U ADTPV AOWAS D8V |
| DOI | 10.1017/S0956796818000035 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic SwePub SwePub Articles SWEPUB Kungliga Tekniska Högskolan |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | Computer Science Database CrossRef |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Lineage-based distributed computation P. Haller et al. |
| EISSN | 1469-7653 |
| ExternalDocumentID | oai_DiVA_org_kth_225189 10_1017_S0956796818000035 |
| GroupedDBID | -1D -1F -2P -2V -E. -~6 -~N .DC .FH 09C 09E 0E1 29K 3V. 4.4 5GY 5VS 6OB 6~7 74X 74Y 7~V 85S 8FE 8FG 8R4 8R5 9M5 AAAZR AABES AABWE AACJH AAEED AAFUK AAGFV AAKTX AAMNQ AANRG AARAB AASVR AAUIS AAUKB ABBXD ABBZL ABEFU ABITZ ABJNI ABKKG ABMWE ABMYL ABQTM ABQWD ABROB ABTAH ABTCQ ABUWG ABVFV ABXAU ABZCX ABZUI ACBMC ACCHT ACETC ACGFS ACIMK ACMRT ACQFJ ACREK ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADGEJ ADKIL ADOCW ADOVH ADOVT ADVJH AEBAK AEBPU AEHGV AEMTW AENCP AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFKSM AFLOS AFLVW AFUTZ AGABE AGBYD AGJUD AGLWM AGOOT AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS AKZCZ ALMA_UNASSIGNED_HOLDINGS ALVPG ALWZO AQJOH ARABE ARAPS ARZZG ATUCA AUXHV AYIQA AZQEC BBLKV BCGOX BENPR BESQT BGHMG BGLVJ BJBOZ BLZWO BMAJL BPHCQ BQFHP C0O CAG CBIIA CCPQU CCQAD CCTKK CCUQV CDIZJ CFAFE CFBFF CGQII CHEAL CJCSC COF CS3 D-I DC4 DOHLZ DU5 DWQXO EBS EGQIC EJD GNUQQ HCIFZ HG- HST I.6 I.7 I.9 IH6 IKXGN IOEEP IOO IPYYG IS6 I~P J36 J38 J3A JHPGK JQKCU K6V K7- KAFGG KC5 KCGVB KFECR L98 LHUNA LW7 M-V M0N M7~ M8. NIKVX NMFBF NZEOI OK1 OYBOY P2P P62 PQQKQ PROAC PYCCK Q2X RAMDC RCA RIG ROL RR0 S6- S6U SAAAG T9M TWZ UT1 WFFJZ WQ3 WXU WXY WYP YYM ZDLDU ZJOSE ZMEZD ZY4 ZYDXJ ~V1 0R~ AAKNA AATMM AAYXX ABGDZ ABVKB ABVZP ABXHF ACAJB ACDLN ACEJA ACRPL ADNMO AEMFK AFFHD AFZFC AGQPQ AKMAY AMVHM ANOYL CITATION M48 PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS PUEGO Q9U ADTPV AOWAS D8V |
| ID | FETCH-LOGICAL-c398t-266c5a72f14bfb5b08f48efe646b058f3755b3733666e0898242b097faf76fe43 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000427266900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0956-7968 1469-7653 |
| IngestDate | Tue Nov 04 16:20:16 EST 2025 Sat Aug 23 12:36:41 EDT 2025 Tue Nov 18 22:33:03 EST 2025 Sat Nov 29 05:36:59 EST 2025 Wed Mar 13 05:35:36 EDT 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c398t-266c5a72f14bfb5b08f48efe646b058f3755b3733666e0898242b097faf76fe43 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | http://infoscience.epfl.ch/record/230304 |
| PQID | 2309687440 |
| PQPubID | 37264 |
| PageCount | 48 |
| ParticipantIDs | swepub_primary_oai_DiVA_org_kth_225189 proquest_journals_2309687440 crossref_citationtrail_10_1017_S0956796818000035 crossref_primary_10_1017_S0956796818000035 cambridge_journals_10_1017_S0956796818000035 |
| PublicationCentury | 2000 |
| PublicationDate | 2018 |
| PublicationDateYYYYMMDD | 2018-01-01 |
| PublicationDate_xml | – year: 2018 text: 2018 |
| PublicationDecade | 2010 |
| PublicationPlace | Cambridge, UK |
| PublicationPlace_xml | – name: Cambridge, UK – name: Cambridge |
| PublicationTitle | Journal of functional programming |
| PublicationTitleAlternate | J. Funct. Prog |
| PublicationYear | 2018 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | Dzik (S0956796818000035_ref7) 2013 S0956796818000035_ref33 S0956796818000035_ref10 S0956796818000035_ref30 S0956796818000035_ref28 S0956796818000035_ref26 Odersky (S0956796818000035_ref29) 2010 S0956796818000035_ref27 S0956796818000035_ref24 S0956796818000035_ref25 Shapiro (S0956796818000035_ref34) 2011 S0956796818000035_ref22 S0956796818000035_ref23 Matsakis (S0956796818000035_ref21) 2012 S0956796818000035_ref20 Rossberg (S0956796818000035_ref32) 2004; 5 Gunda (S0956796818000035_ref11) 2010 S0956796818000035_ref4 S0956796818000035_ref19 Agha (S0956796818000035_ref1) 1986 S0956796818000035_ref5 S0956796818000035_ref39 S0956796818000035_ref2 S0956796818000035_ref17 S0956796818000035_ref3 S0956796818000035_ref18 S0956796818000035_ref37 S0956796818000035_ref15 S0956796818000035_ref38 S0956796818000035_ref16 S0956796818000035_ref35 S0956796818000035_ref13 S0956796818000035_ref36 Pierce (S0956796818000035_ref31) 2002 S0956796818000035_ref14 Haller (S0956796818000035_ref12) 2016 S0956796818000035_ref8 S0956796818000035_ref9 S0956796818000035_ref6 |
| References_xml | – start-page: 5 volume-title: HotPar year: 2012 ident: S0956796818000035_ref21 – ident: S0956796818000035_ref22 doi: 10.1145/2509136.2509547 – ident: S0956796818000035_ref10 doi: 10.1145/1159789.1159795 – volume-title: Types and Programming Languages year: 2002 ident: S0956796818000035_ref31 – ident: S0956796818000035_ref27 – ident: S0956796818000035_ref23 doi: 10.1007/978-3-662-44202-9_13 – ident: S0956796818000035_ref25 – ident: S0956796818000035_ref2 doi: 10.1017/S095679689700261X – volume-title: Programming in Scala year: 2010 ident: S0956796818000035_ref29 – ident: S0956796818000035_ref18 doi: 10.1145/1408681.1408682 – ident: S0956796818000035_ref6 doi: 10.1145/1327452.1327492 – ident: S0956796818000035_ref33 doi: 10.1145/1086365.1086370 – start-page: 272 volume-title: OOPSLA year: 2016 ident: S0956796818000035_ref12 – volume: 5 start-page: 79 year: 2004 ident: S0956796818000035_ref32 article-title: Alice through the looking glass. publication-title: Trends Funct. Program. – ident: S0956796818000035_ref30 doi: 10.1145/237721.237794 – ident: S0956796818000035_ref19 doi: 10.1145/1272996.1273005 – ident: S0956796818000035_ref38 – ident: S0956796818000035_ref36 – start-page: 386 volume-title: SSS year: 2011 ident: S0956796818000035_ref34 – volume-title: ACTORS: A Model of Concurrent Computation in Distributed Systems year: 1986 ident: S0956796818000035_ref1 doi: 10.7551/mitpress/1086.001.0001 – ident: S0956796818000035_ref15 – volume-title: PLOS@SOSP year: 2013 ident: S0956796818000035_ref7 – ident: S0956796818000035_ref9 doi: 10.1145/2034675.2034690 – ident: S0956796818000035_ref4 doi: 10.1145/1159876.1159881 – ident: S0956796818000035_ref3 – ident: S0956796818000035_ref26 – ident: S0956796818000035_ref28 – start-page: 75 volume-title: OSDI year: 2010 ident: S0956796818000035_ref11 – ident: S0956796818000035_ref24 doi: 10.1016/0890-5401(92)90008-4 – ident: S0956796818000035_ref8 – ident: S0956796818000035_ref20 doi: 10.1017/S0956796804005209 – ident: S0956796818000035_ref14 doi: 10.1007/978-3-642-14107-2_17 – ident: S0956796818000035_ref5 doi: 10.1145/1806596.1806638 – ident: S0956796818000035_ref37 – ident: S0956796818000035_ref13 doi: 10.1016/j.tcs.2008.09.019 – ident: S0956796818000035_ref39 – ident: S0956796818000035_ref35 – ident: S0956796818000035_ref16 – ident: S0956796818000035_ref17 doi: 10.1145/2509136.2509516 |
| SSID | ssj0008258 |
| Score | 2.1857314 |
| Snippet | The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model, we call function passing, designed... The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model, we call function passing , designed... The most successful systems for "big data" processing have all adopted functional APIs. We present a new programming model, we call function passing, designed... |
| SourceID | swepub proquest crossref cambridge |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| SubjectTerms | Big Data Collection Computation Computer networks Data structures Fault tolerance Middleware Programming languages Substrates Theorems Transformations (mathematics) |
| SummonAdditionalLinks | – databaseName: Cambridge University Press Open Access Journals dbid: IKXGN link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NS8MwFH_MzYMX5ydOp-QgHsSytmm-jkOdijIEP9itNG2CQ51jm_79Jm1ap8LAg7dQkkfz8njvJXn5_QAOtclCWKpTD_Mo86LMTzyhfO2xwMTuJGVY8YJsgvX7fDAQtzUYlG9hbFllhXGQ3-Tn_GjjAv60M8yKGho16dxZCD0mqH2snF-IdeyhZcctQewUvwQNk8GEYR0aV9eDi37lpc3OiJc4fFZKeeOZw0n_kDyPu_A9fs0lpfNAo3lw6jX_b1prsOoSVtQtvqxDTY02oFmSQSDnGzbhpotcrderiYYoZ9hByShDuiJuMs0Jsmmt8WGeDZ8Zyixur6XcMu00l5n33IKH3vn96aXnqBq8FAs-80yYT0nCQh1EUksifa4jrrSiEZU-4RozQiS20IuUKp8LbjID6QumE82oVhHehvrobaR2ABGsgiQMcEIxiyTBgsrE7LtUJinJREhacFJpMnZqmcZFsRqLf6mvBX65XnHqYM8t-8bLoiHH1ZBxgfmxqHO7NIKvvzH7OtPFYi-24KgwjEqSxfM-Gz52Y2MF8fPsKTYeNeBi92_T2oMVk7rx4jCoDfXZ5F3tw3L6MRtOJwfO2D8BhT4J1w priority: 102 providerName: Cambridge University Press |
| Title | A programming model and foundation for lineage-based distributed computation |
| URI | https://www.cambridge.org/core/product/identifier/S0956796818000035/type/journal_article https://www.proquest.com/docview/2309687440 https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-225189 |
| Volume | 28 |
| WOSCitedRecordID | wos000427266900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAEN databaseName: Cambridge University Press Wholly Gold Open Access Journals customDbUrl: eissn: 1469-7653 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008258 issn: 1469-7653 databaseCode: IKXGN dateStart: 19910101 isFulltext: true titleUrlDefault: http://journals.cambridge.org/action/login providerName: Cambridge University Press – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1469-7653 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0008258 issn: 1469-7653 databaseCode: P5Z dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1469-7653 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0008258 issn: 1469-7653 databaseCode: K7- dateStart: 20010101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1469-7653 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0008258 issn: 1469-7653 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LbxMxEB7RlkMvlEcrQh_yoeKAsOqN169TFUoLVVEUIUBRL6u11y5VS1KStL-f8a53G4SUC5ddy7Ity2PPN37o-wAOA0YhygVHuc4rmlespMazQFWG2F06xb1uxCbUcKjHYzNKB27z9Kyy9Ym1o66mLp6RH2GobGTkamfHd79pVI2Kt6tJQmMNNrJ-P4vz_ELRzhPj7ke3XHsKa7e3mjVlNGbGvEyz-jptmVvhb4xaCjyXyURrADrb-t-uP4dnKfQkg2auvIAnfvIStlpZB5JW-Sv4MiDp1dYvxDVSa-WQclKR0EkwYXJGYoCK3ohGIKxIFRl4o3gWpl3dZl1yG76fnX47-UyT6AJ13OgFRcB2olT9kOU2WGGZDrn2wctcWiZ04EoIyyOJopSeaaMR4y0zKpRByeBzvgPrk-nEvwYiuM9KtEopucqt4EbaEndQvrJSVKYvevC-G_IiLZ150Tw7U8U_FuoBa61SuERgHnU0bldVeddVuWvYO1YV3mvN99ibR9v14G1j_q6lyMz98frHoJjOroqbxc8CfWOmzZvV7ezCJgZdujnG2YP1xeze78NT97C4ns8OYOPD6XD0Ff_nF-NPw4N6QuN3JC7_AEDu9xs |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LbxMxEB6VggQXylOEFvABOCAsvOv3AaGIUrVqiHooqOKyrL12WwFJSVIQf4rfyHhfDULKrQdulmWPvPZ4Hrb3-wCeRoxCtI-eciMqKipWUhtYpDpD3116zYNpyCb0eGyOjuzBGvzu_oVJzyo7m1gb6mrq0xn5KwyVrUpY7ezN2XeaWKPS7WpHodGoxX749RNTtvnrvW1c32d5vvPu8O0ubVkFqOfWLCh6JC9LncdMuOikYyYKE2JQQjkmTeRaSscTSqBSgRlr0Ik5ZnUso1YxCI5yr8BVITBZwv1zID_1lh-zLdNh-2kcbXeLWkNUY2Wqywyrr--WsRz-9olLge4yeGnt8HY2_repugU329CaDJu9cBvWwuQObHS0FaS1YndhNCTtq7Rv6LdJzQVEyklFYk8xhcUZSQE4WluaHH1FqoQwnMjBsOxrmXXLe_DhUr7pPqxPppPwAIjkISvzjJeKa-Ekt8qVmCGGyilZ2VwO4GW_xEVrGuZF86xOF_9oxABYpwWFbwHaE0_I11VdXvRdzhp0klWNtzp1uRjNha4M4Hmjbr2khDy-ffpxWExnx8WXxUmBtj8z9uFqOU_g-u7h-1Ex2hvvb8INDDBNc2S1BeuL2Xl4BNf8j8XpfPa43jwEPl-2Cv4BlrhOrA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+programming+model+and+foundation+for+lineage-based+distributed+computation&rft.jtitle=Journal+of+functional+programming&rft.au=Haller%2C+Philipp&rft.au=Miller%2C+Heather&rft.au=M%C3%9CLLER%2C+NORMEN&rft.date=2018&rft.pub=Cambridge+University+Press&rft.issn=0956-7968&rft.eissn=1469-7653&rft.volume=28&rft_id=info:doi/10.1017%2FS0956796818000035 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0956-7968&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0956-7968&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0956-7968&client=summon |