<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01423nam a2200265 a 4500</leader>
  <controlfield tag="001">vtls000072251</controlfield>
  <controlfield tag="003">KUKTEM</controlfield>
  <controlfield tag="005">20251125095405.0</controlfield>
  <controlfield tag="008">130618t2012    enk    f      001 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9780521879408 (hardback)</subfield>
  </datafield>
  <datafield tag="039" ind1=" " ind2="9">
    <subfield code="a">201401221058</subfield>
    <subfield code="b">saini</subfield>
    <subfield code="y">201306181604</subfield>
    <subfield code="z">sri</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMP</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">QA76.63 .M55 2012</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Miller, Dale</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Programming with higher-order logic /</subfield>
    <subfield code="c">Dale Miller, Gopalan Nadathur</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Cambridge :</subfield>
    <subfield code="b">Cambridge University Press,</subfield>
    <subfield code="c">2012</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xiii, 306 p. ;</subfield>
    <subfield code="c">24 cm.</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references and index</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">Machine generated contents note: 1. First-order terms and representations of data; 2. First-order horn clauses; 3. First-order hereditary Harrop formulas; 4. Typed lambda-terms and formulas; 5. Using quantification at higher-order types; 6. Mechanisms for structuring large programs; 7. Computations over [lambda]-terms; 8. Unification of [lambda]-terms; 9. Implementing proof systems; 10. Computations over functional programs; 11. Encoding a process calculus language; Appendix. The Teyjus system</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Logic programming</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Prolog (Computer program language)</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">COMPUTERS / Programming Languages / General.</subfield>
    <subfield code="2">bisacsh</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Nadathur, Gopalan</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2019-09-04</subfield>
    <subfield code="g">207.36</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">QA76.63 .M55 2012</subfield>
    <subfield code="p">0000080527</subfield>
    <subfield code="r">2019-09-04 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="v">207.36</subfield>
    <subfield code="w">2019-09-04</subfield>
    <subfield code="y">OPEN</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="a">VIRTUA40</subfield>
    <subfield code="c">70893</subfield>
    <subfield code="d">70899</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="a">VTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5040*5050*6500*6501*6502*7000*9992</subfield>
  </datafield>
</record>
