A tier-based typed programming language characterizing Feasible Functionals
The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming language with a type system guaranteeing this complexi...
Uloženo v:
| Vydáno v: | Logical methods in computer science Ročník 18, Issue 1; číslo 1 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Logical Methods in Computer Science Association
24.02.2022
Logical Methods in Computer Science e.V |
| Témata: | |
| ISSN: | 1860-5974, 1860-5974 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of
the class FP of type-1 functions computable in polynomial time. Several
characterizations have been suggested in the literature, but none of these
present a programming language with a type system guaranteeing this complexity
bound. We give a characterization of BFF$_2$ based on an imperative language
with oracle calls using a tier-based type system whose inference is decidable.
Such a characterization should make it possible to link higher-order complexity
with programming theory. The low complexity (cubic in the size of the program)
of the type inference algorithm contrasts with the intractability of the
aforementioned methods and does not overly constrain the expressive power of
the language. |
|---|---|
| AbstractList | The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming language with a type system guaranteeing this complexity bound. We give a characterization of BFF$_2$ based on an imperative language with oracle calls using a tier-based type system whose inference is decidable. Such a characterization should make it possible to link higher-order complexity with programming theory. The low complexity (cubic in the size of the program) of the type inference algorithm contrasts with the intractability of the aforementioned methods and does not overly constrain the expressive power of the language. The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming language with a type system guaranteeing this complexity bound. We give a characterization of BFF$_2$ based on an imperative language with oracle calls using a tier-based type system whose inference is decidable. Such a characterization should make it possible to link higher-order complexity with programming theory. The low complexity (cubic in the size of the program) of the type inference algorithm contrasts with the intractability of the aforementioned methods and does not overly constrain the expressive power of the language. |
| Author | Kapron, Bruce M. Hainry, Emmanuel Marion, Jean-Yves Péchoux, Romain |
| Author_xml | – sequence: 1 givenname: Emmanuel orcidid: 0000-0002-9750-0460 surname: Hainry fullname: Hainry, Emmanuel – sequence: 2 givenname: Bruce M. surname: Kapron fullname: Kapron, Bruce M. – sequence: 3 givenname: Jean-Yves surname: Marion fullname: Marion, Jean-Yves – sequence: 4 givenname: Romain orcidid: 0000-0003-0601-5425 surname: Péchoux fullname: Péchoux, Romain |
| BackLink | https://inria.hal.science/hal-03722168$$DView record in HAL |
| BookMark | eNpVUUFOwzAQtFCRKNAPcMqRHgJer5PY3KqK0opKXOBsbRwnTZUmlZMildeTtAjBHHZWo9k57FyzUd3UjrE74A8yFlo9VjvbhqDu4QlxKrgQF2wMKuZhpBM5-rNfsUnbbnkPRFAiHrPXWdCVzocptS4LuuO-n3vfFJ52u7Iugorq4kCFC-yGPNnO-fJr0BeO2jKtXLA41LYrm5qq9pZd5j25yQ_fsI_F8_t8Ga7fXlbz2Tq0KEUXSo4c84xnqY1TkFw4QBmDtHEiyWUiUhozUmCldamK8kwrFZGGVJNMkBPesNU5N2toa_a-3JE_moZKcxIaXxjyXWkrZ4TuAS4CIi2dTFMtEtl_CAVaomTImp6zNlT9i1rO1mbQOCZCQKw-ofeKs9f6pm29y38PgJtTE2ZowoAyYBDN0AR-A1OEfW8 |
| ContentType | Journal Article |
| Copyright | licence_http://creativecommons.org/publicdomain/zero |
| Copyright_xml | – notice: licence_http://creativecommons.org/publicdomain/zero |
| DBID | AAYXX CITATION 1XC VOOES DOA |
| DOI | 10.46298/lmcs-18(1:33)2022 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_299991e51aa94e4bb9274202323caa7a oai:HAL:hal-03722168v1 10_46298_lmcs_18_1_33_2022 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB 1XC VOOES |
| ID | FETCH-LOGICAL-c342t-40303fd0dbc6b1402e134614c674aed25893da81c4ceb85fd9885a91b9a4730a3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000762032000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:52:01 EDT 2025 Wed Nov 05 08:00:14 EST 2025 Sat Nov 29 06:21:51 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c342t-40303fd0dbc6b1402e134614c674aed25893da81c4ceb85fd9885a91b9a4730a3 |
| ORCID | 0000-0003-0601-5425 0000-0002-9750-0460 0009-0002-8262-3887 |
| OpenAccessLink | https://doaj.org/article/299991e51aa94e4bb9274202323caa7a |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_299991e51aa94e4bb9274202323caa7a hal_primary_oai_HAL_hal_03722168v1 crossref_primary_10_46298_lmcs_18_1_33_2022 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-02-24 |
| PublicationDateYYYYMMDD | 2022-02-24 |
| PublicationDate_xml | – month: 02 year: 2022 text: 2022-02-24 day: 24 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2022 |
| Publisher | Logical Methods in Computer Science Association Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science Association – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.2527025 |
| Snippet | The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of
the class FP of type-1 functions computable in polynomial time. Several... The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several... |
| SourceID | doaj hal crossref |
| SourceType | Open Website Open Access Repository Index Database |
| SubjectTerms | Computation and Language Computer Science computer science - logic in computer science computer science - programming languages Logic in Computer Science |
| Title | A tier-based typed programming language characterizing Feasible Functionals |
| URI | https://inria.hal.science/hal-03722168 https://doaj.org/article/299991e51aa94e4bb9274202323caa7a |
| Volume | 18, Issue 1 |
| WOSCitedRecordID | wos000762032000001&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07SwQxEA4iFja-xfNFEAtFFjePzSZ2p3gInoeFil3Ia1E4T_FWCwt_u5Ps3nFWNjZbhCUJ3yT5vpkkE4QOq9z6Eog2sz5nGSfgp1hXwFh2TJmyNEykPNsP_XIwkI-P6nbmqa94JqxJD9wAdwrLJUiYUBBjFA_cWhU3F4FpKHPGlEkageqZcabSGsxYFM7NLRkuqJKnwxc3zog8ImeMHUMF9BcTpYT9wC9Pk3hq4pfeClpqhSHuNh1aRXNhtIaWJ48u4HYOrqPrLq6ByrJIPx7HCKrH7SGrF6AhPAlAYjdNxfwVy0HrwegfBtwDJmsCgOMNdN-7vLu4ytoXETLHOK3B2QPGqXzurRMWXCMaCONAsE6U3ARPC1Af3kjiuAtWFpVXUhZGEasMh6ls2CaaH72OwhbCNIJYeKu8AQ_NC2NNkEpUlchN3JnpoJMJOvqtSXyhwWFIWOqIpSZSE82Yjlh20HkEcPpnTFqdCsCUujWl_suUHXQA8P-q46rb17EsZyWlRMhPsv0fLe2gxdjrdDWd76L5-v0j7KEF91k_j9_301CC78335Q-hwsye |
| linkProvider | Directory of Open Access Journals |
| 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+tier-based+typed+programming+language+characterizing+Feasible+Functionals&rft.jtitle=Logical+methods+in+computer+science&rft.au=Emmanuel+Hainry&rft.au=Bruce+M.+Kapron&rft.au=Jean-Yves+Marion&rft.au=Romain+P%C3%A9choux&rft.date=2022-02-24&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=18%2C+Issue+1&rft_id=info:doi/10.46298%2Flmcs-18%281%3A33%292022&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_299991e51aa94e4bb9274202323caa7a |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |