Decidability and syntactic control of interference

We investigate the decidability of observational equivalence and approximation in Reynolds' ''Syntactic Control of Interference'' (SCI), a prototypical functional-imperative language in which covert interference between functions and their arguments is prevented by the use of an affine typing discipline. By associating denotations of terms in a fully abstract ''relational'' model of finitary basic SCI (due to Reddy) with multitape finite state automata, we show that observational approximation is not decidable (even at first order), but that observational equivalence is decidable for all terms. We then consider the same problems for basic SCI extended with non-local control in the form of backwards jumps. We show that both observational approximation and observational equivalence are decidable in this ''observably sequential'' version of the language by describing a fully abstract games model in which strategies are regular languages.

[1]  Andrzej S. Murawski.  On program equivalence in languages with ground-type references , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[2]  Peter W. O'Hearn,et al.  Algol-like Languages , 1997, Progress in Theoretical Computer Science.

[3]  James Laird,et al.  Full abstraction for functional languages with control , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[4]  James Laird.  Decidability in Syntactic Control of Interference , 2005, ICALP.

[5]  Guy McCusker,et al.  On the Semantics of the Bad-Variable Constructor in Algol-like Languages , 2004, MFPS.

[6]  John C. Reynolds,et al.  Syntactic control of interference , 1978, POPL.

[7]  Peter W. O'Hearn,et al.  Syntactic control of interference revisited , 1995, MFPS.

[8]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[9]  Guy McCusker.  Games and Full Abstraction for a Functional Metalanguage with Recursive Types , 1998, Distinguished Dissertations.

[10]  Matthias Felleisen,et al.  Observable sequentiality and full abstraction , 1992, POPL '92.

[11]  Guy McCusker,et al.  Categorical and game semantics for SCIR , 2005, GALOP@ETAPS.

[12]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[13]  Guy McCusker.  A Fully Abstract Relational Model of Syntactic Control of Interference , 2002, CSL.

[14]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[15]  James Laird.  On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF , 2007, Fundam. Informaticae.

[16]  Andrzej S. Murawski,et al.  Third-order Idealized Algol with iteration is decidable , 2008, Theor. Comput. Sci..

[17]  Dan R. Ghica,et al.  The regular-language semantics of second-order , 2003 .

[18]  James Laird.  Game semantics and linear CPS interpretation , 2005, Theor. Comput. Sci..

[19]  Tero Harju,et al.  The Equivalence Problem of Multitape Finite Automata , 1991, Theor. Comput. Sci..

[20]  Nissim Francez,et al.  Basic simple type theory , 1998 .

[21]  Samson Abramsky,et al.  A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[22]  Ralph Loader.  Finitary PCF is not decidable , 2001, Theor. Comput. Sci..

[23]  C.-H. Luke Ong.  An approach to deciding the observational equivalence of Algol-like languages , 2004, Ann. Pure Appl. Log..

[24]  Russell Harmer.  Games and full abstraction for non-deterministic languages , 1999 .

[25]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[26]  Samson Abramsky,et al.  Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..

[27]  S. Abramsky.  Game Semantics , 1999 .

[28]  John C. Reynolds,et al.  The essence of ALGOL , 1997 .

[29]  Efim B. Kinber.  The Inclusion Problem for some Classes of Deterministic Multitape Automata , 1983, Theor. Comput. Sci..

[30]  Samson Abramsky.  Beyond full abstraction: model-checking for Algol-like languages , 2001 .