Closures and fairness in the semantics of programming logic

Closures and fairness in the semantics of programming logic

ID:40881304

大小:1.75 MB

页数:18页

时间:2019-08-09

Closures and fairness in the semantics of programming logic_第1页
Closures and fairness in the semantics of programming logic_第2页
Closures and fairness in the semantics of programming logic_第3页
Closures and fairness in the semantics of programming logic_第4页
Closures and fairness in the semantics of programming logic_第5页
资源描述:

《Closures and fairness in the semantics of programming logic》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、TheoreticalComputerScience29(1984)167-184167North-HollandCLOSURESANDFAIRNESSINTHESEMANTICSOFPROGRAMMIN~JLOGIC*J.-L.LASSEZANDM.J.MAHERDepartmwofComputerScience,UniversityofMelbourne,Parkville,Victoria,3052,AustraliaCommunicatedbyJ,.MannaReceivedNovember

2、1982RevisedMay1983Abstract.tVeusethenotionsofclosuresandfairchaoticiterationstogiveasemanticstologicprograms.Therelationshipsbetweenthesemanticsc;findividualrulesandthesemanticsofthewholeprogramareestablishedandanapplicationjtoparallelprocessingismenti

3、oncti.Achaoticfixedpointtheoremisgiven.whichcarriesthenon-determinisminherenttoresolution.Finally.veintroduceageneraldefinitionoffinitefailureandtheconceptoffairSLDresolution,andshowthatthisprocedureissoundandstronglycompletewithrespecttobothsuccessan

4、dfinitefailure.thusextendingaresultofAptandVanEmden(1982).Keywords.Logicpro~ram:iung,csemantics.chaoticiterations.SLDresolution.finitefailure,PROI.CX.1.IntroductionVanEmdenandKobvalski[IS]gaveveryelegantsimplefixedpointandmodel-theoreticsemanticsforlog

5、icprogramsindefiniteclausalform.AptandVanEmden[I]furtherexploitedfixedpointtechniquestoestablishthesoundnessandcomplzte-nessofSLDresolutionwithrespecttosuccessandtocharacterizeSLDfinitefailure.Thesetwopaperswhichgivetheformalsemanticsofwhatcouldbecalle

6、dpunIWXOC;havebeenwidelycitedintheliterature.P.CousotandR.Cousotinalongseriesofpapers(see[6]forabibliography)haveusedthenotionsofclosureandchaoticiterationstoestablish,inparticular,formalmodelsofglobaldataflowanaiysis.Takingaslightlydifferentapproachfr

7、omVanEmdenandKowalskisweconsideralogicprogramtoconsistonlyofinferencerules,theaxiomsbeingconsideredasinput.Thefunction[P]representingthesemanticsoftheprogramisthentheclosure(idempotent,increasing)ofthefunction[R]representingthesemanticsoftheiules.Thisc

8、losurepropertyallowsustousethetechniquesofCousotandCousot.Furtherclassicalfixedpointtheoremscanthenbeadaptedtoprovidesimplealgebraiccharacterizationsinthesemanticsoflogicprogramming.*ResearchsupportedbytheAustralianComputerResearchBoard

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。