scientific article; zbMATH DE number 7559294
From MaRDI portal
Publication:5089030
DOI10.4230/LIPIcs.FSCD.2019.28MaRDI QIDQ5089030
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1803.09660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Cut-elimination in the strict intersection type assignment system is strongly normalizing
- Coppo-Dezani types do not correspond to propositional logic
- The completeness of provable realizability
- A typed lambda calculus with intersection types
- An extension of basic functionality theory for \(\lambda\)-calculus
- Inheritance as implicit coercion
- Proof-functional connectives and realizability
- A decidable subtyping logic for intersection and union types
- Principality and type inference for intersection types using expansion variables
- Intersection types and lambda models
- Intersection-types à la Church
- Elaborating intersection and union types
- The Complexity of Inhabitation with Explicit Intersection
- Logic and Computation in a Lambda Calculus with Intersection and Union Types
- A Realizability Interpretation for Intersection and Union Types
- A filter lambda model and the completeness of type assignment
- Semantic subtyping
- Functional Characters of Solvable Terms
- A framework for defining logics
- Intersection Types as Logical Formulae
- Intersection types and λ-definability
- A calculus with polymorphic and polyvariant flow types
- Intersection Types from a Proof-theoretic Perspective
- Hyperformulae, Parallel Deductions and Intersection Types
- The emptiness problem for intersection types
- Parallel reductions in \(\lambda\)-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
