{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:46Z","timestamp":1725558526125},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_4","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:41:48Z","timestamp":1277246508000},"page":"68-91","source":"Crossref","is-referenced-by-count":0,"title":["Semantic and Syntactic Approaches to Simulation Relations"],"prefix":"10.1007","author":[{"given":"Jo","family":"Hannay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ya","family":"Katsumata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Sannella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(90)90151-7","volume":"70","author":"E. Bainbridge","year":"1990","unstructured":"Bainbridge, E., Freyd, P., Scedrov, A., Scott, P.: Functorial polymorphism. Theoretical Computer Science\u00a070, 35\u201364 (1990)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0014043","volume-title":"Typed Lambda Calculi and Applications","author":"R. Bellucci","year":"1995","unstructured":"Bellucci, R., Abadi, M., Curien, P.-L.: A model for formal parametric polymorphism: a PER interpretation for system R. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 32\u201346. Springer, Heidelberg (1995)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6423(95)00014-3","volume":"25","author":"M. Bidoit","year":"1995","unstructured":"Bidoit, M., Hennicker, R., Wirsing, M.: Behavioural and abstractor specifications. Science of Computer and Programming\u00a025, 149\u2013186 (1995)","journal-title":"Science of Computer and Programming"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(85)90135-5","volume":"39","author":"C. B\u00f6hm","year":"1985","unstructured":"B\u00f6hm, C., Berarducci, A.: Automatic synthesis of typed \u03bb-programs on term algebras. Theoretical Computer Science\u00a039, 135\u2013154 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0890-5401(90)90044-I","volume":"85","author":"K. Bruce","year":"1990","unstructured":"Bruce, K., Meyer, A., Mitchell, J.: The semantics of the second-order lambda calculus. Information and Computation\u00a085(1), 76\u2013134 (1990)","journal-title":"Information and Computation"},{"key":"4_CR6","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0049-237X(08)70843-7","volume-title":"Proc. 2nd Scandinavian Logic Symp.","author":"J.-Y. Girard","year":"1971","unstructured":"Girard, J.-Y.: Une extension de l\u2019interpr\u00e9tation de G\u00f6del \u00e0 l\u2019analyse, et son application \u00e0 l\u2019\u00e9limination des coupures dans l\u2019analyse et la th\u00e9orie des types. In: Proc. 2nd Scandinavian Logic Symp., Oslo. Studies in Logic and the Foundations of Mathematics, vol.\u00a063, pp. 63\u201392. North-Holland, Amsterdam (1971)"},{"key":"4_CR7","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1990","unstructured":"Girard, J.-Y., Taylor, P., Lafont, Y.: Proofs and Types. Cambridge University Press, Cambridge (1990)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/3-540-48168-0_37","volume-title":"Computer Science Logic","author":"J. Hannay","year":"1999","unstructured":"Hannay, J.: Specification refinement with System F. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 530\u2013545. Springer, Heidelberg (1999)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-46432-8_9","volume-title":"Foundation of Software Science and Computation Structures","author":"J. Hannay","year":"2000","unstructured":"Hannay, J.: A higher-order simulation relation for System F. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 130\u2013145. Springer, Heidelberg (2000)"},{"key":"4_CR10","unstructured":"Hannay, J.: Abstraction Barriers and Refinement in the Polymorphic Lambda Calculus. PhD thesis, Laboratory for Foundations of Computer Science (LFCS), University of Edinburgh (2001)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-44904-3_10","volume-title":"Typed Lambda Calculi and Applications","author":"J. Hannay","year":"2003","unstructured":"Hannay, J.: Abstraction barrier-observing relational parametricity. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 135\u2013152. Springer, Heidelberg (2003)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/3-540-54415-1_61","volume-title":"Theoretical Aspects of Computer Software","author":"R. Hasegawa","year":"1991","unstructured":"Hasegawa, R.: Parametricity of extensionally collapsed term models of polymorphism and their categorical properties. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol.\u00a0526, pp. 495\u2013512. Springer, Heidelberg (1991)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C.A.R. Hoare","year":"1972","unstructured":"Hoare, C.A.R.: Proof of correctness of data representations. Acta Informatica\u00a01, 271\u2013281 (1972)","journal-title":"Acta Informatica"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(96)00068-0","volume":"167","author":"M. Hofmann","year":"1996","unstructured":"Hofmann, M., Sannella, D.: On behavioural abstraction and behavioural satisfaction in higher-order logic. Theoretical Computer Science\u00a0167, 3\u201345 (1996)","journal-title":"Theoretical Computer Science"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-46432-8_11","volume-title":"Foundation of Software Science and Computation Structures","author":"F. Honsell","year":"2000","unstructured":"Honsell, F., Longley, J., Sannella, D., Tarlecki, A.: Constructive data refinement in typed lambda calculus. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 161\u2013176. Springer, Heidelberg (2000)"},{"key":"#cr-split#-4_CR16.1","doi-asserted-by":"crossref","unstructured":"Honsell, F., Sannella, D.: Prelogical relations. CSL 1999??178, 23???43 (2002);","DOI":"10.1006\/inco.2002.3115"},{"key":"#cr-split#-4_CR16.2","unstructured":"Short version In: Proc. Computer Science Logic, CSL 1999, Madrid. Springer LNCS 1683, pp. 546-561 (1999)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Katsumata, S.: Behavioural equivalence and indistinguishability in higher-order typed languages. Selected papers from the 16th Intl. Workshop on Algebraic Development Techniques, Frauenchiemsee. Springer LNCS (2003) (to appear)","DOI":"10.1007\/978-3-540-40020-2_16"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-45413-6_24","volume-title":"Typed Lambda Calculi and Applications","author":"H. Lei\u00df","year":"2001","unstructured":"Lei\u00df, H.: Second-order pre-logical relations and representation independence. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 298\u2013314. Springer, Heidelberg (2001)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Mathematical Foundations of Programming Semantics","author":"Q. Ma","year":"1991","unstructured":"Ma, Q., Reynolds, J.: Types, abstraction and parametric polymorphism, part 2. In: Schmidt, D., Main, M.G., Melton, A.C., Mislove, M.W., Brookes, S.D. (eds.) MFPS 1991. LNCS, vol.\u00a0598, pp. 1\u201340. Springer, Heidelberg (1991)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3540543961_15","volume-title":"Functional Programming Languages and Computer Architecture","author":"H. Mairson","year":"1991","unstructured":"Mairson, H.: Outline of a proof theory of parametricity. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 313\u2013327. Springer, Heidelberg (1991)"},{"key":"4_CR21","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: Proc. 2nd Intl. Joint Conf. on Artificial Intelligence, pp. 481\u2013489. British Computer Society (1971)"},{"key":"4_CR22","volume-title":"Foundations for Programming Languages","author":"J. Mitchell","year":"1996","unstructured":"Mitchell, J.: Foundations for Programming Languages. MIT Press, Cambridge (1996)"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1145\/44501.45065","volume":"10","author":"J. Mitchell","year":"1988","unstructured":"Mitchell, J., Plotkin, G.: Abstract types have existential type. ACM Trans. on Programming Languages and Systems\u00a010(3), 470\u2013502 (1988)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0037118","volume-title":"Typed Lambda Calculi and Applications","author":"G. Plotkin","year":"1993","unstructured":"Plotkin, G., Abadi, M.: A logic for parametric polymorphism. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 361\u2013375. Springer, Heidelberg (1993)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45022-X_9","volume-title":"Automata, Languages and Programming","author":"G. Plotkin","year":"2000","unstructured":"Plotkin, G., Power, J., Sannella, D., Tennent, R.: Lax logical relations. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 85\u2013102. Springer, Heidelberg (2000)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/3-540-06859-7_148","volume-title":"Programming Symposium","author":"J. Reynolds","year":"1974","unstructured":"Reynolds, J.: Towards a theory of type structures. In: Robinet, B. (ed.) Programming Symposium. LNCS, vol.\u00a019, pp. 408\u2013425. Springer, Heidelberg (1974)"},{"key":"4_CR27","volume-title":"The Craft of Programming","author":"J. Reynolds","year":"1981","unstructured":"Reynolds, J.: The Craft of Programming. Prentice Hall, Englewood Cliffs (1981)"},{"key":"4_CR28","first-page":"513","volume-title":"Proc. 9th IFIP World Computer Congress","author":"J. Reynolds","year":"1983","unstructured":"Reynolds, J.: Types, abstraction and parametric polymorphism. In: Proc. 9th IFIP World Computer Congress, Paris, pp. 513\u2013523. North Holland, Amsterdam (1983)"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/LICS.1994.316053","volume-title":"Proc., Ninth Annual IEEE Symposium on Logic in Computer Science","author":"E. Robinson","year":"1994","unstructured":"Robinson, E., Rosolini, G.: Reflexive graphs and parametric polymorphism. In: Proc. Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, pp. 364\u2013371. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01211084","volume":"9","author":"D. Sannella","year":"1997","unstructured":"Sannella, D., Tarlecki, A.: Essential concepts of algebraic specification and program development. Formal Aspects of Computing\u00a09, 229\u2013269 (1997)","journal-title":"Formal Aspects of Computing"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0167-6423(90)90057-K","volume":"14","author":"O. Schoett","year":"1990","unstructured":"Schoett, O.: Behavioural correctness of data representations. Science of Computer Programming\u00a014, 43\u201357 (1990)","journal-title":"Science of Computer Programming"},{"key":"4_CR32","unstructured":"Strachey, C.: Fundamental concepts in programming languages. Lecture notes from the Intl. Summer School in Programming Languages, Copenhagen (1967)"},{"key":"4_CR33","volume-title":"A Classical Mind: Essays in Honour of C.A.R. Hoare","author":"R. Tennent","year":"1994","unstructured":"Tennent, R.: Correctness of data representations in Algol-like languages. In: A Classical Mind: Essays in Honour of C.A.R. Hoare, Prentice Hall, Englewood Cliffs (1994)"},{"issue":"4","key":"4_CR34","doi-asserted-by":"crossref","first-page":"397","DOI":"10.3233\/FI-1998-33404","volume":"33","author":"I. Takeuti","year":"1998","unstructured":"Takeuti, I.: An axiomatic system of parametricity. Fundamenta Informaticae\u00a033(4), 397\u2013432 (1998)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T01:41:51Z","timestamp":1591407711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}