Parallel programming - the ability to rollback the result of a function?

Question

Programming

A long time ago I read an article that described such a feature:
We declare a function in a special way. If during the execution of the function some data has changed, then we produce a rollback and it starts again. This way you can achieve thread-safe and no deadlocks.
Now I don't even remember the programming language I was talking about.
Where to find it?

Answer 1

en.wikipedia.org/wiki/Transactional_memory

Answer 2

In winapi, *nix api, as far as I know, there is nothing like that. Most likely Java. And in any case - mutexes, wait funtions, normal architecture - the best way to take care of thread-safe.