Unification of higher-order patterns in linear time and space

DOI10.1093/LOGCOM/6.3.315zbMATH Open0863.68074OpenAlexW2067330580MaRDI QIDQ4885622FDOQ4885622

Authors:

Publication date: 22 May 1997

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/6.3.315

Recommendations

• Linear unification of higher-order patterns
• Publication:4954009
• Higher-order pattern anti-unification in linear time
• Two thoughts on higher-order unification -- most relevant unifiers and unification with case distinction
• Modular AC unification of higher-order patterns

zbMATH Keywords

unification algorithmhigher-order unificationcomplexity of unificationDAG representation of terms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Cited In (15)

• Title not available (Why is that?)
• Existential type systems between Church and Curry style (type-free style)
• Higher-order pattern anti-unification in linear time
• Matching and alpha-equivalence check for nominal terms
• A variant of higher-order anti-unification
• Nominal Unification from a Higher-Order Perspective
• A polynomial nominal unification algorithm
• Optimizing higher-order pattern unification.
• Implementing nominal unification
• Linear unification of higher-order patterns
• Nominal unification
• Two thoughts on higher-order unification -- most relevant unifiers and unification with case distinction
• The First-Order Nominal Link
• Modular AC unification of higher-order patterns
• Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type

This page was built for publication: Unification of higher-order patterns in linear time and space

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