Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models
From MaRDI portal
Publication:5958296
DOI10.1016/S0304-3975(00)00351-0zbMath0984.68026MaRDI QIDQ5958296
Hajime Ishihara, Toshihiko Kurata
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Precise subtyping for synchronous multiparty sessions ⋮ Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) ⋮ On the Values of Reducibility Candidates
Cites Work
- Polymorphic type inference and containment
- Constructivism in mathematics. An introduction. Volume I
- The semantics of entailment. III
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Singleton, union, and intersection types for program extraction
- A semantics for static type inference
- Intersection and union types: Syntax and semantics
- Duality for algebras of relevant logics
- A filter lambda model and the completeness of type assignment
- An ideal model for recursive polymorphic types
- Functional Characters of Solvable Terms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
