Realizability models for a linear dependent PCF
Recently, Dal Lago and Gaboardi have proposed a type system, named dℓPCF as a framework for implicit computational complexity. dℓPCF is a non-standard type system for PCF programs which is relatively complete with respect to quantitative properties thanks to the use of linear types inspired by Bound...
Uložené v:
| Vydané v: | Theoretical computer science Ročník 585; s. 55 - 70 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
20.06.2015
|
| Predmet: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Recently, Dal Lago and Gaboardi have proposed a type system, named dℓPCF as a framework for implicit computational complexity. dℓPCF is a non-standard type system for PCF programs which is relatively complete with respect to quantitative properties thanks to the use of linear types inspired by Bounded linear logic and dependent types à la Dependent ML. In this work, we adapt the framework of quantitative realizability and obtain a model for dℓPCF. The quantitative realizability model aims at a better understanding of dℓPCF type decorations and at giving an abstract semantic proof of intensional soundness. |
|---|---|
| AbstractList | Recently, Dal Lago and Gaboardi have proposed a type system, named as a framework for implicit computational complexity. is a non-standard type system for programs which is relatively complete with respect to quantitative properties thanks to the use of linear types inspired by Bounded linear logic and dependent types a la Dependent ML. In this work, we adapt the framework of quantitative realizability and obtain a model for . The quantitative realizability model aims at a better understanding of type decorations and at giving an abstract semantic proof of intensional soundness. Recently, Dal Lago and Gaboardi have proposed a type system, named dℓPCF as a framework for implicit computational complexity. dℓPCF is a non-standard type system for PCF programs which is relatively complete with respect to quantitative properties thanks to the use of linear types inspired by Bounded linear logic and dependent types à la Dependent ML. In this work, we adapt the framework of quantitative realizability and obtain a model for dℓPCF. The quantitative realizability model aims at a better understanding of dℓPCF type decorations and at giving an abstract semantic proof of intensional soundness. |
| Author | Brunel, Aloïs Gaboardi, Marco |
| Author_xml | – sequence: 1 givenname: Aloïs surname: Brunel fullname: Brunel, Aloïs organization: LIPN, UMR CNRS 7030, Université Paris 13, Villetaneuse, France – sequence: 2 givenname: Marco surname: Gaboardi fullname: Gaboardi, Marco email: m.gaboardi@dundee.ac.uk organization: School of Computing, University of Dundee, Scotland, United Kingdom |
| BookMark | eNp9kE1LAzEURYNUsK3-AHezdDPTfM8MrqRYFQqK6DpkkjeQkk5qkgr11zulrlz0bt7mngf3zNBkCAMgdEtwRTCRi02VTaooJqLCrMJYXKApaeq2pLTlEzTFDPOStbW4QrOUNniMqOUULd5Be_ejO-ddPhTbYMGnog-x0IV3A-hYWNjBYGHIxdtydY0ue-0T3PzdOfpcPX4sn8v169PL8mFdGsZwLglQbLVsJOuN1mA7yUQDthHAOsyhox3nGNpec8L7vm2JtES0UhLecGYEZXN0d_q7i-FrDymrrUsGvNcDhH1SpK4xbSit2VitT1UTQ0oRemVc1tmFIUftvCJYHRWpjRoVqaMihZka948k-UfuotvqeDjL3J-Y0RN8O4gqGQeDAesimKxscGfoX6_ff2s |
| CitedBy_id | crossref_primary_10_1145_3236763 |
| Cites_doi | 10.1145/1555746.1555753 10.1016/j.tcs.2003.10.019 10.1145/504709.504712 10.1016/0304-3975(92)90386-T 10.1145/346048.346051 10.2168/LMCS-7(3:2)2011 10.1016/j.tcs.2010.12.026 10.1016/j.tcs.2010.12.025 10.1007/BF01201998 10.1017/S0956796806006216 10.1017/S0960129510000162 10.1109/LICS.2012.49 10.2168/LMCS-8(4:11)2012 10.1017/S096012950100336X 10.1017/S0960129500003066 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2015.03.005 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 70 |
| ExternalDocumentID | 10_1016_j_tcs_2015_03_005 S030439751500198X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-1e20da6863fcaaedb6358ed85e3b04eb2b440e9fa414ff9916d1596614843c523 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000356645300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sun Sep 28 07:21:19 EDT 2025 Tue Nov 18 22:32:56 EST 2025 Sat Nov 29 05:15:19 EST 2025 Fri Feb 23 02:30:22 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Implicit computational complexity Realizability model |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-1e20da6863fcaaedb6358ed85e3b04eb2b440e9fa414ff9916d1596614843c523 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2015.03.005 |
| PQID | 1770282273 |
| PQPubID | 23500 |
| PageCount | 16 |
| ParticipantIDs | proquest_miscellaneous_1770282273 crossref_citationtrail_10_1016_j_tcs_2015_03_005 crossref_primary_10_1016_j_tcs_2015_03_005 elsevier_sciencedirect_doi_10_1016_j_tcs_2015_03_005 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-06-20 |
| PublicationDateYYYYMMDD | 2015-06-20 |
| PublicationDate_xml | – month: 06 year: 2015 text: 2015-06-20 day: 20 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Moyen (br0250) Aug. 2009; 10 Pitts (br0260) 2000; 10 Miquel (br0240) 2011 Krivine (br0200) 2009; 27 Krivine (br0210) 2011; 7 Kristiansen, Jones (br0190) 2005; vol. 3526 Jaber, Tabareau (br0170) 2010 Amadio (br0010) 2005; 65 Girard, Scedrov, Scott (br0130) 1992; 97 Terui (br0270) 2011; 412 Dal Lago, Gaboardi (br0090) 2012; 8 G. Jaber, N. Tabareau, M. Sozeau, Extending type theory with forcing, in: Proceedings of LICS'12, Jun. 2012. Hofmann, Scott (br0160) 2004; 318 Dal Lago, Gaboardi (br0080) 2011 Dal Lago, Petit (br0120) 2012 Baillot, Terui (br0030) 2004 Xi (br0280) 2007; 17 Leivant, Marion (br0220) 1993; vol. 664 Hofmann (br0150) 2000; 31 Marion, Moyen (br0230) 2000; vol. 1955 Birkedal, Støvring, Thamsborg (br0060) 2010; 20 Brunel (br0070) 2012 Dal Lago, Hofmann (br0100) 2009; vol. 5608 Dal Lago, Hofmann (br0110) 2011; 412 Girard (br0140) 2001; 11 Benton, Hur (br0050) 2009 Appel, McAllester (br0020) Sep. 2001; 23 Bellantoni, Cook (br0040) 1992; 2 Moyen (10.1016/j.tcs.2015.03.005_br0250) 2009; 10 Krivine (10.1016/j.tcs.2015.03.005_br0200) 2009; 27 Miquel (10.1016/j.tcs.2015.03.005_br0240) 2011 Leivant (10.1016/j.tcs.2015.03.005_br0220) 1993; vol. 664 Hofmann (10.1016/j.tcs.2015.03.005_br0150) 2000; 31 Kristiansen (10.1016/j.tcs.2015.03.005_br0190) 2005; vol. 3526 Appel (10.1016/j.tcs.2015.03.005_br0020) 2001; 23 Dal Lago (10.1016/j.tcs.2015.03.005_br0100) 2009; vol. 5608 Xi (10.1016/j.tcs.2015.03.005_br0280) 2007; 17 Girard (10.1016/j.tcs.2015.03.005_br0140) 2001; 11 Birkedal (10.1016/j.tcs.2015.03.005_br0060) 2010; 20 Krivine (10.1016/j.tcs.2015.03.005_br0210) 2011; 7 Girard (10.1016/j.tcs.2015.03.005_br0130) 1992; 97 Dal Lago (10.1016/j.tcs.2015.03.005_br0080) 2011 Bellantoni (10.1016/j.tcs.2015.03.005_br0040) 1992; 2 Dal Lago (10.1016/j.tcs.2015.03.005_br0110) 2011; 412 Pitts (10.1016/j.tcs.2015.03.005_br0260) 2000; 10 Jaber (10.1016/j.tcs.2015.03.005_br0170) 2010 10.1016/j.tcs.2015.03.005_br0180 Marion (10.1016/j.tcs.2015.03.005_br0230) 2000; vol. 1955 Benton (10.1016/j.tcs.2015.03.005_br0050) 2009 Dal Lago (10.1016/j.tcs.2015.03.005_br0120) 2012 Baillot (10.1016/j.tcs.2015.03.005_br0030) 2004 Amadio (10.1016/j.tcs.2015.03.005_br0010) 2005; 65 Hofmann (10.1016/j.tcs.2015.03.005_br0160) 2004; 318 Brunel (10.1016/j.tcs.2015.03.005_br0070) Terui (10.1016/j.tcs.2015.03.005_br0270) 2011; 412 Dal Lago (10.1016/j.tcs.2015.03.005_br0090) 2012; 8 |
| References_xml | – volume: 2 start-page: 97 year: 1992 end-page: 110 ident: br0040 article-title: A new recursion-theoretic characterization of the polytime functions publication-title: Comput. Complexity – volume: 412 start-page: 2029 year: 2011 end-page: 2047 ident: br0110 article-title: Realizability models and implicit complexity publication-title: Theoret. Comput. Sci. – volume: 10 start-page: 321 year: 2000 end-page: 359 ident: br0260 article-title: Parametric polymorphism and operational equivalence publication-title: Math. Structures Comput. Sci. – volume: 65 start-page: 29 year: 2005 end-page: 60 ident: br0010 article-title: Synthesis of max-plus quasi-interpretations publication-title: Fund. Inform. – start-page: 133 year: 2011 end-page: 142 ident: br0080 article-title: Linear dependent types and relative completeness publication-title: IEEE LICS'11 – volume: 8 year: 2012 ident: br0090 article-title: Linear dependent types and relative completeness publication-title: Log. Methods Comput. Sci. – volume: 10 start-page: 29:1 year: Aug. 2009 end-page: 29:44 ident: br0250 article-title: Resource control graphs publication-title: ACM Trans. Comput. Log. – start-page: 97 year: 2009 end-page: 108 ident: br0050 article-title: Biorthogonality, step-indexing and compiler correctness publication-title: ICFP '09 – volume: 97 start-page: 1 year: 1992 end-page: 66 ident: br0130 article-title: Bounded linear logic publication-title: Theoret. Comput. Sci. – volume: 318 start-page: 121 year: 2004 end-page: 137 ident: br0160 article-title: Realizability models for BLL-like languages publication-title: Theoret. Comput. Sci. – volume: 17 start-page: 215 year: 2007 end-page: 286 ident: br0280 article-title: Dependent ML: an approach to practical programming with dependent types publication-title: J. Funct. Programming – volume: vol. 5608 start-page: 80 year: 2009 end-page: 94 ident: br0100 article-title: Bounded linear logic, revisited publication-title: TLCA – volume: 20 start-page: 655 year: 2010 end-page: 703 ident: br0060 article-title: Realisability semantics of parametric polymorphism, general references and recursive types publication-title: Math. Structures Comput. Sci. – year: 2012 ident: br0070 article-title: Quantitative classical realizability – volume: 31 start-page: 31 year: 2000 end-page: 42 ident: br0150 article-title: Programming languages capturing complexity classes publication-title: ACM SIGACT News – volume: 11 start-page: 301 year: 2001 end-page: 506 ident: br0140 article-title: Locus solum: from the rules of logic to the logic of rules publication-title: Math. Structures Comput. Sci. – reference: G. Jaber, N. Tabareau, M. Sozeau, Extending type theory with forcing, in: Proceedings of LICS'12, Jun. 2012. – volume: 7 year: 2011 ident: br0210 article-title: Realizability algebras: a program to well order R publication-title: Log. Methods Comput. Sci. – volume: vol. 3526 start-page: 289 year: 2005 end-page: 304 ident: br0190 article-title: The flow of data and the complexity of algorithms publication-title: Cie: New Computational Paradigms – volume: vol. 1955 start-page: 25 year: 2000 end-page: 42 ident: br0230 article-title: Efficient first order functional program interpreter with time bound certifications publication-title: LPAR – volume: 23 start-page: 657 year: Sep. 2001 end-page: 683 ident: br0020 article-title: An indexed model of recursive types for foundational proof-carrying code publication-title: ACM Trans. Program. Lang. Syst. – start-page: 115 year: 2012 end-page: 126 ident: br0120 article-title: Linear dependent types in a call-by-value scenario publication-title: PPDP'12 – year: 2010 ident: br0170 article-title: Krivine realizability for compiler correctness publication-title: LOLA – volume: 27 start-page: 197 year: 2009 end-page: 229 ident: br0200 article-title: Realizability in classical logic publication-title: Panor. Synthèses – volume: vol. 664 start-page: 274 year: 1993 end-page: 288 ident: br0220 article-title: Lambda calculus characterizations of poly-time publication-title: TLCA'93 – volume: 412 start-page: 2048 year: 2011 end-page: 2071 ident: br0270 article-title: Computational ludics publication-title: Theoret. Comput. Sci. – start-page: 197 year: 2011 end-page: 206 ident: br0240 article-title: Forcing as a program transformation publication-title: IEEE LICS – start-page: 266 year: 2004 end-page: 275 ident: br0030 article-title: Light types for polynomial time computation in lambda-calculus publication-title: IEEE LICS – volume: 65 start-page: 29 year: 2005 ident: 10.1016/j.tcs.2015.03.005_br0010 article-title: Synthesis of max-plus quasi-interpretations publication-title: Fund. Inform. – volume: 10 start-page: 29:1 issue: 4 year: 2009 ident: 10.1016/j.tcs.2015.03.005_br0250 article-title: Resource control graphs publication-title: ACM Trans. Comput. Log. doi: 10.1145/1555746.1555753 – start-page: 97 year: 2009 ident: 10.1016/j.tcs.2015.03.005_br0050 article-title: Biorthogonality, step-indexing and compiler correctness – volume: 318 start-page: 121 issue: 1–2 year: 2004 ident: 10.1016/j.tcs.2015.03.005_br0160 article-title: Realizability models for BLL-like languages publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2003.10.019 – volume: 23 start-page: 657 issue: 5 year: 2001 ident: 10.1016/j.tcs.2015.03.005_br0020 article-title: An indexed model of recursive types for foundational proof-carrying code publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/504709.504712 – start-page: 133 year: 2011 ident: 10.1016/j.tcs.2015.03.005_br0080 article-title: Linear dependent types and relative completeness – volume: 27 start-page: 197 year: 2009 ident: 10.1016/j.tcs.2015.03.005_br0200 article-title: Realizability in classical logic publication-title: Panor. Synthèses – volume: 97 start-page: 1 issue: 1 year: 1992 ident: 10.1016/j.tcs.2015.03.005_br0130 article-title: Bounded linear logic publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(92)90386-T – volume: 31 start-page: 31 year: 2000 ident: 10.1016/j.tcs.2015.03.005_br0150 article-title: Programming languages capturing complexity classes publication-title: ACM SIGACT News doi: 10.1145/346048.346051 – start-page: 197 year: 2011 ident: 10.1016/j.tcs.2015.03.005_br0240 article-title: Forcing as a program transformation – start-page: 266 year: 2004 ident: 10.1016/j.tcs.2015.03.005_br0030 article-title: Light types for polynomial time computation in lambda-calculus – volume: vol. 1955 start-page: 25 year: 2000 ident: 10.1016/j.tcs.2015.03.005_br0230 article-title: Efficient first order functional program interpreter with time bound certifications – volume: 7 issue: 3 year: 2011 ident: 10.1016/j.tcs.2015.03.005_br0210 article-title: Realizability algebras: a program to well order R publication-title: Log. Methods Comput. Sci. doi: 10.2168/LMCS-7(3:2)2011 – volume: 412 start-page: 2048 issue: 20 year: 2011 ident: 10.1016/j.tcs.2015.03.005_br0270 article-title: Computational ludics publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2010.12.026 – volume: 412 start-page: 2029 issue: 20 year: 2011 ident: 10.1016/j.tcs.2015.03.005_br0110 article-title: Realizability models and implicit complexity publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2010.12.025 – volume: 2 start-page: 97 issue: 2 year: 1992 ident: 10.1016/j.tcs.2015.03.005_br0040 article-title: A new recursion-theoretic characterization of the polytime functions publication-title: Comput. Complexity doi: 10.1007/BF01201998 – volume: 17 start-page: 215 issue: 2 year: 2007 ident: 10.1016/j.tcs.2015.03.005_br0280 article-title: Dependent ML: an approach to practical programming with dependent types publication-title: J. Funct. Programming doi: 10.1017/S0956796806006216 – year: 2010 ident: 10.1016/j.tcs.2015.03.005_br0170 article-title: Krivine realizability for compiler correctness – volume: 20 start-page: 655 issue: 4 year: 2010 ident: 10.1016/j.tcs.2015.03.005_br0060 article-title: Realisability semantics of parametric polymorphism, general references and recursive types publication-title: Math. Structures Comput. Sci. doi: 10.1017/S0960129510000162 – volume: vol. 5608 start-page: 80 year: 2009 ident: 10.1016/j.tcs.2015.03.005_br0100 article-title: Bounded linear logic, revisited – ident: 10.1016/j.tcs.2015.03.005_br0180 doi: 10.1109/LICS.2012.49 – start-page: 115 year: 2012 ident: 10.1016/j.tcs.2015.03.005_br0120 article-title: Linear dependent types in a call-by-value scenario – volume: 8 issue: 4 year: 2012 ident: 10.1016/j.tcs.2015.03.005_br0090 article-title: Linear dependent types and relative completeness publication-title: Log. Methods Comput. Sci. doi: 10.2168/LMCS-8(4:11)2012 – volume: vol. 664 start-page: 274 year: 1993 ident: 10.1016/j.tcs.2015.03.005_br0220 article-title: Lambda calculus characterizations of poly-time – volume: 11 start-page: 301 issue: 03 year: 2001 ident: 10.1016/j.tcs.2015.03.005_br0140 article-title: Locus solum: from the rules of logic to the logic of rules publication-title: Math. Structures Comput. Sci. doi: 10.1017/S096012950100336X – ident: 10.1016/j.tcs.2015.03.005_br0070 – volume: 10 start-page: 321 year: 2000 ident: 10.1016/j.tcs.2015.03.005_br0260 article-title: Parametric polymorphism and operational equivalence publication-title: Math. Structures Comput. Sci. doi: 10.1017/S0960129500003066 – volume: vol. 3526 start-page: 289 year: 2005 ident: 10.1016/j.tcs.2015.03.005_br0190 article-title: The flow of data and the complexity of algorithms |
| SSID | ssj0000576 |
| Score | 2.1037965 |
| Snippet | Recently, Dal Lago and Gaboardi have proposed a type system, named dℓPCF as a framework for implicit computational complexity. dℓPCF is a non-standard type... Recently, Dal Lago and Gaboardi have proposed a type system, named as a framework for implicit computational complexity. is a non-standard type system for... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 55 |
| SubjectTerms | Complexity Computation Computer simulation Decoration Implicit computational complexity Mathematical models Proving Realizability Realizability model Semantics |
| Title | Realizability models for a linear dependent PCF |
| URI | https://dx.doi.org/10.1016/j.tcs.2015.03.005 https://www.proquest.com/docview/1770282273 |
| Volume | 585 |
| WOSCitedRecordID | wos000356645300005&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBYl6aE9tGna0iRtcKGnLm5lPSzpGEIeLTSEsoW9CcmSICF4Q-wt-fnVy97NloTm0Isxxhayv2Hmk2c0HwCfKqu0goqVwmlREmNcyXmFS1orggx2FtUuik2wszM-m4nzrEzXRTkB1rb89lZc_1eo_TUPdtg6-wi4x0H9BX_uQfdHD7s__hPwPz31C6VaF5FgR6WbLtVKTgKlVEERPAnf9pPzwztlfdOVXY1NlnuY5Bi5XLcv2pzZv5rHNPvxSMtPvEUFi8ubgJr56j-FiobaJwRXXA8O-RKRNE0GP0k5XfF0qblujplJ--Mvb5x-DFx-6ZvQGL2iqZ0sXYaeId2-FpHGOsGhBO1S-iFkGEJCLGPP2k3EqPBubPPg29Hs-zL4UpbS0_kFhkR2LOlbm8d9VGQtKEemMd0CL_ISoThI0L4CT2y7DV4O8htF9sbb4PmPseVu9xp8vYN7kXAvPO6FKhLuxYh74XF_A34dH00PT8ushlE2GMO-rCyCRtW8xq5RyhrtqSK3hlOLNSRWI00ItMIpUhHnAu03nqoG-sUJbijCb8FGO2_tO1AgrGprsCYUMWKc1gw6I6ASocGddXwHwOHDyCa3ig-KJVfyXkB2wOfxkevUJ-Whm8nwtWU24kTgpLechx77OCAjvRMMmS3V2vmikxVjsR6a4d3HzGMPPFta_3uw0d8s7AfwtPndX3Q3-9m0_gBkkHyv |
| linkProvider | Elsevier |
| 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=Realizability+models+for+a+linear+dependent+PCF&rft.jtitle=Theoretical+computer+science&rft.au=Brunel%2C+Alo%C3%AFs&rft.au=Gaboardi%2C+Marco&rft.date=2015-06-20&rft.issn=0304-3975&rft.volume=585&rft.spage=55&rft.epage=70&rft_id=info:doi/10.1016%2Fj.tcs.2015.03.005&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2015_03_005 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |