{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T12:42:29Z","timestamp":1784119349804,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540088608","type":"print"},{"value":"9783540358077","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:35:50Z","timestamp":1330187750000},"page":"72-89","source":"Crossref","is-referenced-by-count":87,"title":["Stable models of typed \u03bb-calculi"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Berry","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita\/197610R100471","volume":"10","author":"G. Berry","year":"1976","unstructured":"G. BERRY, \"Bottom-up Computations of Recursive Programs\", R.A.I.R.O. Informatique Theorique, vol.10, no 3, mars 1976, pp 47\u201382.","journal-title":"R.A.I.R.O. Informatique Theorique"},{"key":"7_CR2","unstructured":"G. BERRY, \"S\u00e9quentialit\u00e9 de l'Evaluation formelle des \u03bb-expressions\", Proc. 3rd International Colloquium on Programming, Paris, march 28\u201330, 1978, DUNOD."},{"key":"7_CR3","unstructured":"G. BERRY, \"Calculs Optimaux des Programmes dans les Interpr\u00e9tations stables\", Th\u00e8se de doctorat d'Etat, to appear."},{"key":"7_CR4","unstructured":"G. BERRY, P.L. CURIEN, \"Sequential Computations in Concrete Data structures\", to appear."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"G. BERRY, J.J. LEVY, \"Minimal and Optimal Computations of Recursive Programs\", Proc. 3rd ACM Symposium on Principles of Programming Languages, Los Angeles, jan. 1977. To appear in JACM.","DOI":"10.1145\/512950.512971"},{"key":"7_CR6","unstructured":"B. COURCELLE, J.C. RAOULT, \"Completion of ordered magmas\", Fondamenta Informatica, Poland 1978, to appear."},{"key":"7_CR7","unstructured":"G. KAHN, G. PLOTKIN, \"Concrete Data Structures\", to appear."},{"issue":"1","key":"7_CR8","first-page":"97","volume":"2","author":"J. J. Levy","year":"1976","unstructured":"J.J. LEVY, \"An algebraic interpretation of the \u03bb\u03b2\u03ba-calculus and an application of a labelled \u03bb-calculus\", Rome, 1975 and TCS, vol. 2, no 1, 1976, p. 97\u2013114.","journal-title":"Rome, 1975 and TCS"},{"key":"7_CR9","unstructured":"J.J. LEVY, \"R\u00e9ductions correctes et optimales dans le \u03bb-calcul\", Th\u00e8se de doctorat d'Etat, Univ. Paris VII, jan. 1978."},{"key":"7_CR10","first-page":"1","volume":"1","author":"R. Milner","year":"1972","unstructured":"R. MILNER, \"Implementation and application of Scott's logic for computable functions\", Proc. ACM Conference on Proving Assertions about Programs, SIGPLAN Notices 7, 1 (jan. 1972) 1\u20136.","journal-title":"Proc. ACM Conference on Proving Assertions about Programs, SIGPLAN Notices 7"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"R. MILNER, \"Models of LCF\", Stanford Comp. Sci. Dept. Memo. CS-73-332, Stanford, 1973.","DOI":"10.21236\/AD0758645"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. MILNER, \"Fully Abstract Models of typed \u03bb-calculi\", T.C.S. vol. 4, no 1, feb. 1977, pp. 1\u201323.","journal-title":"T.C.S."},{"issue":"3","key":"7_CR13","first-page":"223","volume":"5","author":"G. D. Plotkin","year":"1977","unstructured":"G.D. PLOTKIN, \"LCF as a Programming Language\", Proc. Conf. Proving and Improving Programs, Arc-et-Senans, France, 1975, and T.C.S. vol. 5, no 3, 1977, pp. 223\u2013257.","journal-title":"Proc. Conf. Proving and Improving Programs, Arc-et-Senans, France, 1975, and T.C.S."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"G.D. PLOTKIN, \"A Powerdomain Construction\", SIAM Journal of Computing, Vol. 5, no 3, sept. 1976.","DOI":"10.1137\/0205035"},{"key":"7_CR15","unstructured":"G.D. PLOTKIN, M. SMYTH, \"The category-theoretic solution of recursive domain equations\", Proc. 18 th Annual Symposium on Foundations of Computer Science, Oct. 31 \u2014 Nov. 2, 1977."},{"key":"7_CR16","unstructured":"V. Yu. SAZONOV, \"Sequentially and Parallelly Computable functionals\", Rome, march 75. Springer \u2014 Verlag LNCS no 37."},{"key":"7_CR17","unstructured":"D. SCOTT, \"Data types as Lattices\", Lecture Notes, unpublished, Amsterdam 1972."},{"key":"7_CR18","first-page":"169","volume-title":"Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems","author":"D. Scott","year":"1970","unstructured":"D. SCOTT, \"Outline of a mathematical theory of Computation\", Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems, Princeton Univ., Princeton, N.J., 1970, pp 169\u2013176."},{"key":"7_CR19","unstructured":"J. VUILLEMIN, \"Proof Techniques for Recursive Programs\", Ph. D. Thesis, Stanford University, 1973."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"C.P. WADSWORTH, \"The relation between Operational and Denotational properties for Scott's D\u221e model of the \u03bb-calculus, SIAM Journal of Computing, vol. 5, no 3, sept. 1976.","DOI":"10.1137\/0205036"},{"key":"7_CR21","unstructured":"M. WAND, \"Fixed \u2014 Points Constructions in order-enriched Categories\", TR 23, Comp. Sci. Dept. Indiana Univ., 1975."},{"key":"7_CR22","unstructured":"P.H. WELCH, \"Continuous Semantics and Inside-out Reductions\", Rome, 1975, Springer Verlag, LNCS no 37."},{"key":"7_CR23","volume-title":"R\u00e9solution d'\u00e9quations dans les langages d'ordre 1,2,...,\u03c9","author":"G. Huet","year":"1976","unstructured":"G. HUET, \"R\u00e9solution d'\u00e9quations dans les langages d'ordre 1,2,...,\u03c9\". Th\u00e8se d'Etat, Universit\u00e9 PARIS VII, Paris, Sept. 1976."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:10Z","timestamp":1605643210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}