Pages that link to "Item:Q1261291"

The following pages link to Full abstraction in the lazy lambda calculus (Q1261291):

Displaying 50 items.

• Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax (Q438569) (← links)
• Strong normalization from an unusual point of view (Q534700) (← links)
• A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
• An abstract framework for environment machines (Q804281) (← links)
• A logical approach to stable domains (Q859843) (← links)
• Parametric \(\lambda \)-theories (Q930867) (← links)
• An irregular filter model (Q930872) (← links)
• On the observational theory of the CPS-calculus (Q968276) (← links)
• Applications of infinitary lambda calculus (Q1021568) (← links)
• Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs (Q1098614) (← links)
• A lambda-calculus for dynamic binding (Q1127514) (← links)
• A calculus of mobile processes. I (Q1198548) (← links)
• Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
• Semantical analysis of perpetual strategies in \(\lambda\)-calculus (Q1275628) (← links)
• A co-induction principle for recursively defined domains (Q1318702) (← links)
• The lazy lambda calculus in a concurrency scenario (Q1327395) (← links)
• A first order logic of effects (Q1390955) (← links)
• Infinitary lambda calculus (Q1392145) (← links)
• Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
• Domain theory for concurrency (Q1434357) (← links)
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
• A fully abstract denotational semantics for the \(\pi\)-calculus (Q1605174) (← links)
• Game semantics and linear CPS interpretation (Q1770417) (← links)
• Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
• Descendants and origins in term rewriting. (Q1854348) (← links)
• Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
• Games characterizing Levy-Longo trees (Q1884875) (← links)
• Adapting innocent game models for the Böhm tree \(\lambda\)-theory (Q1884886) (← links)
• Parametric parameter passing \(\lambda\)-calculus (Q1887148) (← links)
• Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
• Proving soundness of extensional normal-form bisimilarities (Q2130582) (← links)
• The untyped computational \(\lambda \)-calculus and its intersection type discipline (Q2210507) (← links)
• Proof, meaning and paradox: some remarks (Q2288280) (← links)
• Observational program calculi and the correctness of translations (Q2339472) (← links)
• Intersection types and lambda models (Q2369008) (← links)
• A class of bounded functions, a database language and an extended lambda calculus (Q2402281) (← links)
• Logical equivalence for subtyping object and recursive types (Q2481559) (← links)
• Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
• Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
• Program equivalence in an untyped, call-by-value functional language with uncurried functions (Q2693299) (← links)
• On the characterization of models of \(\mathcal H^\ast\): the semantical aspect (Q2804203) (← links)
• Logical semantics for stability (Q2805169) (← links)
• Developing (meta)theory of \(\lambda\)-calculus in the theory of contexts (Q2841233) (← links)
• Comparing higher-order encodings in logical frameworks and tile logic (Q2841275) (← links)
• A fully abstract model for mobile ambients (Q2841277) (← links)
• Simple easy terms (Q2842831) (← links)
• Lazy logical semantics (Q2847789) (← links)
• Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings (Q2958387) (← links)
• Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion (Q3166224) (← links)