A Declarative Semantics of Parallel Logic Programs based on Failure/Deadlock Set
Masaki Murakami · Institutional Repositories DataBase (IRDB) · 1989
This paper presents a declarative semantics of Flat GHC programs.The semantics presented here is based on the failure/deadlock set of a Flat GHC program, namely the set of the $I/O$ histories representing computations which fail or fall into deadlock within finite steps.