Nominal essential intersection types
DOI10.1016/j.tcs.2018.05.008zbMath1395.68081OpenAlexW2799869123WikidataQ58001375 ScholiaQ58001375MaRDI QIDQ1643145
Mauricio Ayala-Rincón, Daniel Lima Ventura, Ana Cristina Rocha-Oliveira, Maribel Fernández
Publication date: 18 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://kclpure.kcl.ac.uk/portal/en/publications/nominal-essential-intersection-types(30c5ff40-1545-454f-b8c3-ad59705cc235).html
Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dependent type theory with abstractable names
- A completeness result for a realisability semantics for an intersection type system
- A unification algorithm for typed \(\overline\lambda\)-calculus
- Intersection type assignment systems
- Normalization results for typeable rewrite systems
- Higher order unification via explicit substitutions
- Nominal unification
- Principality and type inference for intersection types using expansion variables
- Intersection types for explicit substitutions
- Nominal logic, a first order theory of names and binding
- Nominal rewriting
- Unification via the se-style of explicit substitutions
- A Simple Nominal Type Theory
- Non-idempotent intersection types and strong normalisation
- Strict intersection types for the Lambda Calculus
- Elaborating intersection and union types
- A dependent nominal type theory
- On projecting processes into session types
- Principal Types for Nominal Theories
- Intersection Types for the Resource Control Lambda Calculi
- Quantitative Types for the Linear Substitution Calculus
- A new type assignment for λ-terms
- A filter lambda model and the completeness of type assignment
- Curry-Style Types for Nominal Terms
- Functional Characters of Solvable Terms
- Typed Nominal Rewriting
- Explicit substitution calculi with de Bruijn indices and intersection type systems
- Characterising Strongly Normalising Intuitionistic Terms
- Strong Normalization in the π-calculus with Intersection and Union Types
- Dependent Types for Nominal Terms with Atom Substitutions
- (Nominal) Unification by Recursive Descent with Triangular Substitutions
This page was built for publication: Nominal essential intersection types
