the curry–howard isomorphism implies a connection between logic and programming: every proof of a theorem of intuitionistic logic corresponds to a reduction of a typed lambda term, and conversely. moreover, theorems can be identified with function type signatures. specifically, a typed combinatory logic corresponds to a hilbert system in proof theory.