Strictness Analysis and Type Inference
{'Code': '05010400', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'name not available', 'PO_EMAI': None, 'PO_PHON': None}
Strictness analysis deals with the question: given divergent term          M, when is term NM divergent?  It has been shown that, in a higher-             order functional language, strictness properties of terms can be viewed         as a collection of "strictness types" possessed by terms.  This project         explores the contention that strictness analysis may profitably be              considered a form of type inference.                                                                                                                                 The primary research goal is to investigate aspects of strictness          in a higher-order functional language, including the following: (a)             type-theoretic characterization of strictness, (b) completeness of              inference rules for strictness analysis (c) inherent complexity of              strictness analysis, (d) efficient algorithms that combine type                 checking and strictness analysis, (e) polymorphic invariance and                strictness analysis.                                                                                                                                                 These are two secondary research goals: (i) development of                 programming tools for the analysis, and, direct execution, of inference         rules, (ii) investigation of other program analysis problems, including         those of structure strictness analysis and permutativity analysis.
{'FirstName': 'Prateek', 'LastName': 'Mishra', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Prateek Mishra', 'EmailAddress': 'mishra@cs.sunysb.edu', 'NSF_ID': '000209834', 'StartDate': '12/15/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'SUNY at Stony Brook', 'CityName': 'STONY BROOK', 'ZipCode': '117940001', 'PhoneNumber': '6316329949', 'StreetAddress': 'W5510 FRANKS MELVILLE MEMORIAL L', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '01', 'CONGRESS_DISTRICT_ORG': 'NY01', 'ORG_UEI_NUM': 'M746VC6XMNH9', 'ORG_LGL_BUS_NAME': 'THE RESEARCH FOUNDATION FOR THE STATE UNIVERSITY OF NEW YORK', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
[{'Code': '2875', 'Text': 'SYSTEM SOFTWARE'}, {'Code': '9120', 'Text': 'CROSS-DIRECTORATE PROGRAMS'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8706973.xml'}