Pages that link to "Item:Q3335753"
From MaRDI portal
The following pages link to A filter lambda model and the completeness of type assignment (Q3335753):
Displayed 50 items.
- Graph easy sets of mute lambda terms (Q288793) (← links)
- Semantic types and approximation for Featherweight Java (Q387991) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Preface to the special volume (Q534064) (← 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)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Higher-order subtyping and its decidability (Q598199) (← links)
- Ternary relations and relevant semantics (Q598309) (← links)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
- Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- Coppo-Dezani types do not correspond to propositional logic (Q787128) (← links)
- Principal type schemes for an extended type theory (Q790801) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result (Q809993) (← 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)
- A typed lambda calculus with intersection types (Q930870) (← 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 domain model characterising strong normalisation (Q958484) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Principal type scheme and unification for intersection type discipline (Q1110311) (← links)
- Polymorphic type inference and containment (Q1110312) (← 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)
- Domain theory in logical form (Q1174593) (← links)
- Implementing the `Fool's model' of combinatory logic (Q1181718) (← links)
- Filter models with polymorphic types (Q1186431) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Intersection types for combinatory logic (Q1199823) (← links)
- Types with intersection: An introduction (Q1201298) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- From constructivism to computer science (Q1274450) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus (Q1275628) (← links)
- Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- An algebraic semantics of higher-order types with subtypes (Q1323318) (← links)
- \(F\)-semantics for type assignment systems (Q1329739) (← links)