The anatomy of innocence revisited

Authors:
Russ Harmer;Olivier Laurent
Affiliations:
PPS, CNRS and Université Paris 7;PPS, CNRS and Université Paris 7
Venue:
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2006

Citing 5
Cited 1

On full abstraction for PCF: I, II, and III

Information and Computation
Hereditarily Sequential Functionals

LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Games and Weak-Head Reduction for Classical PCF

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
The Anatomy of Innocence

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Full abstraction for functional languages with control

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

A Graphical Foundation for Schedules

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We refine previous analyses of Hyland-Ong game semantics and its relation to λ- and λμ-calculi and present improved factorization results for bracketing and rigidity that can be combined in any order.