.png){kind=icon}
.png){kind=icon}
Return
Determinacy Checking for Elpi: an Higher-Order Logic Programming Language with Cut
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-15981-6_5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Elpi is a higher-order logic programming language derived from lambda Prolog and widely used to extend the Rocq interactive theorem prover. Typical users are familiar with types and functional programming but often lack experience with backtracking. We introduce a language of signatures to declare that a predicate is operationally deterministic, meaning that calling the predicate does not leave any choice points. The signature language handles higher-order programs and dynamic programs. We present a static analyzer that verifies these signatures and report its application to the majority of public Elpi code in the Rocq ecosystem.
Keywords:
Determinacy Analysis
Higher Order
Logic Programming
Cut
Journal
P
IF:
0
Papers:
12
Citations:
0