{"responseHeader":{"status":0,"QTime":3,"params":{"q":"{!q.op=AND}id:\"102075\"","hl":"true","hl.simple.post":"","hl.fragsize":"5000","fq":"!embargo_tdt:[NOW TO *]","hl.fl":"ocr_t","hl.method":"unified","wt":"json","hl.simple.pre":""}},"response":{"numFound":1,"start":0,"docs":[{"file_name_t":"Mishra-Static_Inference.pdf","thumb_s":"/28/71/287135f8a3ea8476001e351812808bcf6ba74b9e.jpg","oldid_t":"compsci 10188","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-25T00:00:00Z","file_s":"/5d/f7/5df7a095bf994d0d290ac6c1046af8ed58ab1f5d.pdf","title_t":"Page 101","ocr_t":"89 mitting such abstractions complicates the type inference problem. We do not require ~-abstractions to be linear, but later show that making such a re striction results in the inference of \"narrower\" types. Function application is performed through pattern matching: is rewritten by ei.,., provided .,. is a substitution such that pi.,. = d. If there is no such pi then a type error (wrong) occurs. If the language includes infinite terms, d is reduced only on demand. When a check for a match with any pi is performed, d is reduced only so far as to ensure that either it fails to match pi or it does. If it does match pi the relevant sub terms are bound to variables in pi without fully expanding them. We write \"[[ . ]]\" for the function mapping expressions to their meanings in the denotational style. The details of such c.p.o based models are well known. [ [ ] ] : Expr ~ Env ~ V 4.2 What is a Type ? For our purposes, a type is any description of a set of values - - a predicate over values. Types of terms are predicates over terms; correspondingly, types of functions are predicates over functions. As we view computation taking place over domai ns (complete partial orders) rather than sets, we need to appropriately modify our notion of type. Instead of permitting arbitrary predicates as types, we allow only predicates that respect the order stru ctu re of domains. Such predicates have also been called admissi ble predicates, and describe a structured subset of a domain called an ideal [39, 37]. The motivation for this view of type has been cogently stated in [37]: \"intuitively, we think of a type as a collection of values which share a common structure, where the term \"structure\" represents notions like being a pa ir, or being a function . The structural distinction that types are meant to captu re","id":102075,"created_tdt":"2016-05-25T00:00:00Z","parent_i":102129,"_version_":1679953745264246784}]},"highlighting":{"102075":{"ocr_t":[]}}}