{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T01:08:22Z","timestamp":1714871302853},"reference-count":93,"publisher":"Elsevier","isbn-type":[{"value":"9780444880741","type":"print"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1016\/b978-0-444-88074-1.50012-3","type":"book-chapter","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T10:36:48Z","timestamp":1404124608000},"page":"321-363","source":"Crossref","is-referenced-by-count":15,"title":["Functional Programming and Lambda Calculus"],"prefix":"10.1016","author":[{"given":"H.P.","family":"BARENDREGT","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib1","series-title":"Structure and Interpretation of Computer Programs","author":"ABELSON","year":"1985"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib2","unstructured":"ABRAMSKY, S., D.M. GABBAI and T.S.E. MAIBAUM, eds., Handbook of Logic in Computer Science (Oxford University Press, Oxford, to appear)."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib3","unstructured":"AUGUSTSSON, L., A compiler for lazy ML, in: Proc. ACM Symp. on LISP and Functional Programming (1984) 218\u2013227."},{"issue":"8","key":"10.1016\/B978-0-444-88074-1.50012-3_bib4","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von Neumann style? A functional style and its algebra of proofs","volume":"21","author":"BACKUS","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib5","volume":"258","year":"1987"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib6","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter lambda model and the completeness of type assignment","volume":"48","author":"BARENDREGT","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib7","series-title":"The Lambda Calculus, its Syntax and Semantics","author":"BARENDREGT","year":"1984"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib8","unstructured":"BARENDREGT, H.P., Lambda calculi with types, to appear in [2]."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib9","first-page":"141","article-title":"Term graph rewriting","volume":"259","author":"BARENDREGT","year":"1987"},{"issue":"3","key":"10.1016\/B978-0-444-88074-1.50012-3_bib10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0890-5401(87)90001-0","article-title":"Needed reduction and spine strategies for the lambda calculus","volume":"75","author":"BARENDREGT","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib11","first-page":"122","article-title":"Functional programming and the language TALE","volume":"224","author":"BARENDREGT","year":"1986"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(85)90135-5","article-title":"Automatic synthesis of typed \u039b-programs on term algebras","volume":"39","author":"B\u00d6HM","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib13","series-title":"Theory of Automata","first-page":"35","article-title":"Introduction to the Cuch","author":"B\u00d6HM","year":"1965"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib14","doi-asserted-by":"crossref","unstructured":"BRUCE, K.B. and A.R. MEYER, The semantics of second order polymorphic lambda calculus, in: [51] 131\u2013144.","DOI":"10.1007\/3-540-13346-1_6"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib15","doi-asserted-by":"crossref","unstructured":"BRUS, T.H., M.C.J.D. VAN EEKELEN, M.O. VAN LEER and M.J. PLASMEIJER, Clean, a language for functional graph rewriting, in: [52] 364\u2013384.","DOI":"10.1007\/3-540-18317-5_20"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib16","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"579","article-title":"A survey of the project AUTOMATH","author":"DE BRUIJN","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib17","series-title":"Recursive Programming Techniques","author":"BURGE","year":"1975"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"Strictness analysis for higher order functions","volume":"7","author":"BURN","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib19","unstructured":"BURSTALL, T., D. MACQUEEN and D. SANELLA, Hope: an experimental applicative language: in: Proc. 1980 LISP Conf. (ACM, New York, 1980) 136\u2013143."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib20","doi-asserted-by":"crossref","unstructured":"CARDELLI, L., A semantics of multiple inheritance, in: Proc. on Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173 (Springer Berlin, 1984) 51\u201368.","DOI":"10.1007\/3-540-13346-1_2"},{"issue":"4","key":"10.1016\/B978-0-444-88074-1.50012-3_bib21","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/6041.6042","article-title":"On understanding types, data abstraction and polymorphism","volume":"17","author":"CARDELLI","year":"1985","journal-title":"Comput. Surv."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib22","doi-asserted-by":"crossref","first-page":"354","DOI":"10.2307\/2371045","article-title":"An unsolvable problem of elementary number theory","volume":"58","author":"CHURCH","year":"1936","journal-title":"Amer. J. Math."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib23","series-title":"The Calculi of Lambda Conversion","author":"CHURCH","year":"1941"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib24","doi-asserted-by":"crossref","unstructured":"COPPO, M., A completeness result for recursively defined types, in: Proc. 12th Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 194 (Springer, Berlin, 1985) 120\u2013129.","DOI":"10.1007\/BFb0015737"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib25","first-page":"151","article-title":"Constructions: a higher-order proof system for mechanizing mathematics","volume":"203","author":"COQUAND","year":"1985"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib26","doi-asserted-by":"crossref","unstructured":"COUSINEAU, G., P.-L. CURIEN and B. ROBINET, eds., Proceedings on Combinators and Functional Programming Languages, Lecture Notes in Computer Science, Vol. 242 (Springer, Berlin, 1985).","DOI":"10.1007\/3-540-17184-3"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib27","series-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"CURIEN","year":"1985"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib28","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1111\/j.1746-8361.1969.tb01183.x","article-title":"Modified basic functionality in combinatory logic","volume":"23","author":"CURY","year":"1969","journal-title":"Dialectica"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib29","year":"1982"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib30","series-title":"Computability and Unsolvability","author":"DAVIS","year":"1958"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib31","series-title":"Functional Programming","author":"EISENBACH","year":"1987"},{"issue":"3","key":"10.1016\/B978-0-444-88074-1.50012-3_bib32","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02483849","article-title":"Algebras and combinators","volume":"13","author":"ENGELER","year":"1981","journal-title":"Algebra Universalis"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib33","series-title":"Functional Programming","author":"FIELD","year":"1987"},{"issue":"1","key":"10.1016\/B978-0-444-88074-1.50012-3_bib34","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/322358.322370","article-title":"The expressiveness of simple and second-order type structures","volume":"30","author":"FORTUNE","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib35","first-page":"22","article-title":"Equality between functionals","volume":"453","author":"FRIEDMAN","year":"1975"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib36","unstructured":"GIRARD, J.-Y., Intepr\u00e9tation fonctionelle et \u00e9limination des coupures dans l'arithmetique d'ordre sup\u00e9rieur, Ph.D. Thesis, Univ. de Paris VIII, 1972."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib37","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","article-title":"The system F of variable types, fifteen years later","volume":"45","author":"GIRARD","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib38","series-title":"Proofs and Types","author":"GIRARD","year":"1989"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib39","volume":"78","author":"GORDON","year":"1978"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib40","series-title":"Functional Programming, Application and Implementation","author":"HENDERSON","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib41","first-page":"29","article-title":"The principal type-scheme of an object in combinatory logic","volume":"146","author":"HINDLEY","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib42","series-title":"Introduction to Combinators and \u03bb-calculus","author":"HINDLEY","year":"1986"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib43","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"479","article-title":"The formulae-as-types notion of construction","author":"HOWARD","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib44","doi-asserted-by":"crossref","unstructured":"HUDAK, P. and B. GOLDBERG, Serial combinators: optimal grains of parallelism, in: [50] 382\u2013399.","DOI":"10.1007\/3-540-15975-4_49"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib45","unstructured":"HUET, G. and J.-J. L\u00c9VY, Call by need computations in non-ambiguous term rewriting systems, Tech. Report 359, INRIA, Le Chesnay, France, 1979."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib46","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: a survey","author":"HUET","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib47","unstructured":"HUGHES, J., Supercombinators, a new implementation method for applicative languages, in: Proc. ACM Symp. on Lisp and Functional Programming (1982) 1\u201310."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib48","series-title":"Contemporary Mathematics, vol. 92","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/092\/1003199","article-title":"The theory of constructions: categorical semantics and topos-theory","author":"HYLAND","year":"1989"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib49","unstructured":"JOHNSSON, T., Efficient compilation of lazy evaluation, in: Proc. ACM Conf. on Compiler Construction (1984) 58\u201369."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib50","volume":"201","author":"JOUANNOUD","year":"1985"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib51","volume":"173","year":"1984"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib52","doi-asserted-by":"crossref","unstructured":"KAHN, G. et al., eds., Proc. 3th Internat. Conf. on Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science, Vol. 274 (Springer, Berlin, 1987).","DOI":"10.1007\/3-540-18317-5"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib53","series-title":"The complexity of a translation of lambda calculus to combinators","author":"KENNAWAY","year":"1982"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib54","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1215\/S0012-7094-36-00227-2","article-title":"\u03bb-definability and recursiveness","volume":"2","author":"KLEENE","year":"1936","journal-title":"Duke Math. J."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib55","volume":"127","author":"KLOP","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib56","unstructured":"KLOP, J.W., Term rewrite systems, to appear in [2]."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib57","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"LANDIN","year":"1963","journal-title":"Comput. J."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib58","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/363744.363749","article-title":"A correspondence between ALGOL 60 and Church's lambda notation","volume":"8","author":"LANDIN","year":"1965","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/B978-0-444-88074-1.50012-3_bib59","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","article-title":"The next 700 programming languages","volume":"9","author":"LANDIN","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib60","series-title":"Advances in Programming and Nonnumerical Computation","first-page":"97","article-title":"A \u03bb-calculus approach","author":"LANDIN","year":"1966"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib61","unstructured":"MACQUEEN, D., G. PLOTKIN and R. SETHI, An ideal model for recursive polymorphic types, in: Proc. 11th Ann. ACM Symp. on Principles of Programming Languages (1984) 165\u2013174."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib62","series-title":"Intuitionistic Type Theory","author":"MARTIN-L\u00d6F","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib63","series-title":"The Lisp 1.5 Programmers Manual","author":"MCCARTHY","year":"1962"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib64","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed \u03bb-calculi","volume":"4","author":"MILNER","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib65","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"MILNER","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib66","unstructured":"MILNER, R., A proposal for standard ML, in: Proc. ACM Symp. on Lisp and Functional Programming (1984) 184\u2013197."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib67","unstructured":"MOGGI, E., The partial lambda calculus, Ph.D. Thesis, Dept. of Comput. Sci., Univ. of Edinburgh, 1988."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib68","unstructured":"MORRIS, J.H., Lambda calculus models of programming languages, Ph.D. Thesis, MIT, Cambridge, MA, 1968."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib69","series-title":"Complexity of combinatory code","author":"MULDER","year":"1985"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib70","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(86)90041-3","article-title":"Fully abstract submoccalculus","volume":"33","author":"MULMULEY","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib71","unstructured":"MYCROFT, A., Abstract interpretation and optimising transformations for applicative programs, Ph.D. Thesis, Dept. of Computer Science, Univ. of Edinburgh, 1981."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib72","series-title":"Equational Logic as a Programming Language","author":"O'DONNELL","year":"1985"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib73","unstructured":"ONG, L., Lazy lambda calculus: an investigation into the foundation of functional programming, Ph.D. Thesis, Imperial College, Univ. of London, London, 1988."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib74","series-title":"The Implementation of Functional Programming Languages","author":"PEYTON-JONES","year":"1986"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib75","series-title":"A set-theoretical definition of application","author":"PLOTKIN","year":"1972"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib76","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name and call-by-value and the lambda calculus","volume":"1","author":"PLOTKIN","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib77","series-title":"Strictness Analysis for a language with polymorphic and recursive types","author":"RENARDEL","year":"1988"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib78","doi-asserted-by":"crossref","unstructured":"REYNOLDS, J., Towards a theory of type structure, in: Proc. Programming Symp., Lecture Notes in Computer Science, Vol. 19 (Springer, Berlin, 1974) 408\u2013425.","DOI":"10.1007\/3-540-06859-7_148"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib79","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01448013","article-title":"\u00dcber die Bausteine der mathematische Logik","volume":"92","author":"SCH\u00d6NFINKEL","year":"1924","journal-title":"Math. Ann."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib80","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"SCOTT","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib81","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1017\/S0305004100061284","article-title":"Locally cartesian closed categories and type theory","volume":"95","author":"SEELY","year":"1984","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib82","doi-asserted-by":"crossref","first-page":"969","DOI":"10.2307\/2273831","article-title":"Categorical semantics for higher-order polymorphic lambda calculus","volume":"52","author":"SEELY","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib83","series-title":"An optimal translation of \u03bb-terms into combinators","author":"STATMAN","year":"1983"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib84","series-title":"SCHEME: An interpreter for extended lambda calculus, AI Memo 349","author":"STEELE","year":"1975"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib85","first-page":"240","article-title":"A realizability interpretation of the theory of species","volume":"453","author":"TAIT","year":"1975"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib86","unstructured":"TAKAHASHI, M., Parallel reductions in \u03bb-calculus, Research reports on Information Sciences No. C-82, Dept. of Information Sciences, Tokyo Institute of Technology, Ookayama, Meguro, Tokyo 152, Japan, 1987."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib87","first-page":"230","article-title":"On computable numbers with an application to the Entscheidungsproblem","volume":"42","author":"TURING","year":"1936","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib88","doi-asserted-by":"crossref","first-page":"153","DOI":"10.2307\/2268280","article-title":"Computability and \u03bb-definability","volume":"2","author":"TURING","year":"1937","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib89","series-title":"SASL Language Manual","author":"TURNER","year":"1979"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib90","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","article-title":"A new implementation technique for applicative languages","volume":"9","author":"TURNER","year":"1979","journal-title":"Software-Practice and Experience"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib91","unstructured":"TURNER, D.A., The semantic elegance of applicative languages, in: Proc. ACM Conf. on Functional Programming, Languages and Computer Architecture (1981) 85\u201392."},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib92","doi-asserted-by":"crossref","unstructured":"TURNER, D.A., Miranda: a nonstrict functional language with polymorphic types, in [50] 1\u201316.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"10.1016\/B978-0-444-88074-1.50012-3_bib93","unstructured":"WADSWORTH, C.P., Semantics and pragmatics of the lambda-calculus, Dissertation, Oxford Univ., Oxford, 1971."}],"container-title":["Formal Models and Semantics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444880741500123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444880741500123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T03:31:53Z","timestamp":1565580713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444880741500123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780444880741"],"references-count":93,"URL":"https:\/\/doi.org\/10.1016\/b978-0-444-88074-1.50012-3","relation":{},"subject":[],"published":{"date-parts":[[1990]]}}}