{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:38Z","timestamp":1725489518086},"publisher-location":"Berlin, Heidelberg","reference-count":28,"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_26","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:32:38Z","timestamp":1187253158000},"page":"384-398","source":"Crossref","is-referenced-by-count":1,"title":["Finite Models and Full Completeness"],"prefix":"10.1007","author":[{"given":"J.","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"26_CR1","unstructured":"S. Abramsky. Axioms for full abstraction and full completeness. In Essays in Honour of Robin Milner. MIT Press, to appear."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky and P.-A. Mellies. Concurrent games and full completeness. In Proceedings of the 14th annual Symposium on Logic In Computer Science, LICS\u2019 99, 1999.","DOI":"10.1109\/LICS.1999.782638"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky, R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59:543\u2013574, 1994.","journal-title":"Journal of Symbolic Logic"},{"key":"26_CR4","unstructured":"S. Abramsky, R. Jagadeesan and P. Malacaria. Full abstraction for PCF. Accepted for publication in Information and Computation, 1996."},{"key":"26_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Typed Lambda Calculi and Applications","author":"A. Jung","year":"1993","unstructured":"A. Jung and J. Tiuryn. A new characterization of lambda definability. In Typed Lambda Calculi and Applications, number 664 in Lecture notes in Computer Science. Springer-Verlag, 1993."},{"key":"26_CR6","unstructured":"A. Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, LFCS, University of Edinburgh, 1996."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"P.N. Benton. A mixed linear and non-linear logic: Proofs, terms and models. Technical Report 352, Computer laboratory, Cambridge University, 1994.","DOI":"10.1007\/BFb0022251"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"G. Berry and P.-L. Curien. Sequential algorithms on concrete data structures. Theoretical Computer Science, 20:265\u2013321, 1982.","journal-title":"Theoretical Computer Science"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"R. Cartwright, P.-L. Curien and M. Felleisen. Fully abstract semantics for observably sequential languages. Information and Computation, 1994.","DOI":"10.1006\/inco.1994.1047"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0168-0072(93)90093-S","volume":"59","author":"J.-Y. Girard","year":"1993","unstructured":"J.-Y. Girard. On the unity of logic. Annals of Pure and Applied Logic, 59:201\u2013217, 1993.","journal-title":"Annals of Pure and Applied Logic"},{"key":"26_CR12","unstructured":"J.-Y. Girard. On denotational completeness. Theoretical Computer Science, 197, 1995."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"M. Hasegawa. Logical predicates for intuitionistic linear type theories. In Proceedings of TLCA\u2019 99, 1999.","DOI":"10.1007\/3-540-48959-2_15"},{"key":"26_CR14","unstructured":"J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. to appear, 1995."},{"key":"26_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the International Conference on Typed Lambda Calculi and Applications","author":"A. Jung","year":"1993","unstructured":"A. Jung, and A. Stoughton. Studying the fully abstract model of PCF within its continuous function model. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, volume 664 of LNCS, 1993."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"A. Kopylov. Decidability of linear affine logic. In Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, LICS 95. IEEE press, 1995.","DOI":"10.1109\/LICS.1995.523283"},{"key":"26_CR17","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.2307\/2275637","volume":"62","author":"Y. Lafont","year":"1996","unstructured":"Y. Lafont. The finite model property for various fragments of linear logic. Journal of Symbolic logic, 62:1202\u20131208, 1996.","journal-title":"Journal of Symbolic logic"},{"key":"26_CR18","unstructured":"J. Laird. A Semantic Analysis of Control. PhD thesis, Department of Computer Science, University of Edinburgh, 1998."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"P. Lincoln. Deciding provability of linear logic formulas. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511629150.006"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0168-0072(92)90075-B","volume":"56","author":"P. Lincoln","year":"1992","unstructured":"P. Lincoln, J. Mitchell, A. Scedrov and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239\u2013311, 1992.","journal-title":"Annals of Pure and Applied Logic"},{"key":"26_CR21","unstructured":"R. Loader. The undecidability of lambda definability. to appear in the Church Memorial volume, 1993."},{"key":"26_CR22","unstructured":"R. Loader. Finitary PCF is undecidable. Manuscript, 1997. To appear in Theoretical Computer Science."},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"R. Loader. Unary PCF is undecidable. Theoretical Computer Science, 206, 1998.","DOI":"10.1016\/S0304-3975(98)00048-6"},{"key":"26_CR24","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 lambda-calculi. Theoretical Computer Science, 4:1\u201322, 1977.","journal-title":"Theoretical Computer Science"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"C.-H. L. Ong and C. Stewart. A Curry-Howard foundation for functional computation with control. In Proceedings of ACM SIGPLAN-SIGACT syposium on Principles of Programming Languages, Paris, January 1997. ACM press, 1997.","DOI":"10.1145\/263699.263722"},{"key":"26_CR26","series-title":"Lect Notes Comput Sci","volume-title":"Types for proofs and programs","author":"V. Padovani","year":"1996","unstructured":"V. Padovani. Decidability of all minimal models. In M. Coppo and S. Berardi, editor, Types for proofs and programs, volume 1158 of LNCS. Springer, 1996."},{"key":"26_CR27","unstructured":"M. Schmidt-Schau\u00df. Decidability of behavioural equivalence in unary PCF. Theoretical Computer Science, 208, 1998."},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"T. Streicher. Denotational completeness revisited. In Proceedings of the International Conference on Categories in Computer Science, CTCS\u2019 99, Electronic notes in theoretical computer science. Elsevier, 1999.","DOI":"10.1016\/S1571-0661(05)80321-4"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:18:01Z","timestamp":1556770681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44622-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678953","9783540446224"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-44622-2_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}