Generalized filter models
| Autor: | Maddalena Zacchi, Ines Margaria |
|---|---|
| Rok vydání: | 2000 |
| Předmět: |
Discrete mathematics
Soundness Mathematical logic General Computer Science Type assignment Intersection (set theory) Generalization Infimum and supremum Domain (mathematical analysis) Theoretical Computer Science Combinatorics Completeness (order theory) λ-Calculus λ-Models Filter (mathematics) Computer Science(all) Mathematics |
| Zdroj: | Theoretical Computer Science. 238:363-387 |
| ISSN: | 0304-3975 |
| DOI: | 10.1016/s0304-3975(99)00083-3 |
| Popis: | In this paper, starting from filters which are a natural generalization of intersection filters (Barendregt et al., J. Symbolic Logic 48 (1983) 931–940), the existence of filter models and filter semimodels for the λ -calculus is investigated. The construction of filters is based on a Z-semilattice of types in which the subsets having infimum are given by a collection Z, called subset system. The set of representable functions is characterized in the obtained domain. In the case where the properties of the subset system Z guarantee the existence of a filter model, the proof of soundness and completeness of the associated natural Z-type assignment system is routine. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect