Intersection types and termination properties

DOI10.3233/FI-2012-775zbMATH Open1266.03024OpenAlexW1898802113MaRDI QIDQ4903718FDOQ4903718

Authors: George Koletsos 

Publication date: 24 January 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2012-775

Recommendations

• Compositional characterisations of \(\lambda\)-terms using intersection types
• scientific article; zbMATH DE number 1759417
• Strong normalization and typability with intersection types
• Intersection types for λGtz-calculus
• Complete restrictions of the intersection type discipline

zbMATH Keywords

conservationlambda-calculusterminationtype assignmentintersection types

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Cited In (15)

• Intersection type assignment systems
• Types by need
• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinitary intersection types as sequences. A new answer to Klop's problem
• Semi-continuous Sized Types and Termination
• Intersection and union types
• Title not available (Why is that?)
• Title not available (Why is that?)
• Disjoint intersection types
• Partial Types and Intervals
• Type assignment and conservation properties
• Reducibility: a ubiquitous method in lambda calculus with intersection types
• Title not available (Why is that?)
• Intersection and singleton type assignment characterizing finite Böhm-trees

This page was built for publication: Intersection types and termination properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903718)