{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:51Z","timestamp":1725663231237},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156482"},{"type":"electronic","value":"9783540395270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15648-8_28","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:21:34Z","timestamp":1330176094000},"page":"373-386","source":"Crossref","is-referenced-by-count":3,"title":["Semantical analysis of specification logic"],"prefix":"10.1007","author":[{"given":"R. D.","family":"Tennent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"10","key":"28_CR1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"C.A.R. Hoare, \u201cAn axiomatic basis for computer programming\u201d, Comm. ACM 12 (10), pp. 576\u2013580 and 583 (October 1969).","journal-title":"Comm. ACM"},{"issue":"2","key":"28_CR2","first-page":"135","volume":"3","author":"C.A.R. Hoare","year":"1974","unstructured":"C.A.R. Hoare and P.E. Lauer, \u201cConsistent and complementary formal theories of the semantics of programming languages\u201d, Acta Informatica 3 (2), pp. 135\u2013153 (1974).","journal-title":"Acta Informatica"},{"key":"28_CR3","unstructured":"J.C. Reynolds, The Craft of Programming, Prentice-Hall International (1981)."},{"key":"28_CR4","unstructured":"J.C. Reynolds, \u201cIdealized Algol and its specification logic\u201d, in Tools and Notions for Program Construction (D. N\u00e9el, ed.), pp. 121\u2013161, Cambridge University Press (1982); also: Report 1\u201381, School of Computer and Information Science, Syracuse University (July 1981)."},{"key":"28_CR5","unstructured":"J.C. Reynolds, \u201cThe essence of Algol\u201d, in Algorithmic Languages (J.W. de Bakker and J.C. van Vliet, eds.), pp. 345\u2013372, North-Holland (1981)."},{"key":"28_CR6","unstructured":"F.J. Oles, \u201cType algebras, functor categories and block structure\u201d; in Algebraic Methods in Semantics (M. Nivat and J.C. Reynolds, eds.), Proceedings of the Symposium on the Applications of Algebra to Language Definition and Compilation, June 1982, Fontainebleau, Cambridge University Press (1985)."},{"key":"28_CR7","unstructured":"F.J. Oles, A Category-Theoretic Approach to the Semantics of Programming Languages, Ph.D. dissertation, Syracuse University (August 1982)."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"S.A. Kripke, \u201cSemantical analysis of intuitionistic logic I\u201d, in Formal Systems and Recursive Functions (J.N. Crossley and M.A.E. Dummett, eds.), pp. 92\u2013130, North-Holland (1965).","DOI":"10.1016\/S0049-237X(08)71685-9"},{"key":"28_CR9","unstructured":"M. Dummett, Elements of Intuitionism, Oxford University Press (1977)."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"D. van Dalen, Logic and Structure, 2nd edition, Springer-Verlag (1983).","DOI":"10.1007\/978-3-662-02382-2"},{"key":"28_CR11","unstructured":"C. McCarty, \u201cInformation systems, continuity and realizability\u201d; in Logics of Programs, Proceedings 1983 (E. Clarke and D. Kozen, eds.). Lecture Notes in Computer Science, vol. 164, pp. 341\u2013359, Springer-Verlag (1984). Also, Chapter 7 of Realizability and Recursive Mathematics, D.Phil. thesis, Oxford University, and technical report CMU-CS-84-131, Dept. of Computer Science, Carnegie-Mellon University (1984)."},{"issue":"3","key":"28_CR12","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/322017.322028","volume":"24","author":"J.C. Reynolds","year":"1977","unstructured":"J.C. Reynolds, \u201cSemantics of the domain of flow diagrams\u201d, J. ACM 24 (3), pp. 484\u2013503 (July 1977).","journal-title":"J. ACM"},{"key":"28_CR13","first-page":"575","volume":"140","author":"D.S. Scott","year":"1982","unstructured":"D.S. Scott, \u201cDomains for denotational semantics\u201d; in Automata, Languages and Programming (M. Nielsen and E.M. Schmidt, eds.), Proceedings of the Ninth Colloquium, Aarhus, Denmark, July 1982, Lecture Notes in Computer Science, vol. 140, pp. 575\u2013613, Springer-Verlag (1982).","journal-title":"Lecture Notes in Computer Science"},{"key":"28_CR14","unstructured":"R. Goldblatt, Topoi, The Categorial Analysis of Logic, North-Holland (1979)."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"P.J. Landin, \u201cA \u03bb-calculus approach\u201d, in Advances in Programming and Nonnumerical Computation (L. Fox, ed.), pp. 97\u2013141, Pergamon Press (1966).","DOI":"10.1016\/B978-0-08-011356-2.50008-2"},{"key":"28_CR16","unstructured":"J. Lambek, \u201cFrom \u03bb-calculus to Cartesian-closed categories\u201d; in To H.B. Curry, Essays in Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin and J.R. Hindley, eds.), pp. 375\u2013402, Academic Press (1980)."},{"key":"28_CR17","unstructured":"D.S. Scott, \u201cRelating theories of the \u03bb-calculus\u201d; in To H.B. Curry, Essays in Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin and J.R. Hindley, eds.), pp. 403\u2013450, Academic Press (1980)."},{"key":"28_CR18","volume-title":"Some Syntactical and Categorical Constructions of Lambda-Calculus Models, Report no. 80","author":"G. Berry","year":"1981","unstructured":"G. Berry, Some Syntactical and Categorical Constructions of Lambda-Calculus Models, Report no. 80, INRIA, Rocquencourt, France (1981)."},{"key":"28_CR19","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1007\/BFb0061839","volume":"753","author":"D.S. Scott","year":"1979","unstructured":"D.S. Scott, \u201cIdentity and existence in intuitionistic logic\u201d; in Applications of Sheaf Theory to Algebra, Analysis and Topology (M.P. Fourman, C.J. Mulvey and D.S. Scott, eds.), Lecture Notes in Mathematics, vol. 753, pp. 660\u2013696, Springer-Verlag (1979).","journal-title":"Lecture Notes in Mathematics"},{"key":"28_CR20","volume-title":"Natural Deduction, A Proof-Theoretical Study","author":"D. Prawitz","year":"1965","unstructured":"D. Prawitz, Natural Deduction, A Proof-Theoretical Study, Almquist and Wiksell, Stockholm (1965)."}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15648-8_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:08:35Z","timestamp":1605625715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15648-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156482","9783540395270"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-15648-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}