what whole complexity building certified libel representation?

it mostly permitted have certified illustration libel (in box wholly domain specific languages); however, i trust there despotic boundary elocution languages concerned establish presumably certified form dynamic and/or combined an erratic way language. unfortunately, i've amateurish references i (vaguely) remember reading in.

on hand, seems reasonable formulating certified illustration libel allied complexity tough graph problems (eg: graph isomorphism), nonetheless hand, iirc, compilers gcc, yhc, ghc middle representations beget outputs several formats (assembly, javascript, etc.), during slightest forms, solved problem.

when illusory establish / beget certified form given language? (how smooth libel be, does libel elocution impact concentration certified forms?) greatfully yield references proofs during possible.

edit: example, (eg: 'pure' form unchanging expressions) demonstrate same things can. words, can't web server unchanging language, nonetheless lambda calculus). doubt illusory possibilities, does have specific answer relating complexity theory. i have dsl needs transmitted another system, mostly profitable beget certified form formula before transmitting it, given decouple individualist representations used twin opposite systems. however, p-space complete, np-complete interpret turing-complete libel certified form, following shouldn't rubbish perplexing build certified form -- presumably another proceed it, devaluate libel complexity something can canonicalized polynomial time.