A Fragment of ML Decidable by Visibly Pushdown Automata

DOI10.1007/978-3-642-22012-8_11zbMath1333.68079OpenAlexW2205883199MaRDI QIDQ3012916

No author found.

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (6)

Algorithmic games for full ground references ⋮ Block structure vs scope extrusion: between innocence and omniscience ⋮ Program equivalence in a simple language with state ⋮ ML and Extended Branching VASS ⋮ Algorithmic probabilistic game semantics. Playing games with automata ⋮ Contextual Approximation and Higher-Order Procedures

Uses Software

• HOMER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functions with local state: regularity and undecidability
• On full abstraction for PCF: I, II and III
• The regular-language semantics of second-order idealized ALGOL
• Game-theoretic analysis of call-by-value computation
• Algorithmic Nominal Game Semantics
• Deciding Equivalence of Finite Tree Automata
• Block Structure vs. Scope Extrusion: Between Innocence and Omniscience
• Visibly pushdown languages
• Regular-Language Semantics for a Call-by-Value Programming Language
• State-dependent representation independence
• About the undecidability of program equivalence in finitary languages with state
• Foundations of Software Science and Computational Structures
• Automata, Languages and Programming

This page was built for publication: A Fragment of ML Decidable by Visibly Pushdown Automata