乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T14:30:49Z","timestamp":1673015449523},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/0304-3975(93)00130-w","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"277-289","source":"Crossref","is-referenced-by-count":6,"title":["A semantics for \u03bbProlog"],"prefix":"10.1016","volume":"136","author":[{"given":"D.A.","family":"Wolfram","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)00130-W_BIB1","doi-asserted-by":"crossref","first-page":"414","DOI":"10.2307\/2269949","article-title":"Resolution in type theory","volume":"36","author":"Andrews","year":"1971","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.2307\/2272982","article-title":"General models and extensionality","volume":"37","author":"Andrews","year":"1972","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB3","author":"Andrews","year":"1986"},{"key":"10.1016\/0304-3975(93)00130-W_BIB4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A formulation of the simple theory of types","volume":"5","author":"Church","year":"1940","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB5","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"24","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)00130-W_BIB6","article-title":"Implementing theorem provers in logic programming","author":"Felty","year":"1987"},{"key":"10.1016\/0304-3975(93)00130-W_BIB7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.2307\/2964334","article-title":"Concerning formulas of the types A\u2192B\u2228C, A\u2192(Ex)B(x) in intuitionistic formal systems","volume":"25","author":"Harrop","year":"1960","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/2266967","article-title":"Completeness in the theory of types","volume":"15","author":"Henkin","year":"1950","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)00130-W_BIB10","first-page":"92","article-title":"Semantical analysis of intuitionistic logic, I","author":"Kripke","year":"1965"},{"key":"10.1016\/0304-3975(93)00130-W_BIB11","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","article-title":"A logic programming language with lambda-abstraction, function variables, and simple unification","volume":"1","author":"Miller","year":"1991","journal-title":"J. Logic Comput."},{"key":"10.1016\/0304-3975(93)00130-W_BIB12","first-page":"322","article-title":"Abstract syntax and logic programming","volume":"592","author":"Miller","year":"1991"},{"key":"10.1016\/0304-3975(93)00130-W_BIB13","first-page":"247","article-title":"Some uses of higher-order logic in computational linguistics","author":"Miller","year":"1986"},{"key":"10.1016\/0304-3975(93)00130-W_BIB14","first-page":"379","article-title":"A logic programming approach to manipulating formulas and programs","author":"Miller","year":"1987"},{"key":"10.1016\/0304-3975(93)00130-W_BIB15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform proofs as a foundation for logic programming","volume":"51","author":"Miller","year":"1991","journal-title":"Ann. Pure App. Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0168-0072(91)90067-V","article-title":"Kripke-style models for typed lambda-calculus","volume":"51","author":"Mitchell","year":"1991","journal-title":"Ann. Pure App. Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB17","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/96559.96570","article-title":"Higher-order Horn clauses","volume":"37","author":"Nadathur","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)00130-W_BIB18","first-page":"345","article-title":"LEAP: a language with eval and polymorphism","volume":"352","author":"Pfenning","year":"1989"},{"key":"10.1016\/0304-3975(93)00130-W_BIB19","doi-asserted-by":"crossref","first-page":"452","DOI":"10.2307\/2270331","article-title":"Hauptsatz for higher-order logic","volume":"33","author":"Prawitz","year":"1968","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB20","doi-asserted-by":"crossref","first-page":"305","DOI":"10.2307\/2963525","article-title":"Syntactical and semantical properties of simple type theory","volume":"25","author":"Sch\u00fctte","year":"1960","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)00130-W_BIB21","author":"Sch\u00fctte","year":"1977"},{"key":"10.1016\/0304-3975(93)00130-W_BIB22","doi-asserted-by":"crossref","first-page":"399","DOI":"10.2969\/jmsj\/01940399","article-title":"A proof of cut-elimination theorem in simple type-theory","volume":"19","author":"Takahashi","year":"1967","journal-title":"J. Math. Soc. Japan"},{"key":"10.1016\/0304-3975(93)00130-W_BIB23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4099\/jjm1924.23.0_39","article-title":"On a generalized logical calculus","volume":"23","author":"Takeuti","year":"1953","journal-title":"Japan J. Math."},{"key":"10.1016\/0304-3975(93)00130-W_BIB24","author":"Takeuti","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759300130W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759300130W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:08Z","timestamp":1555127528000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759300130W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["030439759300130W"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)00130-w","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}