Are there any high level memory-hard PBKDF constructions?
Are there any memory-hard PBKDF constructions that can be implemented
  using only common standard crypto primitives, like (generic) hash
  functions and/or block ciphers?


Of course there is one, and it even got a "special recognition" at PHC:
Catena.

I won't go into the details of Catena here (the paper does it much better on its 50+ pages), but it comes with pebble-game-based security reductions, rigorous security proofs, default instances and a alot of customizable parameters (namely four):


It uses a cryptographic primitive, the paper suggests Blake2b, but really any hash will do, which you can compute quickly
It uses a round-reduced cryptographic primitive, although a full-rounded version will also work
It takes an optional randomziation layer, to harden memory initialization
It takes some "memory-hard" function


Finally it uses all these parameters and a clever graph driven data flow to achieve basically all desirable properties being expected from a modern password hash.

Note: Default parameters for the latter two choices are provided, so that the user basically has the choice between two Catena variants based on their favorite hash.