Regular-Language Semantics for a Call-by-Value Programming Language

DOI10.1016/S1571-0661(04)80958-7zbMath1260.68095MaRDI QIDQ4917052

Dan R. Ghica

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

The regular-language semantics of second-order idealized ALGOL ⋮ An approach to deciding the observational equivalence of Algol-like languages ⋮ Block structure vs scope extrusion: between innocence and omniscience ⋮ Algorithmic Nominal Game Semantics ⋮ A Fragment of ML Decidable by Visibly Pushdown Automata ⋮ Functions with local state: regularity and undecidability ⋮ Games for complexity of second-order call-by-name programs ⋮ Syntactic control of concurrency

Cites Work

• Notions of computation and monads
• Full abstraction for idealized Algol with passive expressions
• On full abstraction for PCF: I, II and III
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular-Language Semantics for a Call-by-Value Programming Language