{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:48:18Z","timestamp":1729633698229,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE Comput. Soc. Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.1990.113757","type":"proceedings-article","created":{"date-parts":[[2002,12,4]],"date-time":"2002-12-04T17:06:04Z","timestamp":1039021564000},"page":"312-320","source":"Crossref","is-referenced-by-count":2,"title":["Completeness for typed lazy inequalities"],"prefix":"10.1109","author":[{"given":"S.S.","family":"Cosmadakis","sequence":"first","affiliation":[]},{"given":"A.R.","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"J.G.","family":"Riecke","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"ref11","article-title":"Categories of partial morphisms and the ?p<\/subscript>-calculus","volume":"240","author":"moggi","year":"1986","journal-title":"Proceedings Workshop on Category Theory and Computer Programming Guildford 1985"},{"journal-title":"The Partial Lambda Calculus","year":"1988","author":"moggi","key":"ref12"},{"journal-title":"ACM Doctoral Dissertation Award 1986","year":"1987","author":"mulmuley","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21953"},{"journal-title":"The Lazy Lambda Calculus An Investigation into the Foundations of Functional Programming","year":"1988","author":"ong","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"journal-title":"Notes on completeness of the full continuous type hierarchy","year":"1982","author":"plotkin","key":"ref17"},{"key":"ref18","article-title":"A complete and decidable proof system for call-by-value equalities (preliminary report)","author":"riecke","year":"1990","journal-title":"17th ICALP"},{"journal-title":"Continuity and Effectiveness in Topoi","year":"1986","author":"rosolini","key":"ref19"},{"key":"ref4","first-page":"282","article-title":"Can LCF be topped?","author":"bloom","year":"1988","journal-title":"IEEE Symp Logic Comput Sci"},{"journal-title":"Algebraic Methods in Semantics","year":"1985","author":"berry","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1989.39156"},{"key":"ref5","first-page":"133","article-title":"LCF should be lifted","author":"bloom","year":"1989","journal-title":"Proc Conf Algebraic Methodology and Software Technology"},{"key":"ref8","first-page":"236","article-title":"Semantical paradigms: Notes for an invited lecture, with two appendices","author":"meyer","year":"1988","journal-title":"IEEE Symp Logic Comput Sci"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/BFb0064870","article-title":"Equality between functionals","volume":"453","author":"friedman","year":"1975","journal-title":"Logic Colloquium '73"},{"key":"ref2","volume":"103","author":"barendregt","year":"1981","journal-title":"The Lambda Calculus Its Syntax and Semantics"},{"key":"ref9","first-page":"253","article-title":"Empty types in polymorphic ?-calculus","author":"meyer","year":"1987","journal-title":"11th Symp on Principles of Programming Languages"},{"journal-title":"The Lambda Calculus","year":"1987","author":"abramsky","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01876321"},{"journal-title":"Personal communication","year":"1990","author":"sieber","key":"ref22"},{"journal-title":"A type theoretical alternative to CUCH ISWIM OWHY","year":"1969","author":"scott","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(09)70166-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90007-0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0205036"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80001-2"}],"event":{"name":"Fifth Annual IEEE Symposium on Logic in Computer Science","location":"Philadelphia, PA, USA"},"container-title":["[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx2\/305\/3367\/00113757.pdf?arnumber=113757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T11:37:13Z","timestamp":1497526633000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/113757\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/lics.1990.113757","relation":{},"subject":[]}}