{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:41:12Z","timestamp":1648885272501},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4095,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0304-3975(00)00332-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:21:34Z","timestamp":1027653694000},"page":"91-110","source":"Crossref","is-referenced-by-count":1,"title":["Relative definability of boolean functions via hypergraphs"],"prefix":"10.1016","volume":"278","author":[{"given":"Antonio","family":"Bucciarelli","sequence":"first","affiliation":[]},{"given":"Pasquale","family":"Malacaria","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00332-7_BIB1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, R. Jagadeesan, P. Malacaria, Full abstraction for PCF, Inform. and Comput. 163 (2000) 409\u2013470.","DOI":"10.1006\/inco.2000.2930"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB2","unstructured":"R. Amadio, P.-L. Curien, Domains and Lambda Calculi, Cambridge Univ. Press, 1988."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB3","doi-asserted-by":"crossref","unstructured":"G. Berry, Stable models of typed lambda-calculi, in: Proc. 5th Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 62, Springer, Berlin, 1978.","DOI":"10.1007\/3-540-08860-1_7"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB4","unstructured":"G. Berry, Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des lambda-calculs typ\u00e9s, Th\u00e8se de Doctorat d'Etat, Universit\u00e9 Paris 7, 1979."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-3975(96)00234-4","article-title":"Degrees of parallelism in the continuous type hierarchy","volume":"177","author":"Bucciarelli","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(00)00332-7_BIB6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/inco.1994.1033","article-title":"Sequentiality in an extensional framework","volume":"110","author":"Bucciarelli","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB7","doi-asserted-by":"crossref","unstructured":"L. Colson, T. Ehrhard, On strong stability and higher-order sequentiality, Proc. 9th Symp. on Logic in Computer Science, IEEE Press, New York, 1994.","DOI":"10.1109\/LICS.1994.316082"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0304-3975(00)00173-0","article-title":"Parallel and serial hypercoherences","volume":"247","author":"Ehrhard","year":"2000","journal-title":"Theoret. Comp. Sci."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","article-title":"The system F of variable types fifteen years later","volume":"45","author":"Girard","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB10","doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland, L. Ong, On full abstraction for PCF: I, II and III, Inform. and Comput. 163 (2000) 285\u2013408.","DOI":"10.1006\/inco.2000.2917"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB11","unstructured":"G. Khan, G. Plotkin, Domaines concrets, Report IRIA-LABORIA 336, 1978, (republished in the special issue of Theoret. Comput. Sci., dedicated to Professor C. B\u00f6hm's 70th birthay, 1993)."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB12","doi-asserted-by":"crossref","unstructured":"R. Loader, Finitary PCF is not decidable, Theoret. Comput. Sci. 266 (2001) 341\u2013364.","DOI":"10.1016\/S0304-3975(00)00194-8"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB13","doi-asserted-by":"crossref","unstructured":"R. Milner, Models of LCF, Computer Science Department Memo, AIM-186\/CS 332, Stanford University, 1973.","DOI":"10.21236\/AD0758645"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/inco.1995.1103","article-title":"Kripke logical relations and PCF","volume":"120","author":"O'Hearn","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB16","doi-asserted-by":"crossref","unstructured":"V.Y. Sazonov, Degrees of parallelism in computations, in: Proc. Conf. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 45, Springer, Berlin, 1976.","DOI":"10.1007\/3-540-07854-1_223"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB17","doi-asserted-by":"crossref","unstructured":"D. Scott, A type theoretic alternative to OWHY, CUCH, ISWIM, Theoret. Comput. Sci. 121 (1993) 411\u2013440 (manuscript circulating since 1969).","DOI":"10.1016\/0304-3975(93)90095-B"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB18","doi-asserted-by":"crossref","unstructured":"K. Sieber, Reasoning about sequential functions via logical relations, in: M. Fourman, P. Johnstone, A. Pitts (Eds.), Proc. LMS Symp. on Applications of Categories in Computer Science, LMS Lecture Note Series, vol. 177, Cambridge University Press, Cambridge, 1992.","DOI":"10.1017\/CBO9780511525902.015"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB19","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0304-3975(91)90337-2","article-title":"Interdefinability of parallel operations in PCF","volume":"79","author":"Stoughton","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00332-7_BIB20","doi-asserted-by":"crossref","unstructured":"A. Stoughton, Mechanizing logical relations, in: Proc. 9th Internat. Conf. on Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, vol. 802, Springer, Berlin, 1994.","DOI":"10.1007\/3-540-58027-1_18"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB21","doi-asserted-by":"crossref","unstructured":"M.B. Trakhtenbrot, On representation of sequential and parallel functions, in: Proc. 4th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 32, Springer, Berlin, 1975.","DOI":"10.1007\/3-540-07389-2_226"},{"key":"10.1016\/S0304-3975(00)00332-7_BIB22","unstructured":"J. Vuillemin, Proof techniques for recursive programs, Ph.D. Thesis, Stanford University, 1973."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T08:53:19Z","timestamp":1580892799000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0304397500003327"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00332-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}