(GHC) A parallel dialect of Prolog by K. Ueda in which each CLause has a guard. GHC is similar to Parlog. When several CLauses match a goal, their guards are evaluated in parallel and the first CLause whose guard is found to be true is used and others are rejected. It uses committed-choice nondeterminism. See also FGHC, KL1. (1995-05-09)