ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States

We prove that the observational equivalence problem for a finitary fragment of the programming langauge ML is recursively equivalent to the reachability problem for extended branching vector addition systems with states (EBVASS). This result has two natural and independent parts. We first prove that the observational equivalence problem is equivalent to the emptiness problem for a new class of class memory automata equipped with a visibly pushdown stack, called Visibly Pushdown Class Memory Automata (VPCMA). Our proof uses the fully abstract game semantics of the language. We then prove that the VPCMA emptiness problem is equivalent to the reachability problem for EBVASS. The results of this article complete our programme to give an automata classification of the ML types with respect to the observational equivalence problem for closed terms.

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

[2]  C.-H. Luke Ong.  Observational equivalence of 3rd-order Idealized Algol is decidable , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[3]  Andrzej S. Murawski,et al.  Game Semantic Analysis of Equivalence in IMJ , 2015, ATVA.

[4]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

[5]  Dan R. Ghica,et al.  Reasoning about Idealized ALGOL Using Regular Languages , 2000, ICALP.

[6]  Conrad Cotton-Barratt.  Using class memory automata in algorithmic game semantics , 2016 .

[7]  Andrzej S. Murawski,et al.  Idealized Algol with Ground Recursion, and DPDA Equivalence , 2005, ICALP.

[8]  Florent Jacquemard,et al.  FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems , 2016, Log. Methods Comput. Sci..

[9]  Thomas Schwentick,et al.  On Notions of Regularity for Data Languages , 2007, FCT.

[10]  Andrzej S. Murawski,et al.  A Fragment of ML Decidable by Visibly Pushdown Automata , 2011, ICALP.

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

[12]  Andrzej S. Murawski,et al.  Algorithmic Nominal Game Semantics , 2011, ESOP.

[13]  Ofer Strichman,et al.  Regression verification , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[14]  Nobuko Yoshida,et al.  Game-Theoretic Analysis of Call-by-Value Computation , 1997, Theor. Comput. Sci..

[15]  Andrzej S. Murawski,et al.  Fragments of ML Decidable by Nested Data Class Memory Automata , 2015, FoSSaCS.

[16]  Andrzej S. Murawski,et al.  Full Abstraction for Reduced ML , 2009, FoSSaCS.

[17]  Sylvain Schmitz,et al.  Non-elementary complexities for branching VASS, MELL, and extensions , 2014, CSL-LICS.

[18]  Tadao Kasami,et al.  Some Decision Problems Related to the Reachability Problem for Petri Nets , 1976, Theor. Comput. Sci..

[19]  David G. B. Hopkins.  Game semantics based equivalence checking of higher-order programs , 2012 .

[20]  I. Stark,et al.  Operational reasoning for functions with local state , 1999 .

[21]  Andrzej S. Murawski.  Functions with local state: Regularity and undecidability , 2005, Theor. Comput. Sci..

[22]  Bruno Guillaume,et al.  Vector addition tree automata , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[23]  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..

[24]  Andrzej S. Murawski,et al.  Weak and Nested Class Memory Automata , 2015, LATA.

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

[26]  Andrzej S. Murawski,et al.  ML and Extended Branching VASS , 2017, ESOP.

[27]  Samson Abramsky,et al.  Call-by-Value Games , 1997, CSL.