{"id":"https://openalex.org/W2964168620","doi":"https://doi.org/10.1145/3209108.3209124","title":"Type-two polynomial-time and restricted lookahead","display_name":"Type-two polynomial-time and restricted lookahead","publication_year":2018,"publication_date":"2018-06-27","ids":{"openalex":"https://openalex.org/W2964168620","doi":"https://doi.org/10.1145/3209108.3209124","mag":"2964168620"},"language":"en","primary_location":{"id":"doi:10.1145/3209108.3209124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209108.3209124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080474978","display_name":"Bruce M. Kapron","orcid":"https://orcid.org/0000-0002-3295-543X"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Bruce M. Kapron","raw_affiliation_strings":["University of Victoria, Victoria, BC, Canada"],"affiliations":[{"raw_affiliation_string":"University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108295991","display_name":"Florian Steinberg","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210119692","display_name":"Numerical Method (China)","ror":"https://ror.org/02ns8zp42","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210119692"]}],"countries":["CN","FR"],"is_corresponding":false,"raw_author_name":"Florian Steinberg","raw_affiliation_strings":["INRIA, Sophia-Antipolis, France","Formally Verified Programs,   Certified Tools and Numerical Computations"],"affiliations":[{"raw_affiliation_string":"INRIA, Sophia-Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Formally Verified Programs,   Certified Tools and Numerical Computations","institution_ids":["https://openalex.org/I4210119692"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080474978"],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":null,"apc_paid":null,"fwci":0.39712492,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.70293355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"579","last_page":"588"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.7935751676559448},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6665726900100708},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6218892335891724},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6147265434265137},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5357825756072998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4910597801208496},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4753934144973755},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.47533440589904785},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4750799536705017},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46673640608787537},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.45646560192108154},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4547102749347687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44622957706451416},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.41521257162094116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2178364396095276},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12469083070755005}],"concepts":[{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.7935751676559448},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6665726900100708},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6218892335891724},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6147265434265137},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5357825756072998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4910597801208496},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4753934144973755},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.47533440589904785},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4750799536705017},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46673640608787537},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.45646560192108154},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4547102749347687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44622957706451416},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.41521257162094116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2178364396095276},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12469083070755005},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3209108.3209124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209108.3209124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02019150v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-02019150","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS 2018 - 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.579-588, ⟨10.1145/3209108.3209124⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W151251173","https://openalex.org/W1596708455","https://openalex.org/W1948484082","https://openalex.org/W1965442792","https://openalex.org/W1973440844","https://openalex.org/W1978001037","https://openalex.org/W1980256844","https://openalex.org/W1981324778","https://openalex.org/W1996332861","https://openalex.org/W2004826968","https://openalex.org/W2036265926","https://openalex.org/W2037028865","https://openalex.org/W2075380453","https://openalex.org/W2093400121","https://openalex.org/W2108005368","https://openalex.org/W2108736782","https://openalex.org/W2114124105","https://openalex.org/W2166160002","https://openalex.org/W2170846453","https://openalex.org/W2177400022","https://openalex.org/W2207885555","https://openalex.org/W2570115677","https://openalex.org/W2588348326","https://openalex.org/W2949139900","https://openalex.org/W3104440546","https://openalex.org/W3122465989","https://openalex.org/W4247998528","https://openalex.org/W4391177866"],"related_works":["https://openalex.org/W98540345","https://openalex.org/W2962921822","https://openalex.org/W4236014005","https://openalex.org/W4389946807","https://openalex.org/W2278478416","https://openalex.org/W4236179144","https://openalex.org/W4376312568","https://openalex.org/W1533694441","https://openalex.org/W2046021909","https://openalex.org/W2310420552"],"abstract_inverted_index":{"International":[0],"audience":[1]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}