Efficient and flexible matching of recursive types

DOI10.1006/inco.2001.3090zbMath1005.68043OpenAlexW2033763204MaRDI QIDQ1854490

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)

Related Items (4)

Typed path polymorphism ⋮ On the building of affine retractions ⋮ Type soundness for path polymorphism ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using multiset discrimination to solve language processing problems without hashing
• A complete inference system for a class of regular behaviours
• A completeness theorem for Kleene algebras and the algebra of regular events
• The category of finite sets and Cartesian closed categories
• A lattice-theoretical fixpoint theorem and its applications
• From Polyvariant flow information to intersection and union types
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Provable isomorphisms of types
• Retrieving library functions by unifying types modulo linear isomorphism
• Efficient recursive subtyping
• Using types as search keys in function libraries
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

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