Filters








16 Hits in 4.4 sec

A Mathematical Game Semantics of Concurrency and Nondeterminism [chapter]

Julian Gutierrez
2015 Lecture Notes in Computer Science  
However, such a closure operator semantics has not been investigated in the more general nondeterministic case.  ...  Extended with winning conditions, the model is also able to give semantics to logics of various kinds.  ...  In all of these cases, the model of concurrent games as event structures could be used as an underlying semantic framework, and in particular our nondeterministic closure operator characterisation/semantics  ... 
doi:10.1007/978-3-319-25150-9_35 fatcat:kyfxxg3icjcbln7o4mgfyz6z3e

A Fully Abstract Game Semantics for Countable Nondeterminism

W. John Gowers, James D. Laird, Michael Wagner
2018 Annual Conference for Computer Science Logic  
We solve a long standing problem by giving a fully abstract game semantics for a simple stateful language with a countably infinite nondeterminism primitive.  ...  Game semantics models of nondeterminism show that this is hard to implement; for example, Harmer and McCusker's model only admits infinite nondeterminism if there is also the possibility of divergence.  ...  Game Semantics for Countable Nondeterminism Proof.  ... 
doi:10.4230/lipics.csl.2018.24 dblp:conf/csl/GowersL18 fatcat:shxxc4hhd5agboty2qtgdhb7oi

Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism [article]

James Laird
2021 arXiv   pre-print
We prove that these are computationally adequate, despite the non-continuity of the must-testing semantics of unbounded nondeterminism.  ...  We illustrate by defining may-testing and must-testing denotational semantics for sequential functional languages with bounded and unbounded choice operators.  ...  and Ong [TO15] based on a sheaved model, as well as in concurrent games models [RW11] This succeeds in characterizing the definable elements in a model of the λ-calculus with choice, although it does  ... 
arXiv:1710.10203v5 fatcat:cbk6thas6bb6rlitwlcg7rbrbu

Non-angelic Concurrent Game Semantics [chapter]

Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel
2018 Lecture Notes in Computer Science  
The hiding operation, crucial in the compositional aspect of game semantics, removes computation paths not leading to observable results.  ...  standard concurrent games) while avoiding the angelic bias.  ...  Being based on sequences of moves, traditional game semantics handles concurrency via interleavings [10] .  ... 
doi:10.1007/978-3-319-89366-2_1 fatcat:gdtzvkcs2rbglgjw4eibns3g2q

Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism

James Laird
2021 Logical Methods in Computer Science  
We prove that these are computationally adequate, despite the non-continuity of the must-testing semantics of unbounded nondeterminism.  ...  We illustrate by defining may-testing and must-testing denotational semantics for sequential functional languages with bounded and unbounded choice operators.  ...  Ong [TO15] based on a sheaved model, as well as in concurrent games models [RW11] This succeeds in characterizing the definable elements in a model of the λ-calculus with choice, although it does  ... 
doi:10.46298/lmcs-17(4:11)2021 fatcat:tpcwjedbm5bajhlg5hvllbgnfi

What's in a game? A theory of game models [article]

Clovis Eberhart, Tom Hirschowitz
2017 arXiv   pre-print
We set out to unify these models into a basic abstract framework for game semantics, game settings.  ...  Game semantics is a rich and successful class of denotational models for programming languages.  ...  Finally, beyond game models, we should investigate game semantics, i.e., the correspondence with operational semantics, as initiated in Eberhart and Hirschowitz [12] in a different setting.  ... 
arXiv:1711.10860v1 fatcat:bfopl72kdjeivaimkddtx6dsie

Positional Injectivity for Innocent Strategies [article]

Lison Blondeau-Patissier
2021 arXiv   pre-print
This insightful result shaped our understanding of the link between dynamic (i.e. game) and static (i.e. relational) semantics.  ...  In this paper, we investigate the positionality of innocent strategies in the traditional setting of Hyland-Ong-Nickau-Coquand pointer games.  ...  Nondeterminism in game semantics via sheaves. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 220-231.  ... 
arXiv:2105.02485v1 fatcat:sy7sckjlenh3dltsrremi6l7mu

What's in a game?

Clovis Eberhart, Tom Hirschowitz
2018 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18  
We set out to unify these models into a basic abstract framework for game semantics, game settings.  ...  Game semantics is a rich and successful class of denotational models for programming languages.  ...  Finally, beyond game models, we should investigate game semantics, i.e., the correspondence with operational semantics, as initiated in Eberhart and Hirschowitz [12] in a di erent setting.  ... 
doi:10.1145/3209108.3209114 dblp:conf/lics/EberhartH18 fatcat:j7fx5obvtnhkvkbhmkzzxiqnla

Subject index volumes 1–200

1999 Theoretical Computer Science  
in free Lie algebras, 1479 graph. 3 165.3226 longest -. 2166 in Ehrenfeucht-FraXssC games, 3218 winning strategy, 1787, 1788, 1820 of a two person game, 57 with probability one. 1788 Winograd,  ...  games misere -, 2289 node-search -. 2617 on graphs, 1719,3129,3390 path-forming -, 2142 rotating-table -, 2117 subtraction -, 2775 two-player -, 2142 game-theoretic operational semantics, 2378  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Some aspects of categories in computer science [chapter]

P.J. Scott
2000 Handbook of Algebra  
program, as well as the general ideas behind game semantics.  ...  Such recursive de ning \equations" are used to specify the semantics of numerous notions in computer science, from datatypes in functional programming languages, to modelling nondeterminism, concurrency  ...  In particular, in each homset Hom C (X; Y ) there is a zero morphism 0 XY : X ?! Y , the sum of the empty family. Remark 6.12 In a PAMon-category C 1.  ... 
doi:10.1016/s1570-7954(00)80027-3 fatcat:oeaqbcqgzjhuzl2ddangzergr4

Endofunctors modelling higher-order behaviours [article]

Marco Peressotti
2016 arXiv   pre-print
From this perspective, the former can be seen as syntactic higher-order whereas the later as semantic higher-order.  ...  In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors.  ...  We plan to investigate this construction in the context of C-valued sheaves over the downward topology on the first transfinite ordinal ω.  ... 
arXiv:1602.06221v2 fatcat:fudx2s3ckrbvpmupf22wsc4fke

2015 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM '15 Helsinki, Finland August 3–8, 2015

2016 Bulletin of Symbolic Logic  
We shall design model-checking games for logics with team semantics in a general and systematic way, based on a notion of second-order reachability games.  ...  Sets of assignments are called teams and the semantics is called team semantics.  ...  We prove that for some sequence of tautologies ϕn the proof steps and the proof sizes in  ... 
doi:10.1017/bsl.2016.22 fatcat:cm4a5yyvgfajzm4qvlszviblni

Bindings as bounded natural functors

Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, Dmitriy Traytel
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
This work is compatible with classical higher-order logic and has been formalized in the proof assistant Isabelle/HOL.  ...  universe of functors on sets, subject to a number of operations that can be used to construct complex binding patterns and binding-aware datatypes, including non-well-founded and infinitely branching types, in  ...  By contrast, we axiomatize binders semantically, via a class of functors.  ... 
doi:10.1145/3290335 fatcat:r4udqzzkhbhgbpft4zabw62ooe

Dagstuhl Reports, Volume 11, Issue 10, October 2021, Complete Issue [article]

2022
In the setting of regular languages of infinite words, Good-for-Games (GFG) automata can be seen as an intermediate formalism between determinism and nondeterminism, with advantages from both worlds.  ...  Some of the notions are yes/no ones, for example initial nondeterminism (restricting nondeterminism to allowing several initial states), and some provide a measure of nondeterminism, for example the ambiguity  ...  How to address this in a way that supports the many use cases of refinement (changes in data representation, reduction of nondeterminism/underspecification, addition of new observation variables, for instance  ... 
doi:10.4230/dagrep.11.10 fatcat:mqui2qttdrdt7p6y3nbkkodoci

Coalgebraic Logics (Dagstuhl Seminar 12411) Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) Time-of-Flight Imaging: Algorithms, Sensors and Applications (Dagstuhl Seminar 12431) Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441) Requirements Management-Novel Perspectives and Challenges (Dagstuhl Seminar 12442)

Lieven Desmet, Martin Johns, Benjamin Livshits, Andrei Sabelfeld, Ernst-Erich Doberkat, Alexander Kurz, Manindra Agrawal, Thomas Thierauf, Christopher Umans, James Davis, Bernd Jähne, Andreas Kolb (+9 others)
2012 unpublished
We then discuss how computational complexity creeps in and how to cope with it.  ...  In addition, we sketch some approaches for dealing with requirements evolution, adopted from the PhD thesis of Neil Ernst [1].  ...  Hoshino, "Semantics of Higher-Order Quantum Computation via Geometry of Interaction," LICS 2011: 237-246.  ... 
fatcat:3zuf3grgabettljj7apksbc4lq
« Previous Showing results 1 — 15 out of 16 results