ACM Transactions on Computational Logic (TOCL)
Exceptions, Continuations and Macro-expressiveness
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Axiomatizing Fully Complete Models for ML Polymorphic Types
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Fully Complete PER Model for ML Polymorphic Types
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
Syntactic control of concurrency
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Syntax vs. semantics: a polarized approach
Theoretical Computer Science - Game theory meets theoretical computer science
Information and Computation
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Game semantics and linear CPS interpretation
Theoretical Computer Science - Foundations of software science and computation structures
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidability and syntactic control of interference
Theoretical Computer Science
Curry-style type isomorphisms and game semantics
Mathematical Structures in Computer Science
Game Semantics for Access Control
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A game semantics of linearly used continuations
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Estimation of the length of interactions in arena game semantics
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
The anatomy of innocence revisited
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Compositional model extraction for higher-order concurrent programs
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Computation-by-Interaction with effects
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed normal form bisimulation
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The Lambda Lambda-Bar calculus: a dual calculus for unconstrained strategies
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
This paper considers the consequences of relaxing the bracketing condition on `dialogue games', showing that this leads to a category of games which can be `factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for PCF with control operators at atomic types. Thus we define a fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games.