Efficient and flexible matching of recursive types

DOI10.1006/INCO.2001.3090MaRDI QIDQ1854490zbMATH OpenOpenAlexFDO

Authors Jens Palsberg, Tian Zhao

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/67580e7111a19aef2afd626433f2b911cd0da7b6

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 2087431
• Efficient recursive subtyping
• Efficient algorithms for isomorphisms of simple types
• Numbering matters
• Recursive subtyping revealed (functional pearl)

Cites work

• A complete inference system for a class of regular behaviours
• A completeness theorem for Kleene algebras and the algebra of regular events
• A lattice-theoretical fixpoint theorem and its applications
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Efficient recursive subtyping
• From polyvariant flow information to intersection and union types
• scientific article; zbMATH DE number 2185708 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3735091 (Why is no real title available?)
• scientific article; zbMATH DE number 517016 (Why is no real title available?)
• scientific article; zbMATH DE number 733666 (Why is no real title available?)
• scientific article; zbMATH DE number 1086719 (Why is no real title available?)
• scientific article; zbMATH DE number 1089242 (Why is no real title available?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Provable isomorphisms of types
• Retrieving library functions by unifying types modulo linear isomorphism
• Retrieving library identifiers via equational matching of types
• The category of finite sets and Cartesian closed categories
• Using multiset discrimination to solve language processing problems without hashing
• Using types as search keys in function libraries

Cited in

(10)

• Type soundness for path polymorphism
• Typed path polymorphism
• Recursive subtyping revealed (functional pearl)
• On the building of affine retractions
• Efficient type checking for path polymorphism
• scientific article; zbMATH DE number 2087431 (Why is no real title available?)
• Efficient recursive subtyping
• Selective Memoization with Box Types
• Typed Lambda Calculi and Applications
• Decidability properties of recursive types.

This page was built for publication: Efficient and flexible matching of recursive types

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