Pages that link to "Item:Q4115133"

The following pages link to The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus (Q4115133):

Displayed 50 items.

• Semantic types and approximation for Featherweight Java (Q387991) ‎ (← links)
• Strong normalization from an unusual point of view (Q534700) ‎ (← links)
• Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) ‎ (← links)
• Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) ‎ (← links)
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) ‎ (← links)
• Uniqueness of Scott's reflexive domain in \(P\omega \) (Q672137) ‎ (← links)
• Type inference with recursive types: Syntax and semantics (Q756435) ‎ (← links)
• Semantics of algorithmic languages (Q760200) ‎ (← links)
• Expressive power of typed and type-free programming languages (Q761790) ‎ (← links)
• The insensitivity theorem for nonreducing reflexive types (Q792755) ‎ (← links)
• Parametric \(\lambda \)-theories (Q930867) ‎ (← links)
• The heart of intersection type assignment: Normalisation proofs revisited (Q930869) ‎ (← links)
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) ‎ (← links)
• A characterization of F-complete type assignments (Q1089331) ‎ (← links)
• Recursively defined domains and their induction principles (Q1098615) ‎ (← links)
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) ‎ (← links)
• Substitution revisited (Q1106190) ‎ (← links)
• Polymorphic type inference and containment (Q1110312) ‎ (← links)
• Strictness analysis of the untyped \(\lambda\)-calculus (Q1114667) ‎ (← links)
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) ‎ (← links)
• Full abstraction and limiting completeness in equational languages (Q1121676) ‎ (← links)
• \(\mathbb{T}^\omega\) as a universal domain (Q1132085) ‎ (← links)
• The IO- and OI-hierarchies (Q1161273) ‎ (← links)
• Sequential algorithms on concrete data structures (Q1170880) ‎ (← links)
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) ‎ (← links)
• Intersection types for combinatory logic (Q1199823) ‎ (← links)
• Fully abstract models of typed \(\lambda\)-calculi (Q1249567) ‎ (← links)
• A discrimination algorithm inside \(\lambda -\beta\)-calculus (Q1257009) ‎ (← links)
• Type inference with partial types (Q1318726) ‎ (← links)
• Intersection type assignment systems (Q1350344) ‎ (← links)
• Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) ‎ (← links)
• Intersection types and domain operators (Q1434348) ‎ (← links)
• On the semantics of the call-by-name CPS transform (Q1575687) ‎ (← links)
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) ‎ (← links)
• On infinite \(\eta\)-expansion (Q1598516) ‎ (← links)
• Typing and computational properties of lambda expressions (Q1819575) ‎ (← links)
• Approximation properties of abstract data types (Q1838281) ‎ (← links)
• Normalization, approximation, and semantics for combinator systems (Q1853619) ‎ (← links)
• Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) ‎ (← links)
• The origins of structural operational semantics (Q1878710) ‎ (← links)
• Order-incompleteness and finite lambda reduction models (Q1884896) ‎ (← links)
• Relating graph and term rewriting via Böhm models (Q1924551) ‎ (← links)
• Easiness in graph models (Q2368937) ‎ (← links)
• A class of bounded functions, a database language and an extended lambda calculus (Q2402281) ‎ (← links)
• State-transition machines for lambda-calculus expressions (Q2464714) ‎ (← links)
• State-transition machines, revisited (Q2464722) ‎ (← links)
• Strongly Normalising Cut-Elimination with Strict Intersection Types (Q2842832) ‎ (← links)
• Definability and Full Abstraction (Q2864154) ‎ (← links)
• Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming (Q3007669) ‎ (← links)
• A General Class of Models of $\mathcal{H}^*$ (Q3182956) ‎ (← links)