{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:19Z","timestamp":1725456019429},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057879X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017472","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:11Z","timestamp":1132645631000},"page":"37-51","source":"Crossref","is-referenced-by-count":1,"title":["Type Preorders"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Alessi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky: Domain Theory in Logical Form. Annals of Pure and Applied Logic, 51 (1991) 1\u201377.","journal-title":"Annals of Pure and Applied Logic"},{"unstructured":"S. Abramsky: A The lazy \u03bb-calculus. In D. Turner ed. Research Topics in Functional Programming, Addison-Wesley, Reading, MA.","key":"3_CR2"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H.P. Barendregt","year":"1983","unstructured":"H.P. Barendregt, M. Coppo, M. Dezani-Ciancaglini: A Filter \u03bb-models and Completeness of Type Assignment. Journal of Symbolic Logic, 48 (1983) 931\u2013940.","journal-title":"Journal of Symbolic Logic"},{"key":"3_CR4","first-page":"651","volume":"526","author":"F. Barbanera","year":"1991","unstructured":"F. Barbanera, M. Dezani-Ciancaglini: Intersection and Union Types TACS'91, LNCS, 526 (1991), 651\u2013674.","journal-title":"LNCS"},{"unstructured":"F. Barbanera, M. Dezani-Ciancaglini, U. de' Liguoro:Intersection and Union Types: Syntax and Semantics. Information and Computation, to appear.","key":"3_CR5"},{"unstructured":"G. Boudol: Lambda-Calculi for (strict) Parallel Functions. INRIA \/ Sophia-Antipolis Technical Report 1387, (1991) To appear on Information and Computation.","key":"3_CR6"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0049-237X(08)71819-6","volume-title":"Logic Colloquium '82","author":"M. Coppo","year":"1984","unstructured":"M. Coppo, M. Dezani-Ciancaglini, F. Honsell, G. Longo: Extended Type Structures and Filter \u03bb-models. In G. Lolli, G. Longo, A. Morcja editors, Logic Colloquium '82, North Holland, Amsterdam (1984) 241\u2013262."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","volume":"72","author":"M. Coppo","year":"1987","unstructured":"M. Coppo, M. Dezani-Ciancaglini, M. Zacchi: Type Theories, Normal Forms and D\u221e \u2014 \u03bb-models. Information and Computation, 72 (1987) 85\u2013116.","journal-title":"Information and Computation"},{"unstructured":"M. Dezani-Ciancaglini, U. de' Liguoro, A. Piperno: Filter \u03bb-models for a Parallel and Non-Deterministic \u03bb-calculus. In A.M. Borzyszkowsky, S. Sokolowsky editors, 18th International Symposium on Mathematical Foundation of Computer Science, Gdansk (Poland) (1993) 403\u2013412. Springer-Verlag LNCS Vol 711.","key":"3_CR9"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(86)90043-5","volume":"45","author":"M. Dezani-Ciancaglini","year":"1986","unstructured":"M. Dezani-Ciancaglini, I. Margaria: A Characterization of F-complete Type Assignments. Theoretical Computer Science, 45 (1986) 121\u2013157.","journal-title":"Theoretical Computer Science"},{"key":"3_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-67678-9","volume-title":"A Compendium of Continuous Lattices","author":"G.K. Gierz","year":"1980","unstructured":"G.K. Gierz, K.H. Hoffmann, K. Keimel, J.D. Lawson, M. Mislove, D.S. Scott: A Compendium of Continuous Lattices. Springer-Verlag, Berlin, 1980."},{"issue":"2","key":"3_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1992-16205","volume":"16","author":"L. Egidi","year":"1992","unstructured":"L. Egidi, F. Honsell, S. Ronchi della Rocca: Operational, Denotational and Logical Descriptions: a case study. Fundamenta Informaticae 16 (2) (1992) 149\u2013169.","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"crossref","unstructured":"F. Honsell, M. Lenisa: Some Results on the Full Abstraction Problem for Restricted Lambda Calculi. In A.M. Borzyszkowsky, S. Sokolowsky editors, 18th International Symposium on Mathematical Foundation of Computer Science, Gdansk (Poland) (1993) 84\u2013104. Springer-Verlag LNCS Vol 711.","key":"3_CR13","DOI":"10.1007\/3-540-57182-5_6"},{"unstructured":"F. Honsell, S. Ronchi della Rocca: An Approximation Theorem for Scott Topological Lambda Models and the Topological Incompleteness of Lambda Calculus. To appear on Journal of Computer and System Science.","key":"3_CR14"},{"key":"3_CR15","volume-title":"Volume 3 of Cambridge Studies in Advanced Mathematics","author":"P.T. Johnstone","year":"1982","unstructured":"P.T. Johnstone: Stone Spaces. Volume 3 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1982."},{"doi-asserted-by":"crossref","unstructured":"K.G. Larsen, G. Winskel: Using Information Systems to Solve Recursive Domain Equation Effectively. In D.B MacQueen, G. Khan and G. Plotkin editors, Semantics of Data Types, 109\u2013130, Berlin (1984) Springer-Verlag LNCS Vol. 173.","key":"3_CR16","DOI":"10.1007\/3-540-13346-1_5"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G. Plotkin, G. Winskel:Petri Nets, Event Structures and Domains, part I. Theoretical Computer Science, 13 (1981) 85\u2013108.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"D.S. Scott: Domain for Denotational Semantics. In M. Nielson, E.M. Schmidt editors, Automata, Languages and Programming: Proceedings 1982. Berlin (1982) Springer-Verlag LNCS 140.","key":"3_CR18","DOI":"10.1007\/BFb0012801"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M. Smyth","year":"1982","unstructured":"M. Smyth, G. Plotkin: The Category Theoretic Solution of Recursive Domain Equations. SIAM Journal Computing 11 (1982) 761.","journal-title":"SIAM Journal Computing"},{"unstructured":"S. Vickers: Topology via Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1988.","key":"3_CR20"}],"container-title":["Lecture Notes in Computer Science","Trees in Algebra and Programming \u2014 CAAP'94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017472.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T03:50:38Z","timestamp":1626753038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057879X"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0017472","relation":{},"subject":[]}}