On full abstraction for PCF: I, II and III
From MaRDI portal
Publication:1854393
DOI10.1006/inco.2000.2917zbMath1006.68027OpenAlexW2024189573MaRDI QIDQ1854393
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.2000.2917
Applications of game theory (91A80) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40) Enriched categories (over closed or monoidal categories) (18D20)
Related Items
Characteristic bisimulation for higher-order session processes, On concurrent games with payoff, The category of node-and-choice preforms for extensive-form games, Computation by interaction for space-bounded functional programming, A Semantical Approach to Equilibria and Rationality, Comparing hierarchies of types in models of linear logic, Modular strategies for recursive game graphs, Games characterizing Levy-Longo trees, Adapting innocent game models for the Böhm tree \(\lambda\)-theory, Polarized games, An approach to deciding the observational equivalence of Algol-like languages, Continuous probability distributions in concurrent games, Game semantics for constructive modal logic, Game semantics for dependent types, Realizability for Peano arithmetic with winning conditions in HON games, Semantics of higher-order quantum computation via geometry of interaction, Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects, Game semantics approach to higher-order complexity, Strong normalisation in the \(\pi\)-calculus, A game-theoretic framework for specification and verification of cryptographic protocols, An observationally complete program logic for imperative higher-order functions, Imperative programs as proofs via game semantics, Full abstraction for Reduced ML, A game semantics for disjunctive logic programming, Verifying annotated program families using symbolic game semantics, Multigames and strategies, coalgebraically, Glueing and orthogonality for models of linear logic, Exhausting strategies, joker games and full completeness for IMLL with unit, Latent semantic analysis of game models using LSTM, An approach to innocent strategies as graphs, Deterministic concurrent strategies, A synthetic theory of sequential domains, Continuity in Semantic Theories of Programming, Aristotle on Universal Quantification: A Study from the Point of View of Game Semantics, Constructive semantics for instantaneous reactions, A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus, Resource modalities in tensor logic, Proof and refutation in MALL as a game, Totality in arena games, Games with 1-backtracking, The relational model is injective for multiplicative exponential linear logic (without weakenings), Simply typed fixpoint calculus and collapsible pushdown automata, Game-theoretic analysis of call-by-value computation, Program equivalence in a simple language with state, Weighted models for higher-order computation, Program verification using symbolic game semantics, Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases, A graphical foundation for interleaving in game semantics, On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras, Complete trace models of state and control, Bayesian strategies: probabilistic programs as generalised graphical models, Classical realizability in the CPS target language, Third-order Idealized Algol with iteration is decidable, Algorithmic probabilistic game semantics. Playing games with automata, Angelic semantics of fine-grained concurrency, Second-order type isomorphisms through game semantics, A game semantics of names and pointers, Infinite trace equivalence, Combinatorial structure of type dependency, Preface to the special volume, Computational ludics, Decidability and syntactic control of interference, Unnamed Item, Probabilistic coherence spaces as a model of higher-order probabilistic computation, An exact correspondence between a typed pi-calculus and polarised proof-nets, Game semantics and linear CPS interpretation, A stable programming language, Linear realizability and full completeness for typed lambda-calculi, A fully abstract may testing semantics for concurrent objects, Interaction graphs: multiplicatives, Asynchronous games. II: The true concurrency of innocence, A relational account of call-by-value sequentiality, Linearity and bisimulation, Classical By-Need, Toward the interpretation of non-constructive reasoning as non-monotonic learning, Game Semantics for Access Control, An Algebraic Account of References in Game Semantics, Operational domain theory and topology of sequential programming languages, Natural non-dcpo domains and f-spaces, From Hilbert's program to a logic tool box, The extensional ordering of the sequential functionals, A game-semantic model of computation, From Parity Games to Circular Proofs, A Categorical Semantics of Higher Order Store, Adjunction Models For Call-By-Push-Value With Stacks, Parallel and serial hypercoherences, Syntax vs. semantics: A polarized approach, Games for complexity of second-order call-by-name programs, Sequential algorithms and strongly stable functions, The sequentially realizable functionals, Genericity and the \(\pi\)-calculus, Games and full abstraction for FPC., Definability and Full Abstraction, Program equivalence in linear contexts, A Quantum Game Semantics for the Measurement Calculus, Probabilistic π-Calculus and Event Structures, Denotational fixed-point semantics for constructive scheduling of synchronous concurrency, Relative definability of boolean functions via hypergraphs, Syntactic control of concurrency, A calculus of coroutines, Games for Dependent Types, Understanding Game Semantics Through Coherence Spaces, Geometry of Synthesis II: From Games to Delay-Insensitive Circuits, Game Semantics in the Nominal Model, A System-Level Game Semantics, A Graphical Foundation for Schedules, The geometry of Bayesian programming, Order algebras: a quantitative model of interaction, On naturally continuous non-dcpo domains, Streams of approximations, equivalence of recursive effectful programs, Smart Choices and the Selection Monad, Arboreal Categories: An Axiomatic Theory of Resources, A correspondence between maximal abelian sub-algebras and linear logic fragments, Game semantics of Martin-Löf type theory, Mackey-complete spaces and power series – a topological model of differential linear logic, Curry-style type isomorphisms and game semantics, Block structure vs scope extrusion: between innocence and omniscience, Unnamed Item, Unnamed Item, From Qualitative to Quantitative Semantics, A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus, ML and Extended Branching VASS, The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms, Logic and Geometry of Agents in Agent-Based Modeling, Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus, A Fragment of ML Decidable by Visibly Pushdown Automata, Symmetry and Interactivity in Programming, Regular-Language Semantics for a Call-by-Value Programming Language, A Game Semantics of Idealized CSP, Global State Considered Helpful, Payoffs, Intensionality and Abstraction in Games, Towards Nominal Abramsky, On the reification of semantic linearity, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Innocent game models of untyped \(\lambda\)-calculus, Finitary PCF is not decidable, Free \(\mu\)-lattices, On Natural Non-dcpo Domains, Least and Greatest Fixpoints in Game Semantics, Full Abstraction for Reduced ML, On Global Model Checking Trees Generated by Higher-Order Recursion Schemes, Compositional Predicate Abstraction from Game Semantics, On-the-Fly Techniques for Game-Based Software Model Checking, A Theory for Game Theories, Unnamed Item, Unnamed Item, The structure of first-order causality, Monoidal-closed categories of tree automata, Epistemic Strategies and Games on Concurrent Processes, On the Meaning of Logical Completeness, Partial Orders, Event Structures and Linear Strategies, Categorical Models of Syntactic Control of Intereference Revisited, Revisited, An Explicit Framework for Interaction Nets, A Process-Model for Linear Programs, Unnamed Item, GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION, Computing with Functionals—Computability Theory or Computer Science?, Dynamic game semantics, The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$, Denotational Semantics with Nominal Scott Domains, Towards Ludics Programming: Interactive Proof Search, Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness, Infinitary affine proofs
Cites Work
