<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-23T00:29:26Z</responseDate>
  <request identifier="5981" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:5981</identifier>
        <datestamp>2024-03-06T10:37:26Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Functions-as-Constructors Higher-Order Unification</dc:title>
          <dc:creator>Libal, Tomer</dc:creator>
          <dc:creator>Miller, Dale</dc:creator>
          <dc:subject>higher-order unification</dc:subject>
          <dc:subject>pattern unification</dc:subject>
          <dc:description>Unification is a central operation in the construction of a range of&#13;
computational logic systems based on first-order and higher-order&#13;
logics.  First-order unification has a number of properties that&#13;
dominates the way it is incorporated within such systems.  In&#13;
particular, first-order unification is decidable, unary, and can be&#13;
performed on untyped term structures.  None of these three properties&#13;
hold for full higher-order unification: unification is undecidable,&#13;
unifiers can be incomparable, and term-level typing can dominate the&#13;
search for unifiers.  The so-called pattern subset of&#13;
higher-order unification was designed to be a small extension to&#13;
first-order unification that respected the basic laws governing&#13;
lambda-binding (the equalities of alpha, beta, and&#13;
eta-conversion) but which also satisfied those three properties.&#13;
While the pattern fragment of higher-order unification has been&#13;
popular in various implemented systems and in various theoretical&#13;
considerations, it is too weak for a number of applications.  In this&#13;
paper, we define an extension of pattern unification that is motivated&#13;
by some existing applications and which satisfies these three&#13;
properties.  The main idea behind this extension is that the arguments&#13;
to a higher-order, free variable can be more than just distinct bound&#13;
variables: they can also be terms constructed from (sufficient numbers&#13;
of) such variables using term constructors and where no argument is a&#13;
subterm of any other argument.  We show that this extension to pattern&#13;
unification satisfies the three properties mentioned above.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Tomer Libal and Dale Miller</dc:contributor>
          <dc:date>2016</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 52, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.FSCD.2016.26</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-59810</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.26</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
