%0 Journal Article
%T Simply-typed underdeterminism<br>Simply-typed Underdeterminism
%A Ewen Denney
%A <br>Ewen
%A Denney
%J 计算机科学技术学报
%D 1998
%I 
%X An extension of the simply-typed lambda calculus with constructs for expressing a notioncalled underdeterminism is studied. This allows us to interpret notions of stub and skeletonused in top-down program development. We axiomatise a simple notion of program refinement,and give a semantics, for which the calculus is proved sound and complete.
%K Refinement
%K lambda-calculus
%K Henkin models<br>程序编制
%K λ－计算
%K Henkin模型
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=0BD724EC006C854F24B740DCDD928E29&yid=8CAA3A429E3EA654&vid=FC0714F8D2EB605D&iid=B31275AF3241DB2D&sid=ABF2590617D31FFD&eid=37F781FD8E744761&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=10