Publication:2754137
From MaRDI portal
zbMath0973.68506MaRDI QIDQ2754137
Publication date: 6 December 2001
Related Items
Regular-Language Semantics for a Call-by-Value Programming Language, Program equivalence in a simple language with state, Functions with local state: regularity and undecidability, Syntactic control of concurrency, Full abstraction for PCF, The regular-language semantics of second-order idealized ALGOL, An approach to deciding the observational equivalence of Algol-like languages, Third-order Idealized Algol with iteration is decidable, Angelic semantics of fine-grained concurrency, Games for complexity of second-order call-by-name programs, A Categorical Semantics of Higher Order Store