{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:48Z","timestamp":1759637808180},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":13712,"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":[[1976]]},"DOI":"10.1016\/0304-3975(76)90029-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"133-145","source":"Crossref","is-referenced-by-count":44,"title":["Computability concepts for programming language semantics"],"prefix":"10.1016","volume":"2","author":[{"given":"Herbert","family":"Egli","sequence":"first","affiliation":[]},{"given":"Robert L.","family":"Constable","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90029-3_BIB1","series-title":"Ph.D. Thesis","article-title":"Recursive definitions of partial functions and their computations","author":"Cadiou","year":"1972"},{"issue":"1","key":"10.1016\/0304-3975(76)90029-3_BIB2","doi-asserted-by":"crossref","DOI":"10.1137\/0201006","article-title":"On classes of program schemata","volume":"1","author":"Constable","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(76)90029-3_BIB3","series-title":"An Analysis of Scott's \u03bb-calculus models","author":"Egli","year":"1973"},{"key":"10.1016\/0304-3975(76)90029-3_BIB4","series-title":"Programming language semantics using extensional \u03bb-calculus models","author":"Egli","year":"1974"},{"key":"10.1016\/0304-3975(76)90029-3_BIB5","series-title":"Sets, Models and Recursion Theory","article-title":"Computable functionals of finite type I","author":"Gandy","year":"1967"},{"key":"10.1016\/0304-3975(76)90029-3_BIB6","article-title":"Equivalence of the effective operations and the hereditarily recursively continuous functionals","author":"Harrison","year":"1963","journal-title":"Foundations of Classical Analysis, Stanford Summer Seminar"},{"key":"10.1016\/0304-3975(76)90029-3_BIB7","series-title":"Introduction to Meta-mathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(76)90029-3_BIB8","series-title":"Constructivity in Mathematics","article-title":"Countable functionals","author":"Kleene","year":"1959"},{"key":"10.1016\/0304-3975(76)90029-3_BIB9","series-title":"Constructivity in Mathematics","article-title":"Partial recursive functionals and effective operations","author":"Kreisel","year":"1959"},{"key":"10.1016\/0304-3975(76)90029-3_BIB10","series-title":"Models of LCF","author":"Milner","year":"1973"},{"key":"10.1016\/0304-3975(76)90029-3_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/800235.807067","article-title":"Implementation and application of Scott's logic for computable functions","author":"Milner","year":"1972","journal-title":"Proc. ACM Conf. on Proving Assertions about Programs"},{"key":"10.1016\/0304-3975(76)90029-3_BIB12","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(76)90029-3_BIB13","series-title":"Proc. Dalhousie Conference on Toposes, Algebraic Geometry and Logic","article-title":"Continuous lattices","volume":"274","author":"Scott","year":"1972"},{"key":"10.1016\/0304-3975(76)90029-3_BIB14","series-title":"Proc. of a Symposium on Computer and Automata","article-title":"Toward a mathematical semantics for computer languages","author":"Scott","year":"1971"},{"key":"10.1016\/0304-3975(76)90029-3_BIB15","article-title":"Data types as lattices","author":"Scott","year":"1974","journal-title":"Lecture Notes of the Kiel Summer Seminar"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900293?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900293?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:21:09Z","timestamp":1555125669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976]]}},"alternative-id":["0304397576900293"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90029-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}