Pages that link to "Item:Q1193654"

The following pages link to Complete restrictions of the intersection type discipline (Q1193654):

Displaying 41 items.

• Semantic types and approximation for Featherweight Java (Q387991) (← links)
• Functional programs as compressed data (Q526441) (← links)
• Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) (← links)
• Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
• The heart of intersection type assignment: Normalisation proofs revisited (Q930869) (← links)
• A domain model characterising strong normalisation (Q958484) (← links)
• Types with intersection: An introduction (Q1201298) (← links)
• Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
• Intersection type assignment systems (Q1350344) (← links)
• Strong normalization for non-structural subtyping via saturated sets (Q1351999) (← links)
• Normalization results for typeable rewrite systems (Q1357006) (← links)
• Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
• Strong normalization through intersection types and memory (Q1744407) (← links)
• Normalization without reducibility (Q1840460) (← links)
• Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
• Intersection and singleton type assignment characterizing finite Böhm-trees (Q1854555) (← links)
• Intersection types for explicit substitutions (Q1887145) (← links)
• Strong normalization and typability with intersection types (Q1924327) (← links)
• Pre-grammars and inhabitation for a subset of rank 2 intersection types (Q2333664) (← links)
• Intersection types and lambda models (Q2369008) (← links)
• Logical equivalence for subtyping object and recursive types (Q2481559) (← links)
• Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
• Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms (Q2811355) (← links)
• Reasoning About Call-by-need by Means of Types (Q2811356) (← links)
• Strongly Normalising Cut-Elimination with Strict Intersection Types (Q2842832) (← links)
• Intersection Typed λ-calculus (Q2842843) (← links)
• Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)
• On Isomorphisms of Intersection Types (Q3540197) (← links)
• A classification of intersection type systems (Q4532620) (← links)
• A resource aware semantics for a focused intuitionistic calculus (Q4559602) (← links)
• (Q4580327) (← links)
• Modularity of termination and confluence in combinations of rewrite systems with λω (Q4630300) (← links)
• Approximation and normalization results for typeable term rewriting systems (Q4645802) (← links)
• (Head-)normalization of typeable rewrite systems (Q5055837) (← links)
• (Q5076058) (← links)
• (Q5089036) (← links)
• Functional Type Assignment for Featherweight Java (Q5410450) (← links)
• (Q5856422) (← links)
• A \(\kappa\)-denotational semantics for map theory in ZFC+SI (Q5906925) (← links)