Maximality and totality of stable functions in the category of stable bifinite domains

This paper studies maximality and totality of stable functions in the category of stable bifinite domains. We present three main results as follows,o(1)every maximum-preserving function is a maximal element in the stable function spaces; (2)a maximal stable function f : D -> E is maximum-preserving if D is maximum-separable and E is completely separable; and (3)a stable bifinite domain D is maximum-separable if and only if for any locally distributive stable bifinite domain E, each maximal stable function f : D -> E is maximum-preserving.

[1]  Manfred Droste,et al.  On Stable Domains , 1993, Theor. Comput. Sci..

[2]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[3]  Ying Jiang,et al.  On an open problem of Amadio and Curien: The finite antichain condition , 2005, Inf. Comput..

[4]  Roberto M. Amadio,et al.  Domains in a Realizability Framework , 1991, TAPSOFT, Vol.1.

[5]  Roberto M. Amadio,et al.  Bifinite Domains: Stable Case , 1991, Category Theory and Computer Science.

[6]  Guo-Qiang Zhang.  On Maximal Stable Functions , 1995, Theor. Comput. Sci..

[7]  Robert Cartwright,et al.  The topology of program termination , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[8]  Guo-Qiang Zhang.  Stable Neighbourboods , 1992, Theor. Comput. Sci..

[9]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[10]  Roberto M. Amadio,et al.  Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.

[11]  Guo-Qiang Zhang.  Logic of Domains , 1991, Progress in Theoretical Computer Science.

[12]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[13]  Gérard Berry,et al.  Stable Models of Typed lambda-Calculi , 1978, ICALP.