{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:57:55Z","timestamp":1693857475091},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":7168,"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":[[1993,12]]},"DOI":"10.1016\/0304-3975(93)90092-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"309-321","source":"Crossref","is-referenced-by-count":9,"title":["Functions over free algebras definable in the simply typed lambda calculus"],"prefix":"10.1016","volume":"121","author":[{"given":"Daniel","family":"Leivant","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90092-8_BIB1","first-page":"71","article-title":"Fixpoint extensions of first-order logic and datalog-like languages","author":"Abiteboul","year":"1989","journal-title":"Proc. 4th IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(93)90092-8_BIB2","first-page":"209","article-title":"Generic computation and its complexity","author":"Abiteboul","year":"1991","journal-title":"Proc. 23rd ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(93)90092-8_BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01201998","article-title":"A new recursion-theoretic characterization of the poly-time functions","volume":"2","author":"Bellantoni","year":"1992","journal-title":"Computational Complexity"},{"key":"10.1016\/0304-3975(93)90092-8_BIB4","first-page":"108","article-title":"Demons, engines and the Second Law","author":"Bennett","year":"1986","journal-title":"Sci. Am."},{"key":"10.1016\/0304-3975(93)90092-8_BIB5","first-page":"193","article-title":"Functional characterizations of uniform log-depth and polylog-depth circuit families","author":"Bloch","year":"1992","journal-title":"Proc. 7th IEEE Conf. on Structure in Complexity"},{"key":"10.1016\/0304-3975(93)90092-8_BIB6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(85)90135-5","article-title":"Automatic synthesis of typed \u03bb-programs on term algebras","volume":"39","author":"B\u00f6hm","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90092-8_BIB7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.24033\/bsmf.1554","article-title":"La Pr\u00e9dicativit\u00e9","volume":"88","author":"Kreisel","year":"1960","journal-title":"Bull. Soc. Math. France"},{"key":"10.1016\/0304-3975(93)90092-8_BIB8","series-title":"Technical Report CMU-CS-89-212","article-title":"Monotonic use of space and computational complexity over abstract structures","author":"Leivant","year":"1989"},{"key":"10.1016\/0304-3975(93)90092-8_BIB9","series-title":"Feasible Mathematics","first-page":"281","article-title":"Subrecursion and lambda representation over free algebras","author":"Leivant","year":"1990"},{"key":"10.1016\/0304-3975(93)90092-8_BIB10","series-title":"Proc. Conf. Record of the 20th Ann. Symp. on Principles of Programming Languages","first-page":"325","article-title":"Stratified functional programs and computational complexity","author":"Leivant","year":"1993"},{"key":"10.1016\/0304-3975(93)90092-8_BIB11","unstructured":"D. Leivant, Predicative Peano theories and the axiomatization of feasible mathematics, to appear."},{"key":"10.1016\/0304-3975(93)90092-8_BIB12","unstructured":"D. Leivant, Abstraction and computational complexity, to appear."},{"key":"10.1016\/0304-3975(93)90092-8_BIB13","series-title":"Fundamenta Informaticae","article-title":"Lambda characterizations of poly-time","author":"Leivant","year":"1993"},{"key":"10.1016\/0304-3975(93)90092-8_BIB14","doi-asserted-by":"crossref","first-page":"222","DOI":"10.2307\/2369948","article-title":"Mathematical logic as based on the theory of types","volume":"30","author":"Russell","year":"1908","journal-title":"Am. J. Math."},{"key":"10.1016\/0304-3975(93)90092-8_BIB15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02276799","article-title":"Definierbare Funktionen im Lambda-Kalkul mit Typen","volume":"17","author":"Schwichtenberg","year":"1976","journal-title":"Archiv Logik Grundlagenforsch."},{"key":"10.1016\/0304-3975(93)90092-8_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01620765","article-title":"The realm of primitive recursion","volume":"27","author":"Simmons","year":"1988","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/0304-3975(93)90092-8_BIB17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(79)90007-0","article-title":"The typed \u03bb-calculus is not elementary recursive","volume":"9","author":"Statman","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90092-8_BIB18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/320856.320867","article-title":"A variant to Turing's theory of computing machines","volume":"4","author":"Wang","year":"1957","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90092-8_BIB19","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0168-0072(91)90019-I","article-title":"\u03bb-definability on free algebras","volume":"51","author":"Zaionc","year":"1991","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900928?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900928?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:14Z","timestamp":1555115114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593900928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0304397593900928"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90092-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}