<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://biblioteca.universia.net/searchAutor.do?q=Hindley,%20J.%20Roger">
    <title>Resultados de la búsqueda: Hindley, J. Roger</title>
    <link>http://biblioteca.universia.net/searchAutor.do?q=Hindley,%20J.%20Roger</link>
    <description>Resultados 1 - 3 de 3 de Hindley, J. Roger. (0,11 segundos)</description>
    <items>
      <rdf:Seq>
        <rdf:li />
        <rdf:li />
        <rdf:li />
      </rdf:Seq>
    </items>
    <dc:language>es</dc:language>
  </channel>
  <image>
    <title>Universia-Recursos de Aprendizaje</title>
    <url>http://biblioteca.universia.net/img/logotipo.jpg</url>
    <link>http://biblioteca.universia.net/</link>
  </image>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=980008">
    <title>BCK and BCI logics, condensed detachment and the $2$-property.</title>
    <link>http://biblioteca.universia.net/ficha.do?id=980008</link>
    <dc:creator>Hindley, J. Roger</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=37474763">
    <title>Principal Type-Schemes and Condensed Detachment</title>
    <link>http://biblioteca.universia.net/ficha.do?id=37474763</link>
    <dc:creator>Hindley, J. Roger; Meredith, David</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=37474634">
    <title>On Adding $(\xi)$ to Weak Equality in Combinatory Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=37474634</link>
    <description>Because the main difference between combinatory weak equality and $\lambda\beta$-equality is that the rule \begin{equation*}\tag{\xi} X = Y \vdash \lambda x.X = \lambda x.Y\end{equation*} is valid for the latter but not the former, it is easy to assume that another way of defining combinatory $\beta$-equality is to add rule $(\xi)$ to the postulates for weak equality. However, to make this true, one must choose the definition of combinatory abstraction in $(\xi)$ very carefully. If one tries ...</description>
    <dc:creator>Bunder, Martin W.; Hindley, J. Roger; Seldin, Jonathan P.</dc:creator>
  </item>
</rdf:RDF>


