{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:54:02Z","timestamp":1776891242578,"version":"3.51.2"},"reference-count":7,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"1","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"unspecified","delay-in-days":5059,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We show that any recursively enumerable subset of a data structure can be regarded as the solution set to a B\u00f6hm-out problem.<\/jats:p>","DOI":"10.1017\/s0956796800001234","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T11:12:13Z","timestamp":1226056333000},"page":"51-64","source":"Crossref","is-referenced-by-count":0,"title":["Defining data structures via B\u00f6hm-out"],"prefix":"10.46298","volume":"5","author":[{"given":"Enrico","family":"Tronci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"S0956796800001234_ref006","doi-asserted-by":"crossref","unstructured":"Tronci E. (1991a) Equational programming in \u03bb-calculus. Proc. LICS 91, Amsterdam July 15\u201318,IEEE Computer Society, pp. 191\u2013202.","DOI":"10.1109\/LICS.1991.151644"},{"key":"S0956796800001234_ref007","unstructured":"Tronci E. (1991b) Equational programming in \u03bb-calculus via SL-systems. PhD thesis, Department of Mathematics, Carnegie Mellon University."},{"key":"S0956796800001234_ref004","unstructured":"Leivant D. (1981) Reasoning about functional programs and complexity classes associated with type disciplines. 24th Ann. Symp. on Foundation of Computer Science, pp. 460\u2013469."},{"key":"S0956796800001234_ref001","volume-title":"The Lambda-calculus","author":"Barendregt","year":"1984"},{"key":"S0956796800001234_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90148-5"},{"key":"S0956796800001234_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90135-5"},{"key":"S0956796800001234_ref003","volume-title":"A Course in Universal Algebra. Graduate Texts in Mathematics 78","author":"Burris","year":"1981"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800001234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:18:07Z","timestamp":1776889087000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800001234\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["S0956796800001234"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800001234","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}