scientific article; zbMATH DE number 1479606

zbMath0942.68615arXiv1311.6125MaRDI QIDQ4490717

Pasquale Malacaria, Radha Jagadeesan, Samson Abramsky

Publication date: 20 July 2000

Full work available at URL: https://arxiv.org/abs/1311.6125

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

Game semantics for constructive modal logic, The convex powerdomain in a category of posets realized by cpos, Game theoretic analysis of call-by-value computation, Projecting sequential algorithms on strongly stable functions, Order algebras: a quantitative model of interaction, A game-theoretic framework for specification and verification of cryptographic protocols, A general adequacy result for a linear functional language, Strict finitism and feasibility, Glueing and orthogonality for models of linear logic, A fully abstract model for the \(\pi\)-calculus., A synthetic theory of sequential domains, Game-theoretic analysis of call-by-value computation, A specification structure for deadlock-freedom of synchronous processes, Regular-Language Semantics for a Call-by-Value Programming Language, Interaction graphs: multiplicatives, A relational account of call-by-value sequentiality, Innocent game models of untyped \(\lambda\)-calculus, Finitary PCF is not decidable, Free \(\mu\)-lattices, An Explicit Framework for Interaction Nets, Stratified coherence spaces: A denotational semantics for light linear logic, Abstract Interpretation for Proving Secrecy Properties in Security Protocols, Concrete Process Categories, Non-Uniform Hypercoherences, Parallel and serial hypercoherences, Sequential algorithms and strongly stable functions, Games and full abstraction for FPC., Full abstraction for PCF, A structural approach to reversible computation