针脚:Prolog + SMT 源码

缝 序言: 统一循环数据 适用于复杂约束的SMT求解器 句法 map _ nil = nil . map F ( X :: XS ) = ( Y :: YS ) <== F X = Y , map F XS = YS . z + N = N . s N + M = (s P ) <== N + M = P . -- Find F such that map F [0, 1] = [1, 2] map F (z :: ( s z :: nil )) = (s z :: ( s ( s z ) :: nil )) ? -- F = (s z +) -- Add a list