Unification with extended patterns

DOI10.1016/S0304-3975(97)00141-2zbMath0932.68021MaRDI QIDQ1274966

Dominic Duggan

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(\beta_0\pi\)-unification

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

Functions-as-constructors higher-order unification: extended pattern unification ⋮ Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type ⋮ Higher-Order Dynamic Pattern Unification for Dependent Types and Records

Uses Software

• Elf

Cites Work

• Unification under a mixed prefix
• A unification algorithm for typed \(\overline\lambda\)-calculus
• Higher-order substitutions
• Higher-order Horn clauses
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• Explicit substitutions
• Linear unification of higher-order patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unification with extended patterns