Pages that link to "Item:Q1854393"

The following pages link to On full abstraction for PCF: I, II and III (Q1854393):

Displaying 50 items.

• Simply typed fixpoint calculus and collapsible pushdown automata (Q2973243) (← links)
• Block structure vs scope extrusion: between innocence and omniscience (Q2974774) (← links)
• From Qualitative to Quantitative Semantics (Q2988359) (← links)
• A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus (Q2988382) (← links)
• ML and Extended Branching VASS (Q2988645) (← links)
• Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus (Q3007657) (← links)
• A Fragment of ML Decidable by Visibly Pushdown Automata (Q3012916) (← links)
• The structure of first-order causality (Q3081323) (← links)
• Categorical Models of Syntactic Control of Intereference Revisited, Revisited (Q3091944) (← links)
• Understanding Game Semantics Through Coherence Spaces (Q3178256) (← links)
• Geometry of Synthesis II: From Games to Delay-Insensitive Circuits (Q3178261) (← links)
• Game Semantics in the Nominal Model (Q3178282) (← links)
• A System-Level Game Semantics (Q3178283) (← links)
• A Graphical Foundation for Schedules (Q3178289) (← links)
• The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms (Q3298274) (← links)
• (Q3384159) (← links)
• Games for Dependent Types (Q3449463) (← links)
• Curry-style type isomorphisms and game semantics (Q3520148) (← links)
• Least and Greatest Fixpoints in Game Semantics (Q3617718) (← links)
• Full Abstraction for Reduced ML (Q3617719) (← links)
• On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (Q3617724) (← links)
• Compositional Predicate Abstraction from Game Semantics (Q3617753) (← links)
• On the Meaning of Logical Completeness (Q3637186) (← links)
• Partial Orders, Event Structures and Linear Strategies (Q3637188) (← links)
• A Process-Model for Linear Programs (Q3638259) (← links)
• Full abstraction, totality and PCF (Q4237906) (← links)
• (Q4281476) (← links)
• Order algebras: a quantitative model of interaction (Q4577983) (← links)
• (Q4585074) (← links)
• On naturally continuous non-dcpo domains (Q4593242) (← links)
• A correspondence between maximal abelian sub-algebras and linear logic fragments (Q4599613) (← links)
• Mackey-complete spaces and power series – a topological model of differential linear logic (Q4606699) (← links)
• The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ (Q4637682) (← links)
• Symmetry and Interactivity in Programming (Q4650295) (← links)
• Regular-Language Semantics for a Call-by-Value Programming Language (Q4917052) (← links)
• A Game Semantics of Idealized CSP (Q4917059) (← links)
• Payoffs, Intensionality and Abstraction in Games (Q4922074) (← links)
• Towards Nominal Abramsky (Q4922085) (← links)
• GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION (Q4977225) (← links)
• Dynamic game semantics (Q4988428) (← links)
• The geometry of Bayesian programming (Q5076392) (← links)
• (Q5079740) (← links)
• (Q5079748) (← links)
• (Q5089267) (← links)
• (Q5091106) (← links)
• Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)
• (Q5111308) (← links)
• Logic and Geometry of Agents in Agent-Based Modeling (Q5150306) (← links)
• Monoidal-closed categories of tree automata (Q5220183) (← links)
• Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness (Q5262979) (← links)