Decidability of behavioural equivalence
β
Manfred Schmidt-SchauΓ
π
Article
π
1999
π
Elsevier Science
π
English
β 750 KB
Unary PCF is a fragment of the simply typed lambda-calculus PCF. We present a short proof that behavioral equivalence in unary PCF is decidable. An algorithm is described that enumerates all behaviorally equivalent expressions by increasing types, where types are ordered by a nested multiset orderin