A characterization of F-complete type assignments
From MaRDI portal
DOI10.1016/0304-3975(86)90043-5zbMATH Open0619.03014OpenAlexW2091240930MaRDI QIDQ1089331FDOQ1089331
Recommendations
Cites work
- scientific article; zbMATH DE number 3889502 (Why is no real title available?)
- scientific article; zbMATH DE number 3880074 (Why is no real title available?)
- scientific article; zbMATH DE number 3811535 (Why is no real title available?)
- scientific article; zbMATH DE number 3813583 (Why is no real title available?)
- scientific article; zbMATH DE number 3829227 (Why is no real title available?)
- scientific article; zbMATH DE number 3930968 (Why is no real title available?)
- scientific article; zbMATH DE number 3700185 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3349775 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- A filter lambda model and the completeness of type assignment
- A new type assignment for λ-terms
- A theory of type polymorphism in programming
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- An extension of basic functionality theory for \(\lambda\)-calculus
- Combinators, \(\lambda\)-terms and proof theory
- Combinatory logic. Vol. II
- Completeness of type assignment in continuous lambda models
- Curry's type-rules are complete with respect to the F-semantics too
- Data Types as Lattices
- Functional Characters of Solvable Terms
- Intensional interpretations of functionals of finite type I
- Lambda‐Calculus Models and Extensionality
- On the semantics of polymorphism
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The Expressiveness of Simple and Second-Order Type Structures
- The Principal Type-Scheme of an Object in Combinatory Logic
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- The completeness theorem for typing lambda-terms
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
Cited in
(16)
- Type inference, abstract interpretation and strictness analysis
- Complete restrictions of the intersection type discipline
- Intersection type assignment systems
- \(F\)-semantics for type assignment systems
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Typed operational semantics for higher-order subtyping.
- Title not available (Why is no real title available?)
- A complete characterization of complete intersection-type preorders
- Title not available (Why is no real title available?)
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
- Types with intersection: An introduction
- The completeness of typing for context-semantics
- A filter lambda model and the completeness of type assignment
- Generalized filter models
- Cut-elimination in the strict intersection type assignment system is strongly normalizing
- Discrimination by parallel observers: the algorithm.
This page was built for publication: A characterization of F-complete type assignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089331)
