Nominal LCF:一种通用证明语言
Nominal LCF: A Language for Generic Proof
摘要:
在策略语言中,用户提供的假设名称的语法和语义是一个棘手的问题,因为证明的绑定结构是执行策略脚本的目标的函数。我们提出了一种新的语言来处理名字在策略脚本中的动态性和交互性,称为名义LCF,并赋予它一个指称语义在dI域。名义LCF的一个大片段已经实现,并用于新的RedPRL证明助手的巨大影响。
英文摘要:
The syntax and semantics of user-supplied hypothesis names in tactic languages is a thorny problem, because the binding structure of a proof is a function of the goal at which a tactic script is executed. We contribute a new language to deal with the dynamic and interactive character of names in tactic scripts called Nominal LCF, and endow it with a denotational semantics in dI-domains. A large fragment of Nominal LCF has already been implemented and used to great effect in the new RedPRL proof assistant.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。