{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:36Z","timestamp":1725489516898},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678953"},{"type":"electronic","value":"9783540446224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44622-2_34","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:32:38Z","timestamp":1187253158000},"page":"497-511","source":"Crossref","is-referenced-by-count":5,"title":["Logical Relations and Data Abstraction"],"prefix":"10.1007","author":[{"given":"John","family":"Power","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)00283-O","volume":"146","author":"A. Alimohamed","year":"1995","unstructured":"Alimohamed, A.: A Characterisation of Lambda Definability in Categorical Models of Implicit Polymorphism. Theoretical Computer Science 146 (1995) 5\u201323.","journal-title":"Theoretical Computer Science"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Fiore, M., Plotkin, G.D.: An axiomatisation of computationally adequate domain-theoretic models of FPC. Proc LICS 94. IEEE Press (1994) 92\u2013102.","DOI":"10.1109\/LICS.1994.316083"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Hermida, C.A.: Fibrations, Logical Predicates and Indeterminates. Ph.D. thesis. Edinburgh (1993) available as ECS-LFCS-93-277.","DOI":"10.7146\/dpb.v22i462.6935"},{"key":"34_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/3-540-48168-0_38","volume-title":"Proc. CSL 99","author":"F. Honsell","year":"1999","unstructured":"Honsell, F., Sannella, D.T.: Pre-logical relations. Proc. CSL 99. LNCS 1683. Flum and Rodriguez-Artalejo (eds). Springer (1999) 546\u2013562."},{"key":"34_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BFb0037110","volume-title":"Proc.TLCA","author":"A. Jung","year":"1993","unstructured":"Jung, A., Tiuryn, J.: A new characterisation of lambda definability. Proc.TLCA. LNCS 664. Bezem and Groote (eds.) Springer (1993) 245\u2013257."},{"key":"34_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BFb0014552","volume-title":"Proc TACS 97","author":"Y. Kinoshita","year":"1997","unstructured":"Kinoshita, Y., O\u2019Hearn, P., Power, A.J., Takeyama, M., Tennent, R.D.: An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement. Proc TACS 97. LNCS 1281. Abadi and Ito (eds). Springer (1997) 191\u2013212."},{"key":"34_CR7","unstructured":"Lambek, J., Scott, P.J.: Introduction to higher order categorical logic. Cambridge studies in advanced mathematics. Cambridge University Press (1986)"},{"key":"34_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Math. Found. of Prog. Lang. Sem.","author":"Q. Ma","year":"1991","unstructured":"Ma, Q., Reynolds, J.C.: Types, abstraction and parametric polymorphism 2. Math. Found. of Prog. Lang. Sem. Lecture Notes in Computer Science. Springer (1991)."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Mitchell, J.: Type systems for programming languages. Handbook of Theoretical Computer Science em B. van Leeuwen (ed). North-Holland (1990) 365\u2013458.","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"key":"34_CR10","unstructured":"Mitchell, J.: Foundations for programming languages. Foundations of Computing Series. MIT Press (1996)."},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Moggi, E.: Computational Lambda-calculus and Monads. Proc LICS 89 IEEE Press (1989) 14\u201323.","DOI":"10.1109\/LICS.1989.39155"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D., power, A.J., Sannella, D.T., Tennent, R.D.: Lax logical relations. (to appear in ICALP 2000).","DOI":"10.1007\/3-540-45022-X_9"},{"key":"34_CR13","unstructured":"Reynolds, J.C.: Types, abstraction, and parametric polymorphism. Information Processing 83 Mason (ed) North Holland (1983) 513\u2013523."},{"key":"34_CR14","unstructured":"Tennent, R.D.: Correctness of data representations in ALGOL-like languages. In: A Classical Mind, Essays in Honour of C.A.R. Hoare, A.W. Roscoe (ed.) Prentice-Hall (1994) 405\u2013417."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44622-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:17:52Z","timestamp":1556770672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44622-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678953","9783540446224"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44622-2_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}