{"id":"https://openalex.org/W2010663699","doi":"https://doi.org/10.1016/0304-3975(94)90014-0","title":"A co-induction principle for recursively defined domains","display_name":"A co-induction principle for recursively defined domains","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W2010663699","doi":"https://doi.org/10.1016/0304-3975(94)90014-0","mag":"2010663699"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)90014-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90014-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","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/A5035484728","display_name":"Andrew M. Pitts","orcid":"https://orcid.org/0000-0001-7775-3471"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Andrew M Pitts","raw_affiliation_strings":["University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge CB2 3QG, UK","University of Cambridge, Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge CB2 3QG, UK","institution_ids":["https://openalex.org/I241749"]},{"raw_affiliation_string":"University of Cambridge, Cambridge, UK","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035484728"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":10.7351,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.98446233,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"124","issue":"2","first_page":"195","last_page":"219"},"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.9997000098228455,"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.9997000098228455,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9983000159263611,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/domain-theory","display_name":"Domain theory","score":0.6301554441452026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5990179181098938},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.5856820940971375},{"id":"https://openalex.org/keywords/partial-function","display_name":"Partial function","score":0.5778606534004211},{"id":"https://openalex.org/keywords/least-fixed-point","display_name":"Least fixed point","score":0.572234034538269},{"id":"https://openalex.org/keywords/finitary","display_name":"Finitary","score":0.5685030817985535},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.5431214570999146},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.5310585498809814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48392730951309204},{"id":"https://openalex.org/keywords/binary-operation","display_name":"Binary operation","score":0.4831397235393524},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.4792352020740509},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4738849997520447},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4728546440601349},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.4516257345676422},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.43827635049819946},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4367297291755676},{"id":"https://openalex.org/keywords/conservative-extension","display_name":"Conservative extension","score":0.43597257137298584},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.429558128118515},{"id":"https://openalex.org/keywords/mathematical-induction","display_name":"Mathematical induction","score":0.41651803255081177},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.3052392601966858},{"id":"https://openalex.org/keywords/fixed-point-theorem","display_name":"Fixed-point theorem","score":0.2809387743473053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27964693307876587},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.25769537687301636},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18352890014648438},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13225910067558289}],"concepts":[{"id":"https://openalex.org/C29585364","wikidata":"https://www.wikidata.org/wiki/Q1079166","display_name":"Domain theory","level":2,"score":0.6301554441452026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5990179181098938},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.5856820940971375},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.5778606534004211},{"id":"https://openalex.org/C27333817","wikidata":"https://www.wikidata.org/wiki/Q6134913","display_name":"Least fixed point","level":5,"score":0.572234034538269},{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.5685030817985535},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.5431214570999146},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.5310585498809814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48392730951309204},{"id":"https://openalex.org/C185529760","wikidata":"https://www.wikidata.org/wiki/Q164307","display_name":"Binary operation","level":2,"score":0.4831397235393524},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.4792352020740509},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4738849997520447},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4728546440601349},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.4516257345676422},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.43827635049819946},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4367297291755676},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.43597257137298584},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.429558128118515},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.41651803255081177},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.3052392601966858},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.2809387743473053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27964693307876587},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.25769537687301636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18352890014648438},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13225910067558289},{"id":"https://openalex.org/C28642324","wikidata":"https://www.wikidata.org/wiki/Q656176","display_name":"Schauder fixed point theorem","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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},{"id":"https://openalex.org/C206929604","wikidata":"https://www.wikidata.org/wiki/Q530152","display_name":"Picard\u2013Lindel\u00f6f theorem","level":3,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0304-3975(94)90014-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90014-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.295.4712","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.4712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cl.cam.ac.uk/~amp12/papers/coiprd/coiprd.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.7415","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.7415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cl.cam.ac.uk/papers/amp12/coiprd.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310174","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W79336753","https://openalex.org/W172004165","https://openalex.org/W258022877","https://openalex.org/W1484366641","https://openalex.org/W1503973138","https://openalex.org/W1507693023","https://openalex.org/W1513445195","https://openalex.org/W1605925834","https://openalex.org/W1829244603","https://openalex.org/W1978375202","https://openalex.org/W2024873396","https://openalex.org/W2062024564","https://openalex.org/W2071095465","https://openalex.org/W2088941870","https://openalex.org/W2156876717","https://openalex.org/W2167949883","https://openalex.org/W2318815169","https://openalex.org/W6603250414","https://openalex.org/W6606951199","https://openalex.org/W6967071064"],"related_works":["https://openalex.org/W3100289835","https://openalex.org/W4242488152","https://openalex.org/W2461298742","https://openalex.org/W2002433529","https://openalex.org/W955824272","https://openalex.org/W1963780006","https://openalex.org/W2069856580","https://openalex.org/W2065676782","https://openalex.org/W3146919735","https://openalex.org/W2010663699"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}