Interpreting Localized Computational Effects Using Operators of Higher Type

Authors:
John Longley
Affiliations:
Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh, Edinburgh, UK EH9 3JZ
Venue:
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Year:
2008

Citing 19
Cited 0

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads

Information and Computation
Imperative functional programming

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
State in Haskell

Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
Domains and lambda-calculi

Domains and lambda-calculi
Full abstraction for idealized Algol with passive expressions

Theoretical Computer Science - Special issue on linear logic, 1
On the Symmetry of Sequentiality

Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Call-by-Value Games

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A Fully Abstract Game Semantics for General References

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Monadic encapsulation of effects: a revised approach (extended version)

Journal of Functional Programming
Comparing hierarchies of types in models of linear logic

Information and Computation
Nominal Games and Full Abstraction for the Nu-Calculus

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On a monadic semantics for freshness

Theoretical Computer Science - Applied semantics: Selected topics
Full abstraction for nominal general references

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On the ubiquity of certain total type structures

Mathematical Structures in Computer Science
Free-algebra models for the π -calculus

Theoretical Computer Science
Not enough points is enough

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We outline a general approach to providing intensional models for languages with computational effects, whereby the problem of interpreting a given effect reduces to that of finding an operator of higher type satisfying certain equations. Our treatment consolidates and generalizes an idea that is already implicit in the literature on game semantics. As an example, we work out our approach in detail for the case of fresh name generation, and discuss some particular models to which it applies.