Matching logic was recently proposed as a unifying for specifying and reasoning about static structure dynamic behavior of programs. In matching logic, patterns specifications are used to uniformly represent mathematical domains (such numbers Boolean values), datatypes, transition systems, whose properties can be reasoned using one fixed proof system. this paper we give tutorial logic. We use s...
