<language>Haskell) into a layer of constraint logic, which allows logical variables inside functional expressions. In order to preserve referential transparency, functional reduction suspends until logical variables become bound. Logical variables are bound by equational constraints, which impose relations over expressions. Hence, constraints are the means to structure the concurrent reduction of functional expressions.
Last updated: 1995-02-21