Full Abstraction for PCF

An intensional model for the programming language PCF is described in which the types of PCF are interpreted by games and the terms by certain history-free strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable in a certain si...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information and computation Ročník 163; číslo 2; s. 409 - 470
Hlavní autoři:	Abramsky, Samson, Jagadeesan, Radha, Malacaria, Pasquale
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 15.12.2000 Elsevier
Témata:	Applied sciences Computer science; control theory; systems Exact sciences and technology full abstraction functional computation game semantics General logic Language theory and syntactical analysis linear logic Logic and foundations Mathematical logic, foundations, set theory Mathematics PCF programming language semantics Sciences and techniques of general use sequentiality Theoretical computing PCF functional computation linear logic full abstraction game semantics programming language semantics sequentiality Functional computationFunctional calculus Linear logic Programming language Semantics Game semantics Programming language semantics Abstraction Logic
ISSN:	0890-5401, 1090-2651
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!