Implicit computation complexity in higher-order programming languages A Survey in Memory of Martin Hofmann
This paper is meant to be a survey about implicit characterizations of complexity classes by fragments of higher-order programming languages, with a special focus on type systems and subsystems of linear logic. Particular emphasis will be put on Martin Hofmann’s contributions to the subject, which v...
Saved in:
| Published in | Mathematical structures in computer science Vol. 32; no. 6; pp. 760 - 776 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Cambridge
Cambridge University Press
01.06.2022
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0960-1295 1469-8072 |
| DOI | 10.1017/S0960129521000505 |
Cover
Loading…
| Abstract | This paper is meant to be a survey about implicit characterizations of complexity classes by fragments of higher-order programming languages, with a special focus on type systems and subsystems of linear logic. Particular emphasis will be put on Martin Hofmann’s contributions to the subject, which very much helped in shaping the field. |
|---|---|
| AbstractList | This paper is meant to be a survey about implicit characterizations of complexity classes by fragments of higher-order programming languages, with a special focus on type systems and subsystems of linear logic. Particular emphasis will be put on Martin Hofmann’s contributions to the subject, which very much helped in shaping the field. |
| Author | Dal Lago, U. |
| Author_xml | – sequence: 1 givenname: U. orcidid: 0000-0001-9200-070X surname: Dal Lago fullname: Dal Lago, U. |
| BookMark | eNp9UMtOwzAQtFCRaAsfwC0S58Cu40d9RFWBSpU4AOfIcZ3UVeIEO5Ho35O2nEDitCvNzO7MzMjEt94Scotwj4Dy4Q2UAKSKUwQADvyCTJEJlS5A0gmZHuH0iF-RWYx7AMwQ1JSs1k1XO-P6xLRNN_S6d60_7bX9cv0hcT7ZuWpnQ9qGrQ1JF9oq6KZxvkpq7atBVzZek8tS19He_Mw5-XhavS9f0s3r83r5uEkNhaxPVWa4sEqVQhTcykxTUFSgVJJubaG4ySzdioIZRs2CQclGRBRYZoJxy6jK5uTufHd08TnY2Of7dgh-fJlTKZEzxhBHljyzTGhjDLbMx3ynYH3Qrs4R8mNn-Z_ORiX-UnbBNToc_tF8A39MbsI |
| CitedBy_id | crossref_primary_10_1017_S0960129521000487 crossref_primary_10_1017_S0956796823000023 |
| Cites_doi | 10.1145/2159531.2159540 10.1007/BF01201998 10.1109/LICS.1999.782641 10.1007/BFb0028020 10.1016/j.ic.2010.10.002 10.1017/CBO9780511983504 10.1017/CBO9780511804106 10.1007/978-3-540-24727-2_4 10.1006/inco.1998.2700 10.2178/jsl/1190150032 10.1016/j.tcs.2009.09.015 10.1016/j.tcs.2010.12.025 10.1016/S0168-0072(00)00006-3 10.1016/0890-5401(92)90062-K 10.1007/978-3-540-74915-8_21 10.1016/j.ic.2008.08.005 10.1016/0890-5401(90)90019-E 10.1016/j.tcs.2003.10.023 10.1145/158511.158659 10.1016/j.ic.2018.05.003 10.1007/978-3-319-22177-9_24 10.1007/BFb0022277 10.1002/malq.200610056 10.1016/j.ic.2014.10.005 10.2307/2269958 10.1145/2480359.2429090 10.1016/0168-0072(91)90019-I 10.1007/978-0-387-35608-2_31 10.1023/B:STUD.0000034183.33333.6f 10.1007/978-3-642-03816-7_30 10.1109/LICS.1998.705666 10.1109/LICS.2004.1319612 10.1016/0304-3975(87)90045-4 10.1145/346048.346051 10.1016/S0168-0072(00)00010-5 10.1305/ndjfl/1093883253 10.1017/S0960129514000310 10.1016/j.tcs.2003.10.017 10.1016/0304-3975(92)90363-K 10.1145/322358.322370 10.1007/978-3-642-02273-9_29 10.2307/421100 10.1016/S0890-5401(03)00010-5 10.1007/978-3-540-30477-7_21 10.1017/CBO9780511804090 10.1017/S0960129506005688 10.1016/j.ic.2004.05.001 10.1007/978-3-642-11957-6_12 10.1007/978-3-540-72734-7_33 10.1007/978-3-540-45208-9_4 10.1007/978-3-662-43951-7_26 10.1016/j.ic.2015.04.006 10.1109/SFCS.1998.743523 10.1016/j.tcs.2003.10.018 10.1007/3-540-48168-0_7 10.1016/j.jlap.2008.02.010 10.1145/1462179.1462180 10.2168/LMCS-3(4:10)2007 10.1145/504077.504081 10.1016/j.tcs.2009.07.045 10.1017/S0956796804005131 10.2168/LMCS-4(4:5)2008 10.1016/j.apal.2011.01.010 10.1090/S0002-9947-1965-0170805-7 10.1007/3-540-48168-0_33 10.1109/LICS.2006.37 10.1016/0168-0072(93)90044-E 10.1017/S0960129514000632 10.1007/s00224-009-9210-x 10.1016/j.scico.2013.07.010 10.1145/2933575.2934505 10.1007/978-3-662-47666-6_28 10.1007/s00153-007-0042-6 10.1017/S0960129506005421 10.1145/1131313.1131315 10.1145/2784731.2784759 10.1016/j.ic.2014.10.006 10.1016/j.tcs.2003.10.015 10.1145/503272.503297 10.1109/SFCS.1998.743522 10.1109/LICS.2007.45 10.1016/0304-3975(92)90386-T 10.2168/LMCS-6(4:7)2010 10.1145/1555746.1555749 10.1145/1706299.1706327 10.1016/j.tcs.2003.10.019 10.1016/S0890-5401(03)00009-9 10.1016/j.ic.2015.12.013 10.1016/S0168-0072(98)00040-2 |
| ContentType | Journal Article |
| Copyright | The Author(s), 2022. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s), 2022. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION 3V. 7SC 7XB 88I 8AL 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L6V L7M L~C L~D M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1017/S0960129521000505 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Science Database (Alumni Edition) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection ProQuest Central Essentials - QC ProQuest Central Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Science Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| 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 Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection ProQuest Computing Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest Central Basic ProQuest Science Journals 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 Materials Science & Engineering Collection ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | Computer Science Database CrossRef |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1469-8072 |
| EndPage | 776 |
| ExternalDocumentID | 10_1017_S0960129521000505 |
| GroupedDBID | -1D -1F -2P -2V -E. -~6 -~N .DC .FH 09C 09E 0E1 0R~ 29M 4.4 5GY 5VS 6~7 74X 74Y 7~V 88I 8FE 8FG 8R4 8R5 9M5 AAAZR AABES AABWE AACJH AAGFV AAKNA AAKTX AAMNQ AANRG AARAB AASVR AAUIS AAUKB AAYXX ABBXD ABBZL ABGDZ ABHFL ABITZ ABJCF ABJNI ABKKG ABMWE ABQTM ABQWD ABROB ABTCQ ABUWG ABVFV ABVKB ABVZP ABXAU ABXHF ABZCX ACBMC ACDLN ACEJA ACETC ACGFS ACGOD ACIMK ACIWK ACOZI ACUIJ ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADKIL ADOVH ADOVT ADVJH AEBAK AEBPU AEHGV AEMTW AENCP AENEX AENGE AFFUJ AFKQG AFKRA AFLOS AFLVW AFUTZ AFZFC AGABE AGBYD AGJUD AGLWM AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS AKMAY AKZCZ ALMA_UNASSIGNED_HOLDINGS ALVPG ALWZO AMVHM ANOYL AQJOH ARABE ARAPS ARZZG ATUCA AUXHV AYIQA AZQEC BBLKV BCGOX BENPR BESQT BGHMG BGLVJ BJBOZ BLZWO BMAJL BPHCQ C0O CAG CBIIA CCPQU CCQAD CCTKK CCUQV CDIZJ CFAFE CFBFF CGQII CHEAL CITATION CJCSC COF CS3 DC4 DOHLZ DU5 DWQXO EBS EGQIC EJD GNUQQ HCIFZ HG- HST HZ~ I.6 I.7 I.9 IH6 IOEEP IOO IS6 I~P J36 J38 J3A JHPGK JQKCU K6V K7- KAFGG KCGVB KFECR L6V L98 LHUNA LW7 M-V M2P M7S M7~ M8. NIKVX NMFBF NZEOI O9- OYBOY P2P P62 PHGZM PHGZT PQQKQ PROAC PTHSS PYCCK Q2X RAMDC RCA RIG ROL RR0 S6- S6U SAAAG T9M TN5 UT1 WFFJZ WQ3 WXU WYP XJT ZDLDU ZJOSE ZMEZD ZYDXJ ~V1 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D M0N PKEHL PQEST PQGLB PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c203t-93c56e99f66b5e73a2092617972deb95c3e2d6b4c42c840f47976b1f3645e4293 |
| IEDL.DBID | BENPR |
| ISSN | 0960-1295 |
| IngestDate | Fri Jul 25 19:37:28 EDT 2025 Tue Jul 01 02:40:50 EDT 2025 Thu Apr 24 23:01:50 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c203t-93c56e99f66b5e73a2092617972deb95c3e2d6b4c42c840f47976b1f3645e4293 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-9200-070X |
| PQID | 2771544411 |
| PQPubID | 33085 |
| PageCount | 17 |
| ParticipantIDs | proquest_journals_2771544411 crossref_citationtrail_10_1017_S0960129521000505 crossref_primary_10_1017_S0960129521000505 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2022-06-00 20220601 |
| PublicationDateYYYYMMDD | 2022-06-01 |
| PublicationDate_xml | – month: 06 year: 2022 text: 2022-06-00 |
| PublicationDecade | 2020 |
| PublicationPlace | Cambridge |
| PublicationPlace_xml | – name: Cambridge |
| PublicationSubtitle | MSCS |
| PublicationTitle | Mathematical structures in computer science |
| PublicationYear | 2022 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S0960129521000505_ref30 S0960129521000505_ref31 S0960129521000505_ref32 Cobham (S0960129521000505_ref23) 1965 S0960129521000505_ref34 S0960129521000505_ref35 S0960129521000505_ref36 S0960129521000505_ref37 S0960129521000505_ref38 S0960129521000505_ref39 S0960129521000505_ref40 S0960129521000505_ref41 S0960129521000505_ref42 S0960129521000505_ref43 S0960129521000505_ref44 S0960129521000505_ref45 S0960129521000505_ref46 Baillot (S0960129521000505_ref15) 2001; 45 S0960129521000505_ref47 S0960129521000505_ref48 S0960129521000505_ref49 S0960129521000505_ref91 S0960129521000505_ref92 S0960129521000505_ref93 S0960129521000505_ref94 S0960129521000505_ref96 S0960129521000505_ref97 S0960129521000505_ref98 S0960129521000505_ref10 S0960129521000505_ref90 S0960129521000505_ref19 S0960129521000505_ref11 S0960129521000505_ref99 S0960129521000505_ref12 S0960129521000505_ref13 S0960129521000505_ref14 S0960129521000505_ref16 S0960129521000505_ref17 S0960129521000505_ref18 Buss (S0960129521000505_ref21) 1986 S0960129521000505_ref20 Girard (S0960129521000505_ref53) 1989 S0960129521000505_ref22 S0960129521000505_ref24 S0960129521000505_ref25 S0960129521000505_ref26 S0960129521000505_ref27 S0960129521000505_ref28 S0960129521000505_ref29 S0960129521000505_ref70 S0960129521000505_ref71 S0960129521000505_ref72 S0960129521000505_ref73 S0960129521000505_ref74 S0960129521000505_ref75 S0960129521000505_ref76 SØrensen (S0960129521000505_ref95) 2006 S0960129521000505_ref77 S0960129521000505_ref78 S0960129521000505_ref79 S0960129521000505_ref80 S0960129521000505_ref1 S0960129521000505_ref81 S0960129521000505_ref82 S0960129521000505_ref3 S0960129521000505_ref83 S0960129521000505_ref2 S0960129521000505_ref5 S0960129521000505_ref84 S0960129521000505_ref4 S0960129521000505_ref85 S0960129521000505_ref7 S0960129521000505_ref86 S0960129521000505_ref6 S0960129521000505_ref87 S0960129521000505_ref9 S0960129521000505_ref8 S0960129521000505_ref88 S0960129521000505_ref89 S0960129521000505_ref102 S0960129521000505_ref101 S0960129521000505_ref100 S0960129521000505_ref50 S0960129521000505_ref51 S0960129521000505_ref54 S0960129521000505_ref55 S0960129521000505_ref56 S0960129521000505_ref57 S0960129521000505_ref58 Girard (S0960129521000505_ref52) 1988; 127 S0960129521000505_ref59 S0960129521000505_ref60 S0960129521000505_ref61 S0960129521000505_ref62 S0960129521000505_ref64 S0960129521000505_ref65 Hofmann (S0960129521000505_ref63) 2000; 7 S0960129521000505_ref66 S0960129521000505_ref67 Dal Lago (S0960129521000505_ref33) 2011; 8 S0960129521000505_ref68 S0960129521000505_ref69 |
| References_xml | – volume-title: Proofs and Types year: 1989 ident: S0960129521000505_ref53 – ident: S0960129521000505_ref45 doi: 10.1145/2159531.2159540 – ident: S0960129521000505_ref17 doi: 10.1007/BF01201998 – ident: S0960129521000505_ref60 doi: 10.1109/LICS.1999.782641 – ident: S0960129521000505_ref59 doi: 10.1007/BFb0028020 – ident: S0960129521000505_ref12 doi: 10.1016/j.ic.2010.10.002 – ident: S0960129521000505_ref2 doi: 10.1017/CBO9780511983504 – ident: S0960129521000505_ref56 doi: 10.1017/CBO9780511804106 – ident: S0960129521000505_ref14 doi: 10.1007/978-3-540-24727-2_4 – ident: S0960129521000505_ref50 doi: 10.1006/inco.1998.2700 – ident: S0960129521000505_ref18 doi: 10.2178/jsl/1190150032 – ident: S0960129521000505_ref74 – ident: S0960129521000505_ref13 doi: 10.1016/j.tcs.2009.09.015 – ident: S0960129521000505_ref36 doi: 10.1016/j.tcs.2010.12.025 – volume: 45 start-page: 1 year: 2001 ident: S0960129521000505_ref15 article-title: Elementary complexity and geometry of interaction publication-title: Fundamenta Informaticae – ident: S0960129521000505_ref19 doi: 10.1016/S0168-0072(00)00006-3 – ident: S0960129521000505_ref80 – ident: S0960129521000505_ref54 doi: 10.1016/0890-5401(92)90062-K – ident: S0960129521000505_ref47 doi: 10.1007/978-3-540-74915-8_21 – ident: S0960129521000505_ref16 doi: 10.1016/j.ic.2008.08.005 – ident: S0960129521000505_ref100 doi: 10.1016/0890-5401(90)90019-E – ident: S0960129521000505_ref1 doi: 10.1016/j.tcs.2003.10.023 – ident: S0960129521000505_ref70 doi: 10.1145/158511.158659 – ident: S0960129521000505_ref8 doi: 10.1016/j.ic.2018.05.003 – ident: S0960129521000505_ref22 doi: 10.1007/978-3-319-22177-9_24 – ident: S0960129521000505_ref75 doi: 10.1007/BFb0022277 – ident: S0960129521000505_ref86 doi: 10.1002/malq.200610056 – ident: S0960129521000505_ref11 doi: 10.1016/j.ic.2014.10.005 – ident: S0960129521000505_ref88 doi: 10.2307/2269958 – ident: S0960129521000505_ref39 doi: 10.1145/2480359.2429090 – ident: S0960129521000505_ref101 doi: 10.1016/0168-0072(91)90019-I – ident: S0960129521000505_ref9 doi: 10.1007/978-0-387-35608-2_31 – ident: S0960129521000505_ref96 doi: 10.1023/B:STUD.0000034183.33333.6f – ident: S0960129521000505_ref89 – ident: S0960129521000505_ref48 doi: 10.1007/978-3-642-03816-7_30 – ident: S0960129521000505_ref4 doi: 10.1109/LICS.1998.705666 – ident: S0960129521000505_ref97 doi: 10.1109/LICS.2004.1319612 – ident: S0960129521000505_ref49 doi: 10.1016/0304-3975(87)90045-4 – ident: S0960129521000505_ref61 doi: 10.1145/346048.346051 – ident: S0960129521000505_ref62 doi: 10.1016/S0168-0072(00)00010-5 – ident: S0960129521000505_ref25 doi: 10.1305/ndjfl/1093883253 – ident: S0960129521000505_ref37 doi: 10.1017/S0960129514000310 – ident: S0960129521000505_ref84 doi: 10.1016/j.tcs.2003.10.017 – ident: S0960129521000505_ref55 doi: 10.1016/0304-3975(92)90363-K – ident: S0960129521000505_ref44 doi: 10.1145/322358.322370 – ident: S0960129521000505_ref102 doi: 10.1007/978-3-642-02273-9_29 – ident: S0960129521000505_ref58 doi: 10.2307/421100 – ident: S0960129521000505_ref43 doi: 10.1016/S0890-5401(03)00010-5 – ident: S0960129521000505_ref85 doi: 10.1007/978-3-540-30477-7_21 – ident: S0960129521000505_ref3 doi: 10.1017/CBO9780511804090 – ident: S0960129521000505_ref78 doi: 10.1017/S0960129506005688 – ident: S0960129521000505_ref5 doi: 10.1016/j.ic.2004.05.001 – ident: S0960129521000505_ref41 doi: 10.1007/978-3-642-11957-6_12 – volume-title: Lectures on the Curry-Howard Isomorphism, year: 2006 ident: S0960129521000505_ref95 – ident: S0960129521000505_ref90 doi: 10.1007/978-3-540-72734-7_33 – ident: S0960129521000505_ref77 doi: 10.1007/978-3-540-45208-9_4 – ident: S0960129521000505_ref79 doi: 10.1007/978-3-662-43951-7_26 – ident: S0960129521000505_ref42 doi: 10.1016/j.ic.2015.04.006 – ident: S0960129521000505_ref83 doi: 10.1109/SFCS.1998.743523 – ident: S0960129521000505_ref68 doi: 10.1016/j.tcs.2003.10.018 – ident: S0960129521000505_ref72 doi: 10.1007/3-540-48168-0_7 – ident: S0960129521000505_ref82 doi: 10.1016/j.jlap.2008.02.010 – year: 1965 ident: S0960129521000505_ref23 – ident: S0960129521000505_ref29 doi: 10.1145/1462179.1462180 – ident: S0960129521000505_ref7 doi: 10.2168/LMCS-3(4:10)2007 – ident: S0960129521000505_ref6 doi: 10.1145/504077.504081 – ident: S0960129521000505_ref38 doi: 10.1016/j.tcs.2009.07.045 – ident: S0960129521000505_ref76 doi: 10.1017/S0956796804005131 – volume-title: Bounded Arithmetic year: 1986 ident: S0960129521000505_ref21 – ident: S0960129521000505_ref26 doi: 10.2168/LMCS-4(4:5)2008 – ident: S0960129521000505_ref87 doi: 10.1016/j.apal.2011.01.010 – ident: S0960129521000505_ref57 doi: 10.1090/S0002-9947-1965-0170805-7 – ident: S0960129521000505_ref91 – ident: S0960129521000505_ref93 doi: 10.1007/3-540-48168-0_33 – ident: S0960129521000505_ref69 doi: 10.1109/LICS.2006.37 – ident: S0960129521000505_ref24 doi: 10.1016/0168-0072(93)90044-E – ident: S0960129521000505_ref32 doi: 10.1017/S0960129514000632 – ident: S0960129521000505_ref99 – ident: S0960129521000505_ref35 doi: 10.1007/s00224-009-9210-x – ident: S0960129521000505_ref40 doi: 10.1016/j.scico.2013.07.010 – ident: S0960129521000505_ref30 doi: 10.1145/2933575.2934505 – ident: S0960129521000505_ref81 doi: 10.1007/978-3-662-47666-6_28 – ident: S0960129521000505_ref98 doi: 10.1007/s00153-007-0042-6 – volume: 127 start-page: 221 year: 1988 ident: S0960129521000505_ref52 article-title: Geometry of interaction I: An interpretation of system F publication-title: Logic Colloquium – ident: S0960129521000505_ref31 doi: 10.1017/S0960129506005421 – ident: S0960129521000505_ref27 doi: 10.1145/1131313.1131315 – ident: S0960129521000505_ref46 doi: 10.1145/2784731.2784759 – ident: S0960129521000505_ref20 doi: 10.1016/j.ic.2014.10.006 – ident: S0960129521000505_ref10 doi: 10.1016/j.tcs.2003.10.015 – ident: S0960129521000505_ref64 doi: 10.1145/503272.503297 – ident: S0960129521000505_ref71 doi: 10.1109/SFCS.1998.743522 – ident: S0960129521000505_ref94 doi: 10.1109/LICS.2007.45 – ident: S0960129521000505_ref51 doi: 10.1016/0304-3975(92)90386-T – ident: S0960129521000505_ref34 doi: 10.2168/LMCS-6(4:7)2010 – ident: S0960129521000505_ref28 doi: 10.1145/1555746.1555749 – ident: S0960129521000505_ref67 doi: 10.1145/1706299.1706327 – ident: S0960129521000505_ref66 doi: 10.1016/j.tcs.2003.10.019 – ident: S0960129521000505_ref65 doi: 10.1016/S0890-5401(03)00009-9 – ident: S0960129521000505_ref92 doi: 10.1016/j.ic.2015.12.013 – volume: 8 start-page: 1 year: 2011 ident: S0960129521000505_ref33 article-title: Linear dependent types and relative completeness publication-title: Logical Methods in Computer Science – ident: S0960129521000505_ref73 doi: 10.1016/S0168-0072(98)00040-2 – volume: 7 start-page: 258 year: 2000 ident: S0960129521000505_ref63 article-title: A type system for bounded space and functional in-place update publication-title: Nordic Journal of Computing |
| SSID | ssj0013109 |
| Score | 2.2603896 |
| Snippet | This paper is meant to be a survey about implicit characterizations of complexity classes by fragments of higher-order programming languages, with a special... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 760 |
| SubjectTerms | Algebra Algorithms Calculus Complexity Complexity theory Computer science Programming languages Subsystems |
| Subtitle | A Survey in Memory of Martin Hofmann |
| Title | Implicit computation complexity in higher-order programming languages |
| URI | https://www.proquest.com/docview/2771544411 |
| Volume | 32 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3NS8MwFA9uu3jxW5zOkYMnIbjmq81JVDan4BBxsFtZ0hQH2k1XD_73vqSpYwi7laS9vPR9__J7CF1wwXNqZEKYMpCgyJ4hEOVbkrFpIllstIrcBeenkRyO-eNETELBbRlglbVN9IY6mxtXI7-iceyIY3gUXS8-iZsa5bqrYYRGA7XABCeQfLVu-6Pnl1UfIapAHhCnE_Bsou5retJoWHRrNPIsKGLdM60bZu9tBntoJ4SJ-KY61320ZYsDtFuPYMBBIw9R_8EjwmclNn7Py9k_O6LL8gfPCvzmoRzEk2zigMf6AI-F61rl8giNB_3XuyEJkxGIoT1WEsWMkFapXEotbMymtKcctbqKaWa1EoZZmknNDacGMricw47UUe56jhY8EDtGzWJe2BOEIeCCFCPLIfMxPNeOfz6bWiWYzkCBMtlGvVoqqQm04W56xXta4cPi9J8g2-jy75NFxZmx6eVOLeo0qM8yXR326ebtM7RN3X0EXxbpoGb59W3PIUoodRc1ksF9N_wQv-fxuCQ |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07T8MwED7xGGDhjSgU8AALkkVjO049IISgpaWPqZW6hcZxRCVogQah_il-I2cnoaqQ2NgiX5LhfOd7-juAM-GLhGlZpVxpDFBkRVP08g2N-bAqeaAj5dkLzp2ubPTFw8AfLMFXcRfGtlUWZ6I7qOOJtjnySxYEFjhGeN716xu1U6NsdbUYoZGJRcvMPjFkm14173B_zxmr13q3DZpPFaCaVXhKFde-NEolUka-CfiQVZSFJVcBi02kfM0Ni2UktGAao59EIEVGXmLrdQZPb47_XYZVwbmyGlWt38-rFl7WUoJRAUU76hdVVAdRjYt2jXkOc8VftIOLZsDZtvoWbOROKbnJpGgblsx4BzaLgQ8k1_9dqDVd__koJdrR3K66Zwurmc7IaEyeXOMIdZCeJO_-ekH7SIrM6HQP-v_CsX1YGU_G5gAIuncY0MQJxllaJJFFu4-HRvk8ilFdY1mCSsGVUOcg5XZWxnOYdaMF4S9GluDi55PXDKHjr5fLBavDXFmn4Vy0Dv8mn8Jao9dph-1mt3UE68zehHAJmTKspO8f5hj9kzQ6cUJB4PG_pfAbpjbw4g |
| 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=Implicit+computation+complexity+in+higher-order+programming+languages&rft.jtitle=Mathematical+structures+in+computer+science&rft.au=U+Dal+Lago&rft.date=2022-06-01&rft.pub=Cambridge+University+Press&rft.issn=0960-1295&rft.eissn=1469-8072&rft.volume=32&rft.issue=6&rft.spage=760&rft.epage=776&rft_id=info:doi/10.1017%2FS0960129521000505 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0960-1295&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0960-1295&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0960-1295&client=summon |