乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:45:11Z","timestamp":1648601111147},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/0012-365x(91)90147-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"233-265","source":"Crossref","is-referenced-by-count":11,"title":["Classes of finite relations as initial abstract data types I"],"prefix":"10.1016","volume":"90","author":[{"given":"Virgil-Emil","family":"C\u0103z\u0103nescu","sequence":"first","affiliation":[]},{"given":"Gheorghe","family":"\u015etef\u0103nescu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90147-T_BIB1","first-page":"203","article-title":"A finite axiomatization of flowchart schemes","volume":"8","author":"Bartha","year":"1987","journal-title":"Acta Cybernet."},{"key":"10.1016\/0012-365X(91)90147-T_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0209002","article-title":"Solutions of the iteration operations and extensions of the scalar iteration operation","volume":"9","author":"Bloom","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(91)90147-T_BIB3","first-page":"1","article-title":"The leftmost derivations of a rewriting system form a free algebraic structure","volume":"31","author":"C\u0103z\u0103nescu","year":"1986","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"10.1016\/0012-365X(91)90147-T_BIB4","first-page":"107","article-title":"Some properties of pointed algebraic theories","volume":"39","author":"C\u0103z\u0103nescu","year":"1987","journal-title":"Stud. Cerc. Mat."},{"key":"10.1016\/0012-365X(91)90147-T_BIB5","article-title":"A formal representation of flowchart schemes","volume":"22","author":"C\u0103z\u0103nescu","year":"1987","journal-title":"Preprint Ser. Math."},{"key":"10.1016\/0012-365X(91)90147-T_BIB6","first-page":"153","article-title":"Finite relations as initial abstract data types","author":"C\u0103z\u0103nescu","year":"1987","journal-title":"INFO-IASI'87"},{"key":"10.1016\/0012-365X(91)90147-T_BIB7","article-title":"Towards a new algebraic foundation of flowchart scheme theory","volume":"43","author":"C\u0103z\u0103nescu","year":"1987","journal-title":"Preprint Ser. Math."},{"key":"10.1016\/0012-365X(91)90147-T_BIB8","series-title":"Summaries 3rd East European Category seminar","article-title":"On some symmetric strict monoidal categories","author":"C\u0103z\u0103nescu","year":"1988"},{"key":"10.1016\/0012-365X(91)90147-T_BIB9","author":"C\u0103z\u0103nescu","year":"1989","journal-title":"Bi-flow-calculus"},{"key":"10.1016\/0012-365X(91)90147-T_BIB10","article-title":"Fundamentals of Algebraic Specification","volume":"Vol. 1","author":"Ehrig","year":"1985"},{"key":"10.1016\/0012-365X(91)90147-T_BIB11","series-title":"Semantics of Algorithmic Languages","article-title":"Algebraic theories and program schemes","volume":"188","author":"Elgot","year":"1971"},{"key":"10.1016\/0012-365X(91)90147-T_BIB12","series-title":"Proceedings Logic Colloquium 1973","article-title":"Monadic computation and iterative algebraic theories","author":"Elgot","year":"1975"},{"key":"10.1016\/0012-365X(91)90147-T_BIB13","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","article-title":"On the algebraic structure of rooted trees","volume":"16","author":"Elgot","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(91)90147-T_BIB14","series-title":"Research Report RC-8221","article-title":"An equational axiomatization of the algebra of reducible flowchart schemes","author":"Elgot","year":"1980"},{"key":"10.1016\/0012-365X(91)90147-T_BIB15","first-page":"147","article-title":"On the weak equivalence of Elgot's flowchart schemata","volume":"7","author":"\u00c9sik","year":"1985","journal-title":"Acta Cybernet."},{"key":"10.1016\/0012-365X(91)90147-T_BIB16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-07854-1_169","article-title":"Some fundamentals of order algebraic semantics","volume":"45","author":"Goguen","year":"1976","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/0012-365X(91)90147-T_BIB17","series-title":"Current Trends in Programming Methodology","first-page":"80","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","volume":"4","author":"Goguen","year":"1978"},{"key":"10.1016\/0012-365X(91)90147-T_BIB18","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1073\/pnas.50.5.869","article-title":"Functorial semantics of algebraic theories","volume":"50","author":"Lawvere","year":"1963","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"10.1016\/0012-365X(91)90147-T_BIB19","series-title":"Categories for the Working Mathematician","author":"MacLane","year":"1971"},{"key":"10.1016\/0012-365X(91)90147-T_BIB20","series-title":"CAAP'86","first-page":"60","article-title":"An algebraic theory of flowchart schemes","volume":"214","author":"\u015etef\u0103nescu","year":"1986"},{"key":"10.1016\/0012-365X(91)90147-T_BIB21","first-page":"223","article-title":"Notes on algebraic fundamentals for theoretical computer science","volume":"109","author":"Thatcher","year":"1979"},{"key":"10.1016\/0012-365X(91)90147-T_BIB22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(81)90080-3","article-title":"More on advice on structuring programming and proving them correct","volume":"15","author":"Thatcher","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0012-365X(91)90147-T_BIB23","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08921-7_58","article-title":"Programming languages as mathematical objects","volume":"64","author":"Wagner","year":"1978","journal-title":"Lecture Notes in Comput. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190147T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190147T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:58:35Z","timestamp":1555135115000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190147T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["0012365X9190147T"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90147-t","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}