Efficient and flexible matching of recursive types
type: Item
instance of: scholarly article
title: Efficient and flexible matching of recursive types
zbMATH Open document ID: 1005.68043
author: Jens Palsberg
author: Tian Zhao
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 1853228
MaRDI profile type: Publication
OpenAlex ID: W2033763204
cites work: Q4362968
cites work: Q3024900
cites work: Provable isomorphisms of types
cites work: Using multiset discrimination to solve language processing problems without hashing
cites work: Q3619797
cites work: Q4325974
cites work: Q3922128
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q4365943
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: Efficient recursive subtyping
cites work: A complete inference system for a class of regular behaviours
cites work: From polyvariant flow information to intersection and union types
cites work: Using types as search keys in function libraries
cites work: Retrieving library functions by unifying types modulo linear isomorphism
cites work: Q4282541
cites work: The category of finite sets and Cartesian closed categories
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: Retrieving library identifiers via equational matching of types
DOI: 10.1006/INCO.2001.3090
description: scientific article; zbMATH DE number 1853228