We present a formal model for translating unranked syntactic trees, such as dependency trees, into semantic graphs. The proposed tree-to-graph transducers can serve as a formalization of transition-based systems which recently have been shown to perform very well, yet hitherto lack a suitable formal basis. Our model features “extended” rules and a useful normal form, comes with an efficient translation algorithm, and can in a straightforward manner be equipped with weights.