The following pages link to (Q3221399):
Displaying 6 items.
- Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
- Recursion equation sets computing logic programs (Q920624) (← links)
- Applications of compactness in the Smyth powerdomain of streams (Q1107301) (← links)
- Completions of perpetual logic programs (Q1193890) (← links)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
- The fixed points of logic programs with Herbrand base \({\mathbb{N}}\) (Q2639644) (← links)
