{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T01:32:42Z","timestamp":1746408762694},"reference-count":48,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0304-3975(93)90089-c","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"179-186","source":"Crossref","is-referenced-by-count":5,"title":["Historical introduction to \u201cconcrete domains\u201d by G. Kahn and G.D. Plotkin"],"prefix":"10.1016","volume":"121","author":[{"given":"Stephen","family":"Brookes","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90089-C_BIB1","series-title":"Mathematical Foundations of Programming Semantics, Proc. 5th Internat. Conf.","article-title":"A generalized Kahn principle for abstract asynchronous networks","volume":"Vol. 442","author":"Abramsky","year":"1989"},{"key":"10.1016\/0304-3975(93)90089-C_BIB2","first-page":"47","article-title":"Bottom-up computations of recursive programs","volume":"10","author":"Berry","year":"1976","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(93)90089-C_BIB3","article-title":"S\u00e9quentialit\u00e9 de l'\u00e9valuation formelle des lambda-expressions","author":"Berry","year":"1978"},{"key":"10.1016\/0304-3975(93)90089-C_BIB4","series-title":"Proc. 5th Colloq. on Automata, languages and programming","first-page":"72","article-title":"Stable models of typed \u03bb-calculi","volume":"Vol. 62","author":"Berry","year":"1978"},{"key":"10.1016\/0304-3975(93)90089-C_BIB5","article-title":"Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des lambda-calculs typ\u00e9s","volume":"VIII","author":"Berry","year":"1979"},{"key":"10.1016\/0304-3975(93)90089-C_BIB6","series-title":"Proc. 3rd Internat. Conf. on Automata, Languages, and Programming","article-title":"Program equivalence and canonical forms in stable discrete interpretations","author":"Berry","year":"1976"},{"key":"10.1016\/0304-3975(93)90089-C_BIB7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","article-title":"Sequential algorithms on concrete data structures","volume":"20","author":"Berry","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90089-C_BIB8","series-title":"Algebraic Methods in Semantics","article-title":"Full abstraction for sequential languages: the state of the art","author":"Berry","year":"1985"},{"key":"10.1016\/0304-3975(93)90089-C_BIB9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/322108.322122","article-title":"Minimal and optimal computations of recursive programs","volume":"26","author":"Berry","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(93)90089-C_BIB10","series-title":"Proc. 7th Internat. Conf. on Mathematical Foundations of Programming Semantics","article-title":"Continuous functions and parallel algorithms on concrete data structures","volume":"Vol. 598","author":"Brookes","year":"1991"},{"key":"10.1016\/0304-3975(93)90089-C_BIB11","unstructured":"S. Brookes and S. Geva, Sequential functions on indexed domains and full abstraction for a sublanguage of PCF, in: Proc. 9th Internat. Conf. on Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, to appear."},{"key":"10.1016\/0304-3975(93)90089-C_BIB12","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1991.151638","article-title":"Sequentiality and strong stability","author":"Bucciarelli","year":"1991","journal-title":"Proc. 6th Annu. IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(93)90089-C_BIB13","unstructured":"R. Cartwright, P.-L. Curien and M. Felleisen, Fully abstract models of observably sequential languages, Inform. and Comput., to appear."},{"key":"10.1016\/0304-3975(93)90089-C_BIB14","article-title":"Observable sequentiality and full abstraction","author":"Cartwright","year":"1992","journal-title":"Proc. 19th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(93)90089-C_BIB15","article-title":"DI-domains as a model of polymorphism","volume":"107","author":"Coquand","year":"1986"},{"key":"10.1016\/0304-3975(93)90089-C_BIB16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0890-5401(89)90068-0","article-title":"Domain-theoretic models of polymorphism","volume":"81","author":"Coquand","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90089-C_BIB17","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1992.185554","article-title":"Observable algorithms on concrete data structures","author":"Curien","year":"1992","journal-title":"Proc. 7th Annu. IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(93)90089-C_BIB18","series-title":"Research Notes in Theoretical Computer Science","article-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1986"},{"key":"10.1016\/0304-3975(93)90089-C_BIB19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(89)90117-5","article-title":"Event structures and domains","volume":"68","author":"Droste","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90089-C_BIB20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0890-5401(89)90065-5","article-title":"Recursive domain equations for concrete data structures","volume":"82","author":"Droste","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90089-C_BIB21","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0304-3975(93)90183-T","article-title":"On stable domains","volume":"111","author":"Droste","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90089-C_BIB22","series-title":"Ph.D. Thesis","article-title":"The equivalence of a denotational and an operational semantics for pure dataflow","author":"Faustini","year":"1982"},{"key":"10.1016\/0304-3975(93)90089-C_BIB23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","article-title":"The system F of variable types, fifteen years later","volume":"45","author":"Girard","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90089-C_BIB24","series-title":"Semantics of Programming Languages","author":"Gunter","year":"1992"},{"key":"10.1016\/0304-3975(93)90089-C_BIB25","series-title":"Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics","article-title":"Semantic domains","author":"Gunter","year":"1990"},{"key":"10.1016\/0304-3975(93)90089-C_BIB26","article-title":"The semantics of a simple language for parallel processing","volume":"74","author":"Kahn","year":"1974"},{"key":"10.1016\/0304-3975(93)90089-C_BIB27","first-page":"993","article-title":"Coroutines and networks of parallel processes","volume":"77","author":"Kahn","year":"1977"},{"key":"10.1016\/0304-3975(93)90089-C_BIB28","series-title":"Rapport 336","article-title":"Domaines Concrets","author":"Kahn","year":"1978"},{"key":"10.1016\/0304-3975(93)90089-C_BIB29","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0890-5401(89)90066-7","article-title":"A proof of the Kahn principle for input\/output automata","volume":"82","author":"Lynch","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90089-C_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed lambda-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90089-C_BIB31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","article-title":"Petri nets, event structures and domains","volume":"13","author":"Nielsen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90089-C_BIB32","series-title":"Technical Report TR 89-1055","article-title":"Stability and sequentiality in dataflow networks","author":"Panangaden","year":"1989"},{"key":"10.1016\/0304-3975(93)90089-C_BIB33","article-title":"The \u201cfairness\u201d problem and non-deterministic computing networks","volume":"Vol. 159","author":"Park","year":"1982"},{"key":"10.1016\/0304-3975(93)90089-C_BIB34","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90089-C_BIB35","series-title":"Proc. Symp. on Lambda-Calculus and Computer Science Theory","article-title":"Sazonov, Sequentially and parallelly computable functionals","volume":"Vol. 37","author":"Yu","year":"1975"},{"key":"10.1016\/0304-3975(93)90089-C_BIB36","series-title":"Denotational Semantics: A Methodology for Language Development","author":"Schmidt","year":"1986"},{"key":"10.1016\/0304-3975(93)90089-C_BIB37","author":"Scott","year":"1969","journal-title":"A type-theoretic alternative to CUCH, ISWIM, OWHY"},{"key":"10.1016\/0304-3975(93)90089-C_BIB38","article-title":"Outline of a mathematical theory of computation","author":"Scott","year":"1979","journal-title":"Proc. 4th Annu. Princeton Conf. on Information Sciences and Systems"},{"key":"10.1016\/0304-3975(93)90089-C_BIB39","series-title":"Proc. Symp. on Computers and Automata","article-title":"Towards a mathematical semantics for computer languages","volume":"Vol. 21","author":"Scott","year":"1971"},{"key":"10.1016\/0304-3975(93)90089-C_BIB40","series-title":"Proc. ICALP '82","article-title":"Domains for denotational semantics","volume":"Vol. 140","author":"Scott","year":"1982"},{"key":"10.1016\/0304-3975(93)90089-C_BIB41","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(93)90089-C_BIB42","series-title":"Proc. IFIP TC2 Working Group on Formal Language Description Languages for Computer Programming","article-title":"Towards a formal semantics","author":"Strachey","year":"1966"},{"key":"10.1016\/0304-3975(93)90089-C_BIB43","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-4049(90)90156-C","article-title":"An algebraic approach to stable domains","volume":"64","author":"Taylor","year":"1990","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0304-3975(93)90089-C_BIB44","series-title":"Semantics of Programming Languages","author":"Tennent","year":"1991"},{"key":"10.1016\/0304-3975(93)90089-C_BIB45","series-title":"Ph.D. Thesis","article-title":"Proof techniques for recursive programs","author":"Vuillemin","year":"1973"},{"key":"10.1016\/0304-3975(93)90089-C_BIB46","series-title":"Ph.D. Thesis","article-title":"Events in Computation","author":"Winskel","year":"1981"},{"key":"10.1016\/0304-3975(93)90089-C_BIB47","series-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","article-title":"Event structures","volume":"Vol. 255","author":"Winskel","year":"1987"},{"key":"10.1016\/0304-3975(93)90089-C_BIB48","series-title":"Lecture Notes for the REX Summer School on Temporal Logic (1988)","article-title":"An introduction to event structures","volume":"Vol. 354","author":"Winskel","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390089C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390089C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:17Z","timestamp":1555115117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390089C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":48,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["030439759390089C"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90089-c","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}