{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:06Z","timestamp":1725664986629},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626886"},{"type":"electronic","value":"9783540684381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62688-3_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:49:33Z","timestamp":1330296573000},"page":"82-98","source":"Crossref","is-referenced-by-count":0,"title":["A simple adequate categorical model for PCF"],"prefix":"10.1007","author":[{"given":"Torben","family":"Bra\u00fcner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"6_CR1","unstructured":"S. Abramsky. Axioms for full abstraction and full completeness. Manuscript, 1996."},{"key":"6_CR2","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Pull abstraction for PCF. Submitted for publication, 1996."},{"key":"6_CR3","unstructured":"G. Berry, P.-L. Curien, and J.-J. Levy. Full abstraction for sequential languages: the state of the art. In Algebraic Semantics. Cambridge University Press, 1986."},{"key":"6_CR4","unstructured":"T. Bra\u00fcner. An Axiomatic Approach to Adequacy. PhD thesis, Department of Computer Science, University of Aarhus, 1996. 168 pages. Published as Technical Report BRICS-DS-96-4."},{"key":"6_CR5","unstructured":"M. P. Fiore. Axiomatic Domain Theory in Categories of Partial Maps. PhD thesis, University of Edinburgh, 1994."},{"key":"6_CR6","unstructured":"M. P. Fiore. First steps on the representation of domains. Manuscript, 1994."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"M. P. Fiore and G. D. Plotkin. An axiomatisation of computationally adequate domain theoretic models of FPC. In 9th LICS Conference. IEEE, 1994.","DOI":"10.1109\/LICS.1994.316083"},{"key":"6_CR8","unstructured":"C. A. Gunter. Semantics of Programming Languages: Structures and Techniques. The MIT Press, 1992."},{"key":"6_CR9","unstructured":"J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF. Submitted for publication, 1996."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"H. Huwig and A. Poigne. A note on inconsistencies caused by fixpoints in a cartesian closed category. Theoretical Computer Science, 73, 1990.","DOI":"10.1016\/0304-3975(90)90165-E"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"F. W. Lawvere. Diagonal arguments and cartesian closed categories. In Category Theory, Homology Theory and their Applications II, LNM, volume 92. Springer-Verlag, 1969.","DOI":"10.1007\/BFb0080769"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"E. Moggi. Categories of partial morphisms and the partial lambda-calculus. In Proceedings Workshop on Category Theory and Computer Programming, Guildford 1985, LNCS, volume 240. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-17162-2_126"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"E. Moggi. Computational lambda-calculus and monads. In 4th LICS Conference. IEEE, 1989.","DOI":"10.1109\/LICS.1989.39155"},{"key":"6_CR14","unstructured":"A. M. Pitts. Operationally-based theories of program equivalence. Notes to accompany lectures given at the Summer School Semantics and Logics of Computation, Isaac Newton Institute for Mathematical Sciences, University of Cambridge, 1995."},{"key":"6_CR15","unstructured":"G. D. Plotkin. Lambda-definability and logical relations. Memorandum SAIRM-4, University of Edinburgh, 1973."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5, 1977.","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"6_CR17","unstructured":"G. Rosolini. Continuity and Effectiveness in Topoi. PhD thesis, University of Oxford, 1986."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"D. S. Scott. A type theoretical alternative to CUCH, ISWIM, OWHY. In B\u00f6hm Festscrift, Theoretical Computer Science, volume 121. Elsevier, 1993.","DOI":"10.1016\/0304-3975(93)90095-B"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"G. Winskel. Event structures. In LNCS, volume 255. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17906-2_31"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"G. Winskel. The Formal Semantics of Programming Languages. The MIT Press, 1993.","DOI":"10.7551\/mitpress\/3054.001.0001"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62688-3_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:39:33Z","timestamp":1619573973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62688-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626886","9783540684381"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-62688-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}