Logic Programming with Continuations
{'Code': '05010400', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Forbes D. Lewis', 'PO_EMAI': None, 'PO_PHON': None}
Continuations provide a general abstraction of sequential control.  If          they are provided in the context of a logic programming language, more          dynamic variations on the search strategy become possible.  However,            when continuations are invoked to perform 'lateral' control transfers,          as in variations on breadth-first search, it is necessary for the               values of logic variables to be restored.  This is related to the               problem of maintaining multiple environments in the context of or-              parallelism.  The state-space model of control has been extended to             solve this problem, allowing continuations to be used in the context of         logic programming.                                                                                                                                              For the last several years the semantics and uses of first-                     continuations in the context of imperative and functional programming           has been explored.  It is now possible to extend much of this work to           the context of logic programming.  Topics to be investigated include            the modeling of Prolog extensions using continuations, the use of               continuations in conjunction with engines to obtain search strategies           based on computation time, the development of formal models and                 reasoning systems for continuations in the context of logic                     programming, and the investigation of more general issues of                    reification and reflection in logic programming.  This research should          provide a better understanding of control in the context of logic               programming.
[{'FirstName': 'Christopher', 'LastName': 'Haynes', 'PI_MID_INIT': 'T', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Christopher T Haynes', 'EmailAddress': None, 'NSF_ID': '000222246', 'StartDate': '09/01/1987', 'EndDate': None, 'RoleCode': 'Co-Principal Investigator'}, {'FirstName': 'Daniel', 'LastName': 'Friedman', 'PI_MID_INIT': 'P', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Daniel P Friedman', 'EmailAddress': 'dfried@cs.indiana.edu', 'NSF_ID': '000116932', 'StartDate': '09/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}]
{'Name': 'Indiana University', 'CityName': 'BLOOMINGTON', 'ZipCode': '474057000', 'PhoneNumber': '3172783473', 'StreetAddress': '107 S INDIANA AVE', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Indiana', 'StateCode': 'IN', 'CONGRESSDISTRICT': '09', 'CONGRESS_DISTRICT_ORG': 'IN09', 'ORG_UEI_NUM': 'YH86RTW2YVJ4', 'ORG_LGL_BUS_NAME': 'TRUSTEES OF INDIANA UNIVERSITY', 'ORG_PRNT_UEI_NUM': 'YH86RTW2YVJ4'}
{'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'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8702117.xml'}