Lambda the Ultimate

Looking into Halgreen's Fun with Functional Dependencies and Shan/Kiselyov's Lightweight static capabilities, I am curious has there been any work done on prettifying the syntax involved in doing computation on the type level. Has camlp4 or Template Haskell been used in making the syntax for like the native language? Perhaps even maybe more Prolog-like?"

Thanks in advance for any suggestions