{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:18:41Z","timestamp":1649171921763},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1997,6]]},"abstract":"<jats:p>We propose a general theory of partial <jats:italic>n<\/jats:italic>-place operations \nbased solely on the primitive \nnotion of the application of a <jats:italic>(possibly partial) operation to n objects<\/jats:italic>. \nThis theory is strongly \nselfdescriptive in that the fundamental manipulations of operations, that\n is, \n<jats:italic>application<\/jats:italic>, \n<jats:italic>composition<\/jats:italic>, <jats:italic>abstraction<\/jats:italic>, <jats:italic>union<\/jats:italic>, <jats:italic>intersection<\/jats:italic> \nand so on, are themselves internal operations. We \ngive several applications of this theory, including implementations of\n partial \n<jats:italic>n<\/jats:italic>-ary \n\u03bb-calculus, and other operation description languages. We investigate \nthe issue of \n<jats:italic>extensionality<\/jats:italic> and give <jats:italic>weakly extensional<\/jats:italic> models of\n the theory.<\/jats:p>","DOI":"10.1017\/s0960129597002272","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:29:40Z","timestamp":1027776580000},"page":"283-302","source":"Crossref","is-referenced-by-count":2,"title":["An axiomatization of partial <i>n<\/i>-place operations"],"prefix":"10.1017","volume":"7","author":[{"given":"MARCO","family":"FORTI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FURIO","family":"HONSELL","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARINA","family":"LENISA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[1997,6,1]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129597002272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T20:47:14Z","timestamp":1557607634000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129597002272\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0960129597002272"],"URL":"https:\/\/doi.org\/10.1017\/s0960129597002272","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}