Intersection types for unboundedness problems

MaRDI QIDQ5076057zbMATH OpenFDO

Authors Paweł Parys

Publication date 12 May 2022

Full work available at URL https://arxiv.org/abs/1904.10105, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ITRS2018.2

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 512791
• Bounding normalization time through intersection types
• A tale of intersection types
• Intersection types and termination properties
• Intersection and singleton type assignment characterizing finite Böhm-trees

Cites work

• A characterization of lambda-terms transforming numerals
• A Note on Decidable Separability by Piecewise Testable Languages
• A Saturation Method for Collapsible Pushdown Systems
• A type-directed abstraction refinement approach to higher-order model checking
• An approach to computing downward closures
• Deciding piecewise testable separability for regular tree languages
• Finitary semantics of linear logic and higher-order model-checking
• Homogeneity without loss of generality
• scientific article; zbMATH DE number 2087432 (Why is no real title available?)
• Model checking higher-order programs
• On the significance of the collapse operation
• On word and frontier languages of unsafe higher-order grammars
• Ordered tree-pushdown systems
• Pumping by typing
• Pumping Lemma for Higher-order Languages
• Recursion schemes and the WMSO+U logic
• Regular cost functions. I: Logic and algebra over words
• Relational semantics of linear logic and higher-order model checking
• Saturation-Based Model Checking of Higher-Order Recursion Schemes.
• Strictness of the collapsible pushdown hierarchy
• The Complexity of the Diagonal Problem for Recursion Schemes
• The diagonal problem for higher-order recursion schemes is decidable
• The IO- and OI-hierarchies
• Two-way cost automata and cost logics over infinite trees
• Unsafe order-2 tree languages are context-sensitive

Cited in

(4)

• Approximation theorems for intersection type systems
• Disjoint intersection types
• Untyped Recursion Schemes and Infinite Intersection Types
• A quantitative version of simple types

This page was built for publication: Intersection types for unboundedness problems

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