smt - Transpiling language constructs to z3 -

i looking discussion of how convert various programming language constructs z3, without limiting efficiency of solver.

in particular, there algorithm , set of best-practice rules converting function/program expressed in continuation passing style z3?

the use context use z3 implementing type system programming language, solution has efficient , incremental (e.g. retain previous z3 asts in z3 instance).

i aware of boogie, looking more lightweight if possible.

constraining semantics of input language acceptable, not far trivially expressible in smtlib.

i looking discussion of different strategies 1 might consider various typical language constructs.

edit: might acceptable have restrictions make input language non-turing-complete , reasonable efficient smaller program fragments (like functions in library). e.g. input language language writing "statically checked" libraries later transpiled down libraries existing dynamic programming language dynamic runtime asserts appropriate.