Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting

We show that, in a fairly general setting including higher-types, may, must and probabilistic testing are semi-decidable. The case of must testing is perhaps surprising, as its mathematical definition involves universal quantification over the infinity of possible outcomes of a non-deterministic program. The other two involve existential quantification and integration. We also perform first steps towards the semi-decidability of similar tests under the simultaneous presence of non-deterministic and probabilistic choice.

[1]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electronic Notes in Theoretical Computer Science.

[2]  A. Edalat,et al.  Advances in theory and formal methods of computing : proceedings of the third Imperial College workshop, Christ Church, Oxford, 1-3 April 1996 , 1996 .

[3]  Matthias Schröder,et al.  Probabilistic Observations and Valuations: (Extended Abstract) , 2005, MFPS.

[4]  Martin Hofmann,et al.  On the non-sequential nature of the interval-domain model of real-number computation , 2004, Mathematical Structures in Computer Science.

[5]  Martín Hötzel Escardó,et al.  Operational domain theory and topology of a sequential programming language , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[6]  Michael B. Smyth,et al.  Effectively given Domains , 1977, Theor. Comput. Sci..

[7]  Martín Hötzel Escardó,et al.  PCF Extended with Real Numbers , 1996, Theor. Comput. Sci..

[8]  Matthias Schröder,et al.  Representing probability measures using probabilistic processes , 2006, J. Complex..

[9]  Reinhold Heckmann,et al.  An Upper Power Domain Construction in Terms of Strongly Compact Sets , 1991, MFPS.

[10]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[11]  Michael B. Smyth.  Power Domains , 1978, J. Comput. Syst. Sci..

[12]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[13]  Carl A. Gunter,et al.  Semantic Domains , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[14]  H. Luke Ong,et al.  Non-Determinism in a Functional Setting (Extended Abstract) , 1993 .

[15]  Thomas Streicher,et al.  Real PCF extended with is universal (Extended Abstract) , 1996 .

[16]  Dag Normann.  Exact real number computations relative to hereditarily total functionals , 2002, Theor. Comput. Sci..

[17]  Michael B. Smyth,et al.  Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.

[18]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[19]  Adam Scriven,et al.  A Functional Algorithm for Exact Real Integration with Invariant Measures , 2008, MFPS.

[20]  S. G. Hoggar.  Mathematics for computer graphics , 1993, Cambridge tracts in theoretical computer science.

[21]  A. Kock.  Monads for which Structures are Adjoint to Units , 1995 .

[22]  Claire Jones,et al.  Probabilistic non-determinism , 1990 .

[23]  Thomas Streicher,et al.  Domain-theoretic foundations of functional programming , 2006 .

[24]  Steven J. Vickers,et al.  Locales are Not Pointless , 1994, Theory and Formal Methods.

[25]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[26]  Annabelle McIver,et al.  Partial correctness for probabilistic demonic programs , 2001, Theor. Comput. Sci..

[27]  Martín Hötzel Escardó,et al.  Semantic Domains, Injective Spaces and Monads , 1999, MFPS.

[28]  Pietro Di Gianantonio.  A Functional Approach to Computability on Real Numbers , 2005 .

[29]  Abbas Edalat,et al.  Integration in Real PCF , 2000, Inf. Comput..

[30]  Kurt Sieber.  Call-by-Value and Nondeterminism , 1993, TLCA.

[31]  Reinhold Heckmann.  Power Domains and Second-Order Predicates , 1993, Theor. Comput. Sci..

[32]  Andrea Schalk,et al.  Algebras for generalized power constructions , 1993 .

[33]  Martín Hötzel Escardó,et al.  Synthetic Topology: of Data Types and Classical Spaces , 2004, DTMPP.

[34]  Dana S. Scott,et al.  A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..

[35]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[36]  Glynn Winskel,et al.  Distributing probability over non-determinism , 2006, Mathematical Structures in Computer Science.

[37]  Alex K. Simpson,et al.  Lazy Functional Algorithms for Exact Real Functionals , 1998, MFCS.

[38]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[39]  Matthias Schröder,et al.  A Convenient Category of Domains , 2007, Computation, Meaning, and Logic.

[40]  Thomas Streicher,et al.  Induction and Recursion on the Partial Real Line with Applications to Real PCF , 1999, Theor. Comput. Sci..

[41]  Achim Jung,et al.  The troublesome probabilistic powerdomain , 1997, COMPROX.

[42]  Thomas Anberrée.  On the Non-sequential Nature of Domain Models of Real-number Computation , 2007, MFPS.

[43]  Matthew Hennessy,et al.  A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus , 1980, Theor. Comput. Sci..

[44]  Martín Hötzel Escardó,et al.  Exhaustible Sets in Higher-type Computation , 2008, Log. Methods Comput. Sci..

[45]  Reinhold Heckmann,et al.  Spaces of Valuations , 1996 .

[46]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electron. Notes Theor. Comput. Sci..

[47]  Abbas Edalat,et al.  Semantics of exact real arithmetic , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[48]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[49]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.