{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:44:03Z","timestamp":1649094243614},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2001,2]]},"abstract":"<jats:p> In this paper, we study \u03bb<jats:sub>\u2192<\/jats:sub>-representability of functions over (open or closed) term algebras. First, by extending the standard notion of \u03bb<jats:sub>\u2192<\/jats:sub>-representation of closed (or variable-free) terms to open terms and extending the notion of \u03bb<jats:sub>\u2192<\/jats:sub>-representable functions accordingly, we give a recursion-theoretic characterization of the class of \u03bb<jats:sub>\u2192<\/jats:sub>-representable functions over open term algebras. Then, based on this result, we obtain two characterizations of the class of \u03bb<jats:sub>\u2192<\/jats:sub>-representable functions over closed term algebras (i.e., free structures). As a related topic, in the Appendix we give a simple formulation of the recursive word functions, and study their properties in relation to recursive functions on natural numbers and type-free pure \u03bb-calculus. <\/jats:p>","DOI":"10.1142\/s0129054101000394","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T07:04:45Z","timestamp":1027753485000},"page":"3-29","source":"Crossref","is-referenced-by-count":1,"title":["LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS"],"prefix":"10.1142","volume":"12","author":[{"given":"MASAKO","family":"TAKAHASHI","sequence":"first","affiliation":[{"name":"Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Ookayama, Meguro, Tokyo 152-8552, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600061506"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201998"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90135-5"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.2307\/2266170"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028020"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90092-8"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02276799"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90007-0"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90077-6"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90019-I"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054101000394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:46:43Z","timestamp":1565124403000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054101000394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":10,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2001,2]]}},"alternative-id":["10.1142\/S0129054101000394"],"URL":"https:\/\/doi.org\/10.1142\/s0129054101000394","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}