{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:08:05Z","timestamp":1770289685576,"version":"3.49.0"},"reference-count":33,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,21]],"date-time":"2004-03-21T00:00:00Z","timestamp":1079827200000},"content-version":"vor","delay-in-days":4769,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0168-0072(91)90068-w","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:32:03Z","timestamp":1034271123000},"page":"125-157","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":328,"title":["Uniform proofs as a foundation for logic programming"],"prefix":"10.1016","volume":"51","author":[{"given":"Dale","family":"Miller","sequence":"first","affiliation":[]},{"given":"Gopalan","family":"Nadathur","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Pfenning","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(91)90068-W_bib1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0168-0072(91)90068-W_bib2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A formulation of the simple theory of types","volume":"5","author":"Church","year":"1940","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(91)90068-W_bib3","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0168-0072(91)90068-W_bib4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0012823","article-title":"Specifying theorem provers in a higher-order logic programming language","author":"Felty","year":"1988","journal-title":"Proc. Ninth Internat. Conference on Automated Deduction"},{"key":"10.1016\/0168-0072(91)90068-W_bib5","series-title":"Model Theory and Forcing","article-title":"Intuitionistic Logic","author":"Fitting","year":"1969"},{"key":"10.1016\/0168-0072(91)90068-W_bib6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene semantics for logic programming","volume":"4","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0168-0072(91)90068-W_bib7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","article-title":"N-Prolog: an extension of Prolog with hypothetical implications. I","volume":"1","author":"Gabbay","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0168-0072(91)90068-W_bib8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0743-1066(87)90015-X","article-title":"Hornlog: a graph-based interpreter for general Horn clauses","volume":"4","author":"Gallier","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0168-0072(91)90068-W_bib9","series-title":"The Collected Papers of Gerhard Gentzen","first-page":"68","article-title":"Investigations into logical deductions","author":"Gentzen","year":"1969"},{"key":"10.1016\/0168-0072(91)90068-W_bib10","series-title":"Proc. Fifth Internat. Conference and Symposium on Logic Programming","article-title":"Uses of higher-order unification for implementing program transformers","author":"Hannan","year":"1988"},{"key":"10.1016\/0168-0072(91)90068-W_bib11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.2307\/2964334","article-title":"Concerning formulas of the types A\u2192B \u2228 C, A\u2192(Ex)B(x) in intuitionistic formal systems","volume":"25","author":"Harrop","year":"1960","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(91)90068-W_bib12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90068-W_bib13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00264598","article-title":"Proving and applying program transformations expressed with second-order patterns","volume":"11","author":"Huet","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/0168-0072(91)90068-W_bib14","article-title":"Hereditary Harrop formulas and logic programming","author":"Miller","year":"1987","journal-title":"Proc. VIII Internat. Congress of Logic, Methodology, and Philosophy of Science"},{"key":"10.1016\/0168-0072(91)90068-W_bib15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","article-title":"A logical analysis of modules in logic programming","volume":"6","author":"Miller","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0168-0072(91)90068-W_bib16","author":"Miller","year":"1989","journal-title":"Solutions to \u03bb-terms equations under a mixed prefix"},{"key":"10.1016\/0168-0072(91)90068-W_bib17","article-title":"Lexical scoping as universal quantification","author":"Miller","year":"1989","journal-title":"Proc. Sixth Internat. Conference on Logic Programming"},{"key":"10.1016\/0168-0072(91)90068-W_bib18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3115\/981131.981165","article-title":"Some uses of higher-order logic in computational linguistics","author":"Miller","year":"1986","journal-title":"Proc. 24th Annual Meeting of the Association for Computational Linguistics"},{"key":"10.1016\/0168-0072(91)90068-W_bib19","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3-540-16492-8_94","article-title":"Higher-order logic programming","author":"Miller","year":"1986","journal-title":"Proc. Third Internat. Logic Programming Conference"},{"key":"10.1016\/0168-0072(91)90068-W_bib20","first-page":"379","article-title":"A logic programming approach to manipulating formulas and programs","author":"Miller","year":"1987","journal-title":"Proc. 1987 Symposium on Logic Programming"},{"key":"10.1016\/0168-0072(91)90068-W_bib21","first-page":"98","article-title":"Hereditary Harrop formulas and uniform proofs systems","author":"Miller","year":"1987","journal-title":"Proc. Second Annual Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(91)90068-W_bib22","series-title":"Ph.D. Dissertation","article-title":"A higher-order logic as the basis for logic programming","author":"Nadathur","year":"1987"},{"key":"10.1016\/0168-0072(91)90068-W_bib23","first-page":"810","article-title":"An overview of \u03bbProlog","author":"Nadathur","year":"1988","journal-title":"Proc. Fifth Internat. Logic Programming Conference"},{"key":"10.1016\/0168-0072(91)90068-W_bib24","unstructured":"G. Nadathur and D. Miller, Higher-order Horn clauses, J. Assoc. Comput. Mach., submitted."},{"key":"10.1016\/0168-0072(91)90068-W_bib25","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(86)90015-4","article-title":"Natural deduction as higher-order resolution","volume":"3","author":"Paulson","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0168-0072(91)90068-W_bib26","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/62678.62697","article-title":"Partial polymorphic type inference and higher-order unification","author":"Pfenning","year":"1988","journal-title":"Proc. 1988 ACM Conference on Lisp and Functional Programming"},{"key":"10.1016\/0168-0072(91)90068-W_bib27","first-page":"199","article-title":"Higher-order abstract syntax","author":"Pfenning","year":"1988","journal-title":"Proc. SIGPLAN '88 Symposium on Language Design and Implementation"},{"key":"10.1016\/0168-0072(91)90068-W_bib28","series-title":"Natural Deduction","author":"Prawitz","year":"1965"},{"key":"10.1016\/0168-0072(91)90068-W_bib29","series-title":"The Art of Prolog: Advanced Programming Techniques","author":"Sterling","year":"1986"},{"key":"10.1016\/0168-0072(91)90068-W_bib30","article-title":"Metamathematical Investigation of Intuitionistic Arithmetic and Analysis","volume":"344","author":"Troelstra","year":"1973"},{"key":"10.1016\/0168-0072(91)90068-W_bib31","first-page":"179","article-title":"First-order predicate logic as a common basis for relational and functional programming","author":"Emden","year":"1987","journal-title":"Proc. Second Annual Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(91)90068-W_bib32","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"Emden","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0168-0072(91)90068-W_bib33","first-page":"441","article-title":"Higher-order extensions to Prolog: are they needed?","volume":"10","author":"Warren","year":"1982"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190068W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190068W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:39:27Z","timestamp":1757453967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729190068W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["016800729190068W"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(91)90068-w","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Uniform proofs as a foundation for logic programming","name":"articletitle","label":"Article Title"},{"value":"Annals of Pure and Applied Logic","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0168-0072(91)90068-W","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}