Pages that link to "Item:Q1134141"

The following pages link to An extension of basic functionality theory for \(\lambda\)-calculus (Q1134141):

Displayed 45 items.

• Strong normalization from an unusual point of view (Q534700) ‎ (← links)
• Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) ‎ (← links)
• Higher-order subtyping and its decidability (Q598199) ‎ (← links)
• Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) ‎ (← links)
• Intersection type assignment systems with higher-order algebraic rewriting (Q672048) ‎ (← links)
• A completeness result for a realisability semantics for an intersection type system (Q882122) ‎ (← links)
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) ‎ (← links)
• On strong normalization and type inference in the intersection type discipline (Q930868) ‎ (← links)
• The heart of intersection type assignment: Normalisation proofs revisited (Q930869) ‎ (← links)
• Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage (Q930871) ‎ (← links)
• An irregular filter model (Q930872) ‎ (← links)
• A type assignment system for game semantics (Q930873) ‎ (← links)
• A characterization of F-complete type assignments (Q1089331) ‎ (← links)
• Principal type scheme and unification for intersection type discipline (Q1110311) ‎ (← links)
• Complete restrictions of the intersection type discipline (Q1193654) ‎ (← links)
• Types with intersection: An introduction (Q1201298) ‎ (← links)
• Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368) ‎ (← links)
• Combining type disciplines (Q1319505) ‎ (← links)
• \(F\)-semantics for type assignment systems (Q1329739) ‎ (← links)
• Proof-functional connectives and realizability (Q1330311) ‎ (← links)
• Intersection type assignment systems (Q1350344) ‎ (← links)
• Normalization results for typeable rewrite systems (Q1357006) ‎ (← links)
• Intersection types and domain operators (Q1434348) ‎ (← links)
• Generalized filter models (Q1575259) ‎ (← links)
• Typing and computational properties of lambda expressions (Q1819575) ‎ (← links)
• Dependent types with subtyping and late-bound overloading (Q1854436) ‎ (← links)
• Principality and type inference for intersection types using expansion variables (Q1884929) ‎ (← links)
• Intersection types for explicit substitutions (Q1887145) ‎ (← links)
• Intersection-types à la Church (Q2381503) ‎ (← links)
• Weak linearization of the lambda calculus (Q2566028) ‎ (← links)
• Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) ‎ (← links)
• Easy lambda-terms are not always simple (Q2889181) ‎ (← links)
• Finite Combinatory Logic with Intersection Types (Q3007665) ‎ (← links)
• A Filter Model for the λμ-Calculus (Q3007668) ‎ (← links)
• Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming (Q3007669) ‎ (← links)
• Intersection Types for the Resource Control Lambda Calculi (Q3105748) ‎ (← links)
• A Datalog Recognizer for Almost Affine λ-CFGs (Q3172825) ‎ (← links)
• Graph lambda theories (Q3535680) ‎ (← links)
• On Isomorphisms of Intersection Types (Q3540197) ‎ (← links)
• Inhabitation of Low-Rank Intersection Types (Q3637206) ‎ (← links)
• Effective λ-models versus recursively enumerable λ-theories (Q3643360) ‎ (← links)
• Intersection, Universally Quantified, and Reference Types (Q3644750) ‎ (← links)
• The emptiness problem for intersection types (Q4934035) ‎ (← links)
• Recursive Domain Equations of Filter Models (Q5448641) ‎ (← links)
• Strictness, totality, and non-standard-type inference (Q5958293) ‎ (← links)