暂无分享,去创建一个
We extend functional languages with high-level exception handling. To be specific, we allow sequential-disjunction expressions of the form $E_0 \bigtriangledown E_1$ where $E_0, E_1$ are expressions. These expressions have the following intended semantics: sequentially $choose$ the first successful $E_i$ and evaluate $E_i$ where $i$ = 0 or 1. These expressions thus allow us to specify an expression $E_0$ with the failure-handling (exception handling) routine, i.e., expression $E_1$. We also discuss the class of sequential-conjunction function declarations which is a dual of the former.
[1] Dale Miller,et al. A Logical Analysis of Modules in Logic Programming , 1989, J. Log. Program..
[2] Ekaterina Komendantskaya,et al. On uniform proof-theoretical operational semantics for logic programming , 2005 .
[3] Giorgi Japaridze,et al. Sequential operators in computability logic , 2007, Inf. Comput..