scientific article

zbMath0973.68506MaRDI QIDQ2754137

Dan R. Ghica, Guy McCusker

Publication date: 6 December 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15)

Related Items (16)

The regular-language semantics of second-order idealized ALGOL ⋮ An approach to deciding the observational equivalence of Algol-like languages ⋮ Program equivalence in a simple language with state ⋮ Leafy automata for higher-order concurrency ⋮ Logic and Geometry of Agents in Agent-Based Modeling ⋮ Third-order Idealized Algol with iteration is decidable ⋮ Angelic semantics of fine-grained concurrency ⋮ Regular-Language Semantics for a Call-by-Value Programming Language ⋮ Functions with local state: regularity and undecidability ⋮ Game Semantics for Access Control ⋮ Contextual Approximation and Higher-Order Procedures ⋮ A case study in programming coinductive proofs: Howe’s method ⋮ A Categorical Semantics of Higher Order Store ⋮ Games for complexity of second-order call-by-name programs ⋮ Full abstraction for PCF ⋮ Syntactic control of concurrency

This page was built for publication: