{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:28Z","timestamp":1761611068166},"reference-count":61,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":5768,"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":[[1997,10]]},"DOI":"10.1016\/s0304-3975(97)00047-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"277-318","source":"Crossref","is-referenced-by-count":4,"title":["A first order logic of effects"],"prefix":"10.1016","volume":"185","author":[{"given":"Ian A.","family":"Mason","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00047-9_BIB1","series-title":"Structure and Interpretation of Computer Programs","author":"Abelson","year":"1985"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB2","series-title":"Research Topics in Functional Programming","article-title":"The lazy lambda calculus","author":"Abramsky","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(97)00047-9_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB4","series-title":"The 3rd Internat. Conf. Concurrency Theory (CONCUR '92)","first-page":"565","article-title":"Towards a theory of actor computation","volume":"vol. 630","author":"Agha","year":"1992"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S095679689700261X","article-title":"A foundation for actor computation","volume":"XX","author":"Agha","year":"1997","journal-title":"J. Functional Programming"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB6","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare's logic: a survey \u2014 part I","volume":"4","author":"Apt","year":"1981","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00245294","article-title":"Using typed lambda calculus to implement formal systems on a machine","volume":"9","author":"Avron","year":"1992","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB8","series-title":"The Lambda Calculus: its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB9","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/0890-5401(90)90064-O","article-title":"Can LCF be topped?","volume":"87","author":"Bloom","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB10","series-title":"Model Theory","author":"Chang","year":"1973"},{"issue":"2","key":"10.1016\/S0304-3975(97)00047-9_BIB11","first-page":"149","article-title":"Operational, denotational and logical descriptions: a case study","volume":"16","author":"Egidi","year":"1992","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB12","first-page":"87","article-title":"A language and axioms for explicit mathematics","volume":"vol. 450","author":"Feferman","year":"1975"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB13","series-title":"Logic Colloquium '78, North-Holland","first-page":"159","article-title":"Constructive theories of functions and classes","author":"Feferman","year":"1979"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB14","first-page":"95","article-title":"A theory of variable types","volume":"19","author":"Feferman","year":"1985","journal-title":"Rev. Colomb. Mat\u00e9maticas"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB15","first-page":"101","article-title":"Polymorphic typed lambda-calculi in a type-free axiomatic framework","volume":"vol. 106","author":"Feferman","year":"1990"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB16","article-title":"The calculi of lambda-v-cs conversion: A syntactic theory of control and state in imperative higher-order programming languages","author":"Felleisen","year":"1987"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB17","unstructured":"M. Felleisen, Personal communication, 1993."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB18","series-title":"Formal Description of Programming Concepts III","first-page":"193","article-title":"Control operators, the SECD-machine, and the \u03bb-calculus","author":"Felleisen","year":"1986"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","article-title":"The revised report on the syntactic theories of sequential control and state","volume":"103","author":"Felleisen","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB20","unstructured":"J. Frost, Personal communication, 1995."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB21","article-title":"Effective programming","author":"Frost","year":"1996"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB22","series-title":"Proc. Australasian Theory Symp., CATS '96","first-page":"147","article-title":"An operational logic of effects","author":"Frost","year":"1996"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB23","first-page":"497","article-title":"Dynamic logic","volume":"vol. II","author":"Harel","year":"1984"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB24","series-title":"Proc. CSL92","first-page":"309","article-title":"A theory of classes for a functional language with effects","volume":"vol. 702","author":"Honsell","year":"1993"},{"issue":"1","key":"10.1016\/S0304-3975(97)00047-9_BIB25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/inco.1995.1077","article-title":"A variable typed logic of effects","volume":"119","author":"Honsell","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB26","series-title":"4th Annual Symp. on Logic in Computer Science, IEEE","article-title":"Equality in the lazy lambda calculus","author":"Howe","year":"1989"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB27","series-title":"Theoretical Aspects of Computer Science","first-page":"131","article-title":"Full abstraction and the context lemma","volume":"vol. 526","author":"Jim","year":"1991"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB28","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB29","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"Landin","year":"1964","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB30","article-title":"The Semantics of Destructive Lisp","author":"Mason","year":"1986"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB31","series-title":"Australasian Theory Symp. CATS '97","first-page":"103","article-title":"Parametric computation","volume":"Vol. 19","author":"Mason","year":"1997"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB32","series-title":"4th Annual Symp. on Logic in Computer Science, IEEE","article-title":"Axiomatizing operational equivalence in the presence of side effects","author":"Mason","year":"1989"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB33","article-title":"A sound and complete axiomatization of operational equivalence between programs with memory","author":"Mason","year":"1989"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB34","series-title":"Programming Language Implementation and Logic Programming, PLILP'90","first-page":"189","article-title":"Reasoning about programs with effects","volume":"vol. 456","author":"Mason","year":"1990"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB35","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0956796800000125","article-title":"Equivalence in functional languages with effects","volume":"1","author":"Mason","year":"1991","journal-title":"J. Functional Programming"},{"issue":"2","key":"10.1016\/S0304-3975(97)00047-9_BIB36","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(92)90301-U","article-title":"Inferring the equivalence of functional programs that mutate data","volume":"105","author":"Mason","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB37","series-title":"7th Annual Symp. on Logic in Computer Science, IEEE","first-page":"186","article-title":"References, local variables and operational reasoning","author":"Mason","year":"1992"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB38","series-title":"Logic, Language and Computation, Festschrift in Honor of Satoru Takasu","first-page":"225","article-title":"Program transformation via contextual assertions","volume":"vol. 792","author":"Mason","year":"1994"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB39","article-title":"Hoare's logic in the LF","author":"Mason","year":"1987"},{"issue":"3","key":"10.1016\/S0304-3975(97)00047-9_BIB40","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0129054195000160","article-title":"Reasoning about object systems in VTLoE","volume":"6","author":"Mason","year":"1995","journal-title":"Internat. J. Foundations Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed \u03bb-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB42","series-title":"4th Annual Symp. on Logic in Computer Science, IEEE","article-title":"Computational lambda-calculus and monads","author":"Moggi","year":"1989"},{"issue":"1","key":"10.1016\/S0304-3975(97)00047-9_BIB43","doi-asserted-by":"crossref","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Information and Comput."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB44","article-title":"Lambda calculus models of programming languages","author":"Morris","year":"1968"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB45","doi-asserted-by":"crossref","DOI":"10.1145\/322186.322198","article-title":"Fast decision procedures based on congruence closure","author":"Nelson","year":"1977"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB46","article-title":"The lazy lambda calculus: an investigation into the foundations of functional programming","author":"Ong","year":"1988"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB47","article-title":"Isabelle, a generic theorem prover","volume":"vol. 828","author":"Paulson","year":"1994"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB48","series-title":"IVth Higher-Order Workshop, Banff, vol. 283 of Workshops in Computing","article-title":"Evaluation logic","author":"Pitts","year":"1990"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB49","series-title":"ACM Sigplan Workshop on State in Programming Languages","article-title":"On the observable properties of higher order functions that dynamically create local names","author":"Pitts","year":"1993"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB50","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the lambda calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB51","series-title":"Natural Deduction: A Proof-theoretical Study","author":"Prawitz","year":"1965"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB52","first-page":"1","article-title":"Decidability of second order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB53","series-title":"Tools and Notions for Program Construction","first-page":"121","article-title":"Idealized ALGOL and its specification logic","author":"Reynolds","year":"1982"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB54","series-title":"MFPS 1991","first-page":"54","article-title":"From operational to denotational semantics","volume":"vol. 598","author":"Smith","year":"1992"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB55","article-title":"The essence of rum: a theory of the intensional and extensional aspects of Lisp-type computation","author":"Talcott","year":"1985"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB56","series-title":"Artificial Intelligence and Mathematical Theory of Computation","article-title":"Binding structures","author":"Talcott","year":"1991"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB57","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(92)90169-G","article-title":"A theory for program and data type specification","volume":"104","author":"Talcott","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB58","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(93)90240-T","article-title":"A theory of binding structures and its applications to rewriting","volume":"112","author":"Talcott","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00047-9_BIB59","series-title":"Higher Order Operational Techniques in Semantics","article-title":"Reasoning about functions with effects","author":"Talcott","year":"1997"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB60","article-title":"Decidable pairing functions","author":"Tenney","year":"1972"},{"key":"10.1016\/S0304-3975(97)00047-9_BIB61","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0004-3702(80)90015-6","article-title":"Prolegomena to a theory of formal reasoning","volume":"13","author":"Weyhrauch","year":"1980","journal-title":"Artificial Intelligence"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000479?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000479?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:59:18Z","timestamp":1555405158000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0304397597000479"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00047-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}