A relational account of call-by-value sequentiality

DOI10.1006/inco.2002.2957zbMath1096.68019OpenAlexW2103277171MaRDI QIDQ2506495

Anders Sandholm, Jon G. Riecke

Publication date: 10 October 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1a9f0dd3bf68f2c0834e936d80f4f761312d2579

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (4)

Game theoretic analysis of call-by-value computation ⋮ Game-theoretic analysis of call-by-value computation ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ Prelogical relations

Cites Work

• Notions of computation and monads
• Partiality, cartesian closedness, and toposes
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• On full abstraction for PCF: I, II and III
• Kripke logical relations and PCF
• Relational properties of domains
• Game-theoretic analysis of call-by-value computation
• Fully abstract translations between functional languages
• Parametricity and local variables
• Games and Definability For FPC
• Finitary PCF is not decidable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A relational account of call-by-value sequentiality