{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:33:34Z","timestamp":1648542814184},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":7533,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0167-6423(92)90037-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"239-279","source":"Crossref","is-referenced-by-count":4,"title":["A system at the cross-roads of functional and logic programming"],"prefix":"10.1016","volume":"19","author":[{"given":"Fairouz","family":"Kamareddine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(92)90037-C_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/S0049-237X(08)71252-7","article-title":"Frege structures and notions of truth and proposition","author":"Aczel","year":"1980","journal-title":"Proceedings Kleene Symposium"},{"key":"10.1016\/0167-6423(92)90037-C_BIB2","article-title":"Non-well Founded Sets","volume":"14","author":"Aczel","year":"1984"},{"key":"10.1016\/0167-6423(92)90037-C_BIB3","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52592-0_53","article-title":"Types in Lambda calculi and programming languages","author":"Barendregt","year":"1990","journal-title":"Proceedings ESOP Conference"},{"key":"10.1016\/0167-6423(92)90037-C_BIB4","series-title":"Foundations of Constructive Mathematics","author":"Beeson","year":"1984"},{"key":"10.1016\/0167-6423(92)90037-C_BIB5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2307\/2025204","article-title":"The iterative conception of sets","volume":"68","author":"Boolos","year":"1971","journal-title":"J. Philos."},{"key":"10.1016\/0167-6423(92)90037-C_BIB6","series-title":"Logic Colloquium'78","first-page":"159","article-title":"Constructive theories of functions and classes","author":"Feferman","year":"1979"},{"key":"10.1016\/0167-6423(92)90037-C_BIB7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.2307\/2274093","article-title":"Towards useful type free theories I","volume":"49","author":"Feferman","year":"1984","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0167-6423(92)90037-C_BIB8","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\/0167-6423(92)90037-C_BIB9","series-title":"Ph.D. Thesis","article-title":"Semantics in a Frege structure","author":"Kamareddine","year":"1989"},{"issue":"1","key":"10.1016\/0167-6423(92)90037-C_BIB10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00203387","article-title":"\u03bb-terms, logic, determiners and quantifiers","volume":"1","author":"Kamareddine","year":"1992","journal-title":"J. Logic Language Inform."},{"issue":"5","key":"10.1016\/0167-6423(92)90037-C_BIB11","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/2.5.579","article-title":"Set theory and nominalisation, Part I","volume":"2","author":"Kamareddine","year":"1992","journal-title":"J. Logic Comput."},{"issue":"6","key":"10.1016\/0167-6423(92)90037-C_BIB12","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/2.6.687","article-title":"Set theory and nominalisation, Part II","volume":"2","author":"Kamareddine","year":"1992","journal-title":"J. Logic Comput."},{"key":"10.1016\/0167-6423(92)90037-C_BIB13","series-title":"Logic Colloquium '73","article-title":"An intuitionistic theory of types: predicative part","author":"Martin-L\u00f6f","year":"1973"},{"issue":"3","key":"10.1016\/0167-6423(92)90037-C_BIB14","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6423(92)90037-C_BIB15","series-title":"Lambda Calculus and Computer Science","first-page":"1","article-title":"Combinators and classes","volume":"37","author":"Scott","year":"1975"},{"issue":"2","key":"10.1016\/0167-6423(92)90037-C_BIB16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF00379765","article-title":"Three theories of nominalized predicates","volume":"44","author":"Turner","year":"1984","journal-title":"Stud. Logica"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290037C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290037C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:55:03Z","timestamp":1555091703000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239290037C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["016764239290037C"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(92)90037-c","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}