Decidability of All Minimal Models (Revised Version - 2012)

This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class of a minimal model.

[1]  Manfred Schmidt-Schauß,et al.  Decidability of Behavioural Equivalence in Unary PCF , 1999, Theor. Comput. Sci..

[2]  Ralph Loader.  Unary PCF is Decidable , 1998, Theor. Comput. Sci..

[3]  Vincent Padovani,et al.  Decidability of All Minimal Models , 1995, TYPES.

[4]  Ralph Loader.  An Algorithm for the Minimal Model , 2003 .

[5]  Vincent Padovani.  Filtrage d'ordre superieur , 1996 .

[6]  Vincent Padovani,et al.  Decidability of fourth-order matching , 2000, Mathematical Structures in Computer Science.