{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299446,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565963"},{"type":"electronic","value":"9783540475958"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56596-5_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:18:24Z","timestamp":1330255104000},"page":"318-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["SPCF: its model, calculus, and computational power"],"prefix":"10.1007","author":[{"given":"Ramarao","family":"Kanneganti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Cartwright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Felleisen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"14_CR1","volume-title":"Studies in Logic and the Foundations of Mathematics 103","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.The Lambda Calculus: Its Syntax and Semantics. Revised Edition. Studies in Logic and the Foundations of Mathematics 103. North-Holland, Amsterdam, 1984.","edition":"Revised Edition"},{"key":"14_CR2","unstructured":"Berry, G. S\u00e9quentialit\u00e9 de l'\u00e9valuation formelle des \u03bb-expressions. In Proc. 3rd International Colloquium on Programming, 1978."},{"key":"14_CR3","unstructured":"Berry, G. Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des lambda-calculus typ\u00e9. Ph.D. dissertation, Universit\u00e9 Paris VII, 1979."},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"Berry, G. and P-L. Curien. Sequential algorithms on concrete data structures. Theor. Comput. Sci.20, 1982, 265\u2013321.","journal-title":"Theor. Comput. Sci."},{"key":"14_CR5","first-page":"35","volume-title":"Algebraic Methods in Semantics","author":"G. Berry","year":"1985","unstructured":"Berry, G. and P-L. Curien. Theory and practice of sequential algorithms: the kernel of the applicative language cds. In Algebraic Methods in Semantics, edited by J. Reynolds and M.Nivat. Cambridge University Press. London, 1985, 35\u201388."},{"key":"14_CR6","first-page":"89","volume-title":"Algebraic Methods in Semantics","author":"G. Berry","year":"1985","unstructured":"Berry, G., P-L. Curien, and P.-P. L\u00e9vy. Full-abstraction of sequential languages: the state of the art. In Algebraic Methods in Semantics, edited by J. Reynolds and M.Nivat. Cambridge University Press. London, 1985, 89\u2013131."},{"key":"14_CR7","unstructured":"Cartwright, R. Lambda: The ultimate combinator. Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. Edited by Vladimir Lifschitz (ed.), Academic Press, 1991, 27\u201346."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Cartwright, R. and A. Demers. The topology of program termination. In Proc. Symposium on Logic in Computer Science, 1988, 296\u2013308.","DOI":"10.1109\/LICS.1988.5128"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Cartwright, R.S. and M. Felleisen. Observable sequentiality and full abstraction. Technical Report 91-167. Rice University Department of Computer Science, 1991. Preliminary version: In Proc. 19th ACM Symposium on Principles of Programming Languages, 1992, 328\u2013342.","DOI":"10.1145\/143165.143232"},{"key":"14_CR10","unstructured":"Cartwright, R.S., Curien, P.-L., and M. Felleisen. Fully abstract models of observably sequential languages. Forthcoming, December 1992."},{"key":"14_CR11","volume-title":"Research Notes in Theoretical Computer Science","author":"P-L. Curien","year":"1986","unstructured":"Curien, P-L.Categorical Combinators, Sequential Algorithms, and Functional Programming. Research Notes in Theoretical Computer Science. Pitman, London. 1986. Birkh\u00e4user, Revised Edition, to appear."},{"key":"14_CR12","unstructured":"Curien, P.-L., Observable algorithms on concrete data structures. In Proc 7th Symposium on Logic in Computer Science, 1992, to appear."},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0167-6423(91)90036-W","volume":"17","author":"M. Felleisen","year":"1991","unstructured":"Felleisen, M. On the expressive power of programming languages. Science of Computer Programming17, 1991, 35\u201375. Preliminary version in: Proc. 3rd European Symposium on Programming. Neil Jones, Ed. Lecture Notes in Computer Science, 432. Springer Verlag, Berlin, 1990, 134\u2013151.","journal-title":"Science of Computer Programming"},{"key":"14_CR14","unstructured":"Felleisen, M. and R. Hieb. The revised report on the syntactic theories of sequential control and state. Technical Report 100, Rice University, June 1989. Theor. Comput. Sci.102, 1992."},{"issue":"3","key":"14_CR15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M., D.P. Friedman, E. Kohlbecker, and B. Duba. A syntactic theory of sequential control. Theor. Comput. Sci.52(3), 1987, 205\u2013237. Preliminary version in: Proc. Symposium on Logic in Computer Science, 1986, 131\u2013141.","journal-title":"Theor. Comput. Sci."},{"key":"14_CR16","series-title":"Lecture Notes in Mathematics 453","first-page":"22","volume-title":"Logic Colloquium'73","author":"H. Friedman","year":"1973","unstructured":"Friedman, H. Equality between functionals. In Logic Colloquium'73, Rohit Parikh (Ed.), Lecture Notes in Mathematics 453, Springer Verlag, Berlin, 1973, 22\u201337."},{"key":"14_CR17","unstructured":"Kahn, G. and G. Plotkin. Structures des donn\u00e9s concr\u00e8tes (Domaines Concr\u00e8tes). IRIA Report 336. 1978."},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","volume":"52","author":"A.R. Meyer","year":"1982","unstructured":"Meyer, A.R. What is a model of the \u03bb-calculus? Inf. and Control52, 1982, 87\u2013122.","journal-title":"Inf. and Control"},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"Milner, R. Fully abstract models of typed \u03bb-calculi. Theor. Comput. Sci. 4, 1977, 1\u201322.","journal-title":"Theor. Comput. Sci."},{"key":"14_CR20","volume-title":"Ph.D. dissertation","author":"K. Mulmuley","year":"1986","unstructured":"Mulmuley, K.Full Abstraction and Semantic Equivalences. Ph.D. dissertation, Carnegie Mellon University, 1985. MIT Press, Cambridge, Massachusetts, 1986."},{"key":"14_CR21","unstructured":"Plotkin, G. Notes on completeness of the full continuous type hierarchy. Unpublished manuscript, MIT, December 1982."},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D. LCF considered as a programming language. Theor. Comput. Sci.5, 1977, 223\u2013255.","journal-title":"Theor. Comput. Sci."},{"key":"14_CR23","unstructured":"Riecke, J. Statman's 1-section theorem. Tech. Rpt. MS-CIS-92-03. Uinversity of Pennsylvania. 1992."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Riecke, J. and R. Subrahmanyam. Algebraic reasoning and completeness in typed languages. In Proc. 20th ACM Symposium on Principles of Programming Languages, 1992, to appear.","DOI":"10.1145\/158511.158627"},{"issue":"3","key":"14_CR25","first-page":"308","volume":"15","author":"V.Y. Sazonov","year":"1976","unstructured":"Sazonov, V.Y. Expressibility of functions in D.Scott's LCF language. Algebra i Logika15(3), 1976, 308\u2013330.","journal-title":"Algebra i Logika"},{"key":"14_CR26","series-title":"Lecture Notes in Mathematics 140","volume-title":"Proc. International Conference on on Automata, Languages, and Programming","author":"D. S. Scott","year":"1982","unstructured":"Scott, D. S. Domains for denotational semantics. In Proc. International Conference on on Automata, Languages, and Programming, Lecture Notes in Mathematics 140, Springer-Verlag, Berlin, 1982, ??-??."},{"issue":"3","key":"14_CR27","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D.S. Scott","year":"1976","unstructured":"Scott, D.S. Data types as lattices. SIAM J. Comput. 5(3), 1976, 522\u2013587.","journal-title":"SIAM J. Comput"},{"key":"14_CR28","unstructured":"Scott, D.S. Lectures on a Mathematical Theory of Computation. Techn. Monograph PRG-19, Oxford University Computing Laboratory, Programming Research Group, 1981."},{"key":"14_CR29","unstructured":"Sitaram, D. and M. Felleisen. Reasoning with continuations II: Full abstraction for models of control. In Proc. 1990 ACM Conference on Lisp and Functional Programming, 1990, 161\u2013175."},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Statman, R. Equality between functional revisited. In L.A. Harrinton, et al (Eds), Harvey Friedman's Research on the Foundations of Mathematics. Studies in Logic. North-Holland, 1985, 331\u2013338.","DOI":"10.1016\/S0049-237X(09)70166-1"},{"key":"14_CR31","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2307\/2273377","volume":"47","author":"R Statman","year":"1982","unstructured":"Statman, R. Completeness, invariance, and lambda-definability. Journal of Symbolic. Logic47, 1982, 17\u201326.","journal-title":"Journal of Symbolic. Logic"},{"key":"14_CR32","unstructured":"Vuillemin, J. Proof techniques for recursive programs. IRIA Report. 1973."},{"key":"14_CR33","unstructured":"Winskel, G. Events in Computations. Ph.D. dissertation, University of Edinburgh, 1980."}],"container-title":["Lecture Notes in Computer Science","Semantics: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56596-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:51:03Z","timestamp":1742593863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56596-5_39"}},"subtitle":["Preliminary Version"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565963","9783540475958"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-56596-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}