Pages that link to "Item:Q1249567"

The following pages link to Fully abstract models of typed \(\lambda\)-calculi (Q1249567):

Displaying 50 items.

• Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
• Linear Läuchli semantics (Q1919529) (← links)
• Projecting sequential algorithms on strongly stable functions (Q1919532) (← links)
• Observational interpretations of hybrid dynamic logic with binders and silent transitions (Q1979970) (← links)
• Algorithm design through the optimization of reuse-based generation (Q1980486) (← links)
• Processes against tests: on defining contextual equivalences (Q2079681) (← links)
• Complete trace models of state and control (Q2233464) (← links)
• Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
• Observational program calculi and the correctness of translations (Q2339472) (← links)
• Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
• Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197) (← links)
• A trace-based service semantics guaranteeing deadlock freedom (Q2428498) (← links)
• Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
• A stable programming language (Q2492185) (← links)
• Asynchronous games. II: The true concurrency of innocence (Q2503039) (← links)
• A relational account of call-by-value sequentiality (Q2506495) (← links)
• A domain equation for bisimulation (Q2639646) (← links)
• Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
• (Q2851048) (← links)
• Definability and Full Abstraction (Q2864154) (← links)
• Continuity in Semantic Theories of Programming (Q2963952) (← links)
• Modular Verification of Procedure Equivalence in the Presence of Memory Allocation (Q2988675) (← links)
• European Summer Meeting of the Association for Symbolic Logic, Hull, 1986 (Q3030791) (← links)
• Full Abstraction at Package Boundaries of Object-Oriented Languages (Q3098051) (← links)
• Applicative Bisimulation and Quantum λ-Calculi (Q3455863) (← links)
• Formal Analysis of Dynamic, Distributed File-System Access Controls (Q3613061) (← links)
• (Q3662598) (← links)
• (Q3912568) (← links)
• Functions as processes (Q4017458) (← links)
• (Q4222750) (← links)
• Fully abstract translations between functional languages (Q4286526) (← links)
• (Q4499206) (← links)
• (Q4513578) (← links)
• Game theoretic analysis of call-by-value computation (Q4571955) (← links)
• (Q4585074) (← 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)
• Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages (Q4728280) (← links)
• Note on Algol and conservatively extending functional programming (Q4880529) (← links)
• (Modular) Effect Algebras are Equivalent to (Frobenius) Antispecial Algebras (Q5014788) (← links)
• (Q5028431) (← links)
• Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)
• On abstraction and the expressive power of programming languages (Q5096222) (← links)
• Stable bistructure models of PCF (Q5096876) (← links)
• Normal forms, linearity, and prime algebraicity over nonflat domains (Q5109211) (← links)
• A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
• Sequentiality and the CPS Semantics of Fresh Names (Q5262939) (← links)
• Reasoning about multi-stage programs (Q5371979) (← links)
• (Q5376659) (← links)
• (Q5377471) (← links)