{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T09:28:39Z","timestamp":1780565319940,"version":"3.54.1"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0304-3975(86)90173-8","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"149-167","source":"Crossref","is-referenced-by-count":25,"special_numbering":"C","title":["Partial evaluation and \u03c9-completeness of algebraic specifications"],"prefix":"10.1016","volume":"43","author":[{"given":"Jan","family":"Heering","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90173-8_bib1","series-title":"The Lambda Calculus","author":"Barendregt","year":"1981"},{"key":"10.1016\/0304-3975(86)90173-8_bib2","series-title":"Theoretical Foundations of Programming Methodology","first-page":"329","article-title":"Algebras, theories and freeness: An introduction for computer scientists","author":"Burstall","year":"1982"},{"key":"10.1016\/0304-3975(86)90173-8_bib3","series-title":"Rept. IW 115\/79","article-title":"Algebraic specifications of computable and semi-computable data structures","author":"Bergstra","year":"1979"},{"issue":"2","key":"10.1016\/0304-3975(86)90173-8_bib4","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1137\/0212024","article-title":"Initial and final algebra semantics for data type specifications: Two characterization theorems","volume":"12","author":"Bergstra","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90173-8_bib5","series-title":"Mathematical Developments Arising from Hilbert Problems","first-page":"323","article-title":"Hilbert's tenth problem: Positive aspects of a negative solution","author":"Davis","year":"1976"},{"key":"10.1016\/0304-3975(86)90173-8_bib6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0304-3975(82)90111-6","article-title":"Mixed computation: Potential applications and problems for study","volume":"18","author":"Ershov","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90173-8_bib7","doi-asserted-by":"crossref","first-page":"597","DOI":"10.2307\/2321009","article-title":"The logic of equality","volume":"84","author":"Henkin","year":"1977","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0304-3975(86)90173-8_bib8","series-title":"Rept. UIUCDCS-R-82-1113","article-title":"Topics in automated theorem proving and program generation","author":"Hsiang","year":"1982"},{"key":"10.1016\/0304-3975(86)90173-8_bib9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","article-title":"Proofs by induction in equational theories with constructors","volume":"25","author":"Huet","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90173-8_bib10","series-title":"Formal Languages: Perspectives and Open Problems","article-title":"Equations and rewrite rules: A survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(86)90173-8_bib11","series-title":"Rept. 85\/1","article-title":"An experiment in partial evaluation: The generation of a compiler generator","author":"Jones","year":"1985"},{"key":"10.1016\/0304-3975(86)90173-8_bib12","article-title":"A Specification of an Abstract PROLOG Machine and its Application to Partial Evaluation","author":"Komorowski","year":"1981"},{"key":"10.1016\/0304-3975(86)90173-8_bib13","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1090\/S0002-9947-1951-0044470-3","article-title":"Identities in two-valued calculi","volume":"71","author":"Lyndon","year":"1951","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(86)90173-8_bib14","first-page":"8","article-title":"Identities in finite algebras","volume":"5","author":"Lyndon","year":"1954"},{"key":"10.1016\/0304-3975(86)90173-8_bib15","series-title":"Algebraic Methods in Semantics","article-title":"Initiality, induction, and computability","author":"Meseguer","year":"1986"},{"key":"10.1016\/0304-3975(86)90173-8_bib16","first-page":"51","article-title":"On induction for programming logic: Syntax, semantics, and inductive closure","volume":"13","author":"Nourani","year":"1981","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90173-8_bib17","series-title":"9th Coll. on Trees in Algebra and Programming","article-title":"Proof by induction in equational theories with relations between constructors","author":"Paul","year":"1984"},{"key":"10.1016\/0304-3975(86)90173-8_bib18","doi-asserted-by":"crossref","first-page":"313","DOI":"10.2307\/2272645","article-title":"The \u03bb-calculus is \u03c9-incomplete","volume":"39","author":"Plotkin","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(86)90173-8_bib19","article-title":"Equational logic","author":"Taylor","year":"1979","journal-title":"Houston J. Math., Survey"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901738?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901738?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:53:06Z","timestamp":1553158386000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":19,"alternative-id":["0304397586901738"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90173-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}