scientific article; zbMATH DE number 1499102
From MaRDI portal
Publication:4501156
Recommendations
Cited in
(45)- Glueing and orthogonality for models of linear logic
- Parallel and serial hypercoherences
- Game semantics for dependent types
- Answer set programming in intuitionistic logic
- Game semantics and linear CPS interpretation
- The sequentially realizable functionals
- Games and full abstraction for FPC.
- Full abstraction for PCF
- Comparing hierarchies of types in models of linear logic
- Adapting innocent game models for the Böhm tree \(\lambda\)-theory
- Game-theoretic analysis of call-by-value computation
- Algorithmic probabilistic game semantics. Playing games with automata
- A game-semantic model of computation
- Game semantics approach to higher-order complexity
- Second-order type isomorphisms through game semantics
- A game semantics of names and pointers
- Hereditarily optimal realizations of consistent metrics
- Asynchronous games. II: The true concurrency of innocence
- A relational account of call-by-value sequentiality
- Syntax vs. semantics: A polarized approach
- Sequential algorithms and strongly stable functions
- Processes and games
- Definability and full abstraction
- A truly concurrent game model of the asynchronous -calculus
- Game semantics and uniqueness of type inhabitance in the simply-typed -calculus
- scientific article; zbMATH DE number 6004933 (Why is no real title available?)
- Intuitionistic games: determinacy, completeness, and normalization
- Realizability for Peano arithmetic with winning conditions in HON games
- Full Abstraction for Reduced ML
- Full abstraction for Reduced ML
- A game semantics for disjunctive logic programming
- Game theoretic analysis of call-by-value computation
- The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)
- A Game Semantics of Idealized CSP
- Towards nominal Abramsky
- Fibred pseudo double categories for game semantics
- On sequential functionals of type 3
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Hereditarily retraceable isols
- Game semantics of Martin-Löf type theory
- Totality in arena games
- (Towards a) statistical probabilistic lazy lambda calculus
- Fully abstract normal form bisimulation for call-by-value PCF
- A fully abstract model of PCF based on extended addressing machines
- Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501156)
