Type-free lazy lambda-calculus is enriched with angelic parallelism an
d demonic nondeterminism. Call-by-name and call-by-value abstractions
are considered and the operational semantics is stated in terms of a m
ust convergence predicate. We introduce a type assignment system with
intersection and union types, and we prove that the induced logical se
mantics is fully abstract.