{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:40Z","timestamp":1725663340227},"publisher-location":"Berlin, Heidelberg","reference-count":75,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540506676"},{"type":"electronic","value":"9783540460633"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50667-5_78","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:30:30Z","timestamp":1330201830000},"page":"255-278","source":"Crossref","is-referenced-by-count":0,"title":["Nonstandard logics of recursive programs and denotational semantics"],"prefix":"10.1007","author":[{"given":"Ana","family":"Pasztor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-11981-7_1","volume":"148","author":"H. Andreka","year":"1983","unstructured":"Andreka, H.: Sharpening the characterization of the power of Floyd's method. In: Logics of Programs and their Applications, ed.: A. Salwicki (Proc. Conf. Poznan 1980) Lecture Notes in Computer Science Vol 148, Springer 1983, 1\u201326.","journal-title":"Lecture Notes in Computer Science"},{"key":"26_CR2","first-page":"115","volume":"7","author":"H. Andreka","year":"1978","unstructured":"Andreka, H., Nemeti, I.: Completeness of Floyd logic. Bull.Section of Logic, Vol 7, Wroclaw 1978, 115\u2013120.","journal-title":"Bull.Section of Logic"},{"key":"26_CR3","unstructured":"Andreka,H., Nemeti,I., Sain,I.: A complete first order logic. MTA MKI Preprint, 1978."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-09526-8_17","volume":"74","author":"H. Andreka","year":"1979","unstructured":"Andreka, H., Nemeti, I., Sain, I.: Completeness problems in verification of programs and program schemes. In: Mathematical Foundations of Computer Science '79, ed.: J. Becvar (Proc. Conf. Olomouc Chehoslovakia 1979), Lecture Notes in Computer Science Vol 74, Springer 1979, 208\u2013218.","journal-title":"Lecture Notes in Computer Science"},{"key":"26_CR5","first-page":"18","volume-title":"Fundamentals of Computation Theory '79","author":"H. Andreka","year":"1979","unstructured":"Andreka, H., Nemeti, I., Sain, I.: Henkin-type semantics for program schemes to turn negative results to positive. In: Fundamentals of Computation Theory '79, ed.: L. Budach (Proc.Conf.Berlin 1979) Akademie Verlag, Berlin, 1979, Band 2, 18\u201324."},{"issue":"3","key":"26_CR6","first-page":"124","volume":"8","author":"H. Andreka","year":"1979","unstructured":"Andreka, H., Nemeti, I., Sain, I.: Program verification within and without logic. Bull.Section of Logic Vol 8, No 3, Wroclaw 1979, 124\u2013130.","journal-title":"Bull.Section of Logic"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-10856-4_82","volume":"118","author":"H. Andreka","year":"1981","unstructured":"Andreka, H., Nemeti, I., Sain, I.: A characterization of Floyd-provable programs. In: Mathematical Foundations of Computer Science'81. eds.: J. Gruska, M. Chytil (Proc.Conf. Strbske Pleso Csehszlovakia 1981) Lecture Notes in Computer Science Vol 118, Springer 1981, 162\u2013171.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(82)90004-4","volume":"17","author":"H. Andreka","year":"1982","unstructured":"Andreka, H., Nemeti, I., Sain, I.: A complete logic for reasoning about programs via nonstandard model theory, Parts I\u2013II. Theoretical Computer Science 17, 1982, No 2: 193\u2013212, No 3: 259\u2013278.","journal-title":"Theoretical Computer Science"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Apt,K.R., J.W.De Bakker: Exercises in denotational semantics, in Proc. 5th Symp. Mathematical Foundations of Computer Science (A. Mazurkiewicz, ed.), pp. 1\u201311, Lecture Notes in Computer Science 45, Springer, 1976.","DOI":"10.1007\/3-540-07854-1_157"},{"key":"26_CR10","volume-title":"Mathematical Theory of Program Correctness","author":"J.W. Bakker De","year":"1980","unstructured":"De Bakker, J.W.: Mathematical Theory of Program Correctness, Prentice-Hall International, London (1980)."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Barwise,J.: Admissible sets and structures. Springer 1975.","DOI":"10.1007\/978-3-662-11035-5"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Brookes,S.: A Fully Abstract Semantics and a Proof System for an Algol-like Language with Sharing in LNCS: Proc. Workshop on Foundations of Programming Semantics, Springer, 1985.","DOI":"10.1007\/3-540-16816-8_26"},{"key":"26_CR13","volume-title":"Semantics of Programming Languages","author":"S. Brookes","year":"1983","unstructured":"Brookes, S.: Semantics of Programming Languages. Course Lectures, Carnegie-Mellon Univ., Comp Sci. Dept., Pittsburgh, 1983."},{"issue":"2","key":"26_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1137\/0213026","volume":"13","author":"R. Cartwright","year":"1984","unstructured":"Cartwright, R.: Recursive programs as definitions in first-order logic. SIAM J. Comput. 13, 2, 1984, 374\u2013407.","journal-title":"SIAM J. Comput."},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Cartwright,R., McCarthy,J.: First Order programming Logic. Proc.Sixth Annual ACM Symposium on Principles of Programming Languages, January 1979, 68\u201380.","DOI":"10.1145\/567752.567759"},{"key":"26_CR16","first-page":"21","volume":"14","author":"L. Csirmaz","year":"1980","unstructured":"Csirmaz, L.: A Survey of semantics of Floyd-Hoare derivability. CL and CL (Computational linguistics and Computer Languages) 14, 1980, 21\u201342.","journal-title":"CL and CL (Computational linguistics and Computer Languages)"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(81)90076-1","volume":"16","author":"L. Csirmaz","year":"1981","unstructured":"Csirmaz, L.: Programs and program verifications in a general setting. Theoretical Computer Science 16, 1981, 199\u2013210.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"26_CR18","first-page":"181","volume":"5","author":"L. Csirmaz","year":"1981","unstructured":"Csirmaz, L.: On the completeness of proving partial correctness. Acta Cybernetica 5,2, 1981, 181\u2013190.","journal-title":"Acta Cybernetica"},{"key":"26_CR19","unstructured":"Csirmaz,L.: Theorems and problems about non-standard dynamic logic. In: Proc. of workshop on algorithms and computing theory, eds.: N. Karpinski, Z. Habasinski, Technical University Poznan, 1981, 17\u201319."},{"issue":"2\u20133","key":"26_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0019-9958(83)80042-4","volume":"57","author":"L. Csirmaz","year":"1983","unstructured":"Csirmaz, L.: On the strength of \u201dSometimes\u201d and \u201dAlways\u201d in program verification. Information and Control 57, 2\u20133, 1983, 165\u2013179.","journal-title":"Information and Control"},{"issue":"1","key":"26_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1305\/ndjfl\/1093870760","volume":"26","author":"L. Csirmaz","year":"1985","unstructured":"Csirmaz, L.: A completeness theorem for dynamic logic. Notre Dame J. of Formal Logic 26, 1, 1985, 51\u201360.","journal-title":"Notre Dame J. of Formal Logic"},{"key":"26_CR22","first-page":"285","volume":"42","author":"L. Csirmaz","year":"1986","unstructured":"Csirmaz, L.: Nonstandard Logics of Programs. In: Algebra, Combinatorics, and Logic in Computer Science, eds.: J. Demetrovics, G. Katona, A. Salomaa (Proc. Conf. Gyor 1983) Colloq.Math. Soc.J.Bolyai Vol 42, North-Holland, 1986, 285\u2013294.","journal-title":"Colloq.Math. Soc.J.Bolyai"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/malq.19840301907","volume":"30","author":"L. Csirmaz","year":"1984","unstructured":"Csirmaz, L., Paris, J.: A property of 2-sorted Peano models and program verification. Zeitschrift fur Math. Logik u. Grundlagen der Math. 30, 1984, 325\u2013334.","journal-title":"Zeitschrift fur Math. Logik u. Grundlagen der Math."},{"key":"26_CR24","first-page":"45","volume":"1","author":"T. Gergely","year":"1978","unstructured":"Gergely, T., Szots, M.: On the incompleteness of proving partial correctness. Acta Cybernetica, Tom 4, Fasc 1, Szeged, 1978, 45\u201357.","journal-title":"Acta Cybernetica, Tom 4"},{"key":"26_CR25","first-page":"359","volume":"26","author":"T. Gergely","year":"1981","unstructured":"Gergely, T., Ury, L.: Time models for programming logics. In: Mathematical Logic in Computer Science, eds.: B. Domolki, T. Gergely (proc. Conf. Salgotarjan 1978) Colloq. Math. Soc. J. Bolyai Vol 26, North-Holland, 1981, 359\u2013427.","journal-title":"Colloq. Math. Soc. J. Bolyai"},{"key":"26_CR26","unstructured":"Gergely,T., Ury,L.: Program behaviour specification through explicit time consideration. Information Processing 80, ed.: S.H. Lavington, North-Holland, 1980, 107\u2013111."},{"key":"26_CR27","unstructured":"Gonzalez,M.T.H., Artalejo,M.R.: Hoare's logic for nondeterministic regular programs: A nonstandard approach. Preprint Universidad de Madrid 84\/85\/cc-1, 1985. Abstracted in 12th International Colloquium on Automata, Languages and Programming, Greece, 1985."},{"key":"26_CR28","unstructured":"Gonzalez,M.T.H., Artalejo,M.R.: Some questions about expressiveness and relative completeness in Hoare's logic, Preprint Universidad de Madrid 84\/85\/cc-1, 1985."},{"key":"26_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6228-2","volume-title":"The Denotational Description of Programming Languages","author":"M. Gordon","year":"1979","unstructured":"Gordon, M.: The Denotational Description of Programming Languages, An Introduction, Springer, New York (1979)."},{"key":"26_CR30","first-page":"443","volume":"42","author":"P. Hajek","year":"1986","unstructured":"Hajek, P.: Some conservativeness results for nonstandard dynamic logic. In: Algebra, Combinatorics and Logic in Computer Science, eds.: J. Demetrovics, G. Katona, A. Salomaa (Proc. Conf. Gyor 1983) Colloq. Math, Soc. J.Bolyai Vol 42, North-Holland, 1986, 443\u2013449.","journal-title":"Colloq. Math, Soc. J.Bolyai"},{"key":"26_CR31","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90032-0","volume":"46","author":"P. Hajek","year":"1986","unstructured":"Hajek, P.: A simple dynamic predicate logic. Theoretical Computer Science, 46(1986)239\u2013259.","journal-title":"Theoretical Computer Science"},{"key":"26_CR32","first-page":"47","volume":"164","author":"J. Halpern","year":"1984","unstructured":"Halpern, J., Meyer, A., Trakhtenbrot, B.: From Denotational to Operational and Axiomatic Semantics for Algol-like Languages, Lecture Notes in Computer Science, 164, (1984), pp.47\u2013500.","journal-title":"Lecture Notes in Computer Science"},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Harel,D.: First-order Dynamic Logic. Lecture Notes in Computer Science Vol 68, Springer, 1979.","DOI":"10.1007\/3-540-09237-4"},{"key":"26_CR34","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-94-009-6259-0_10","volume-title":"Handbook of Philosophical Logic","author":"D. Harel","year":"1984","unstructured":"Harel, D.: Dynamic Logic. In: Handbook of Philosophical Logic, eds.: D.M. Gabbay, F. Guenthner, Reidel Publ. Co., North Holland, 1984, Vol II.10, 497\u2013604."},{"key":"26_CR35","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2266967","volume":"15","author":"L. Henkin","year":"1950","unstructured":"Henkin, L.: Completeness in the theory of types, J. Symb. Logic 15, 1950, 81\u201391.","journal-title":"J. Symb. Logic"},{"key":"26_CR36","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0019-9958(75)90415-5","volume":"29","author":"A.J. Kfoury","year":"1975","unstructured":"Kfoury, A.J., Park, D.M.R.: On the termination of program schemas. Information and Control 29 (1975) 243\u2013251.","journal-title":"Information and Control"},{"key":"26_CR37","doi-asserted-by":"crossref","unstructured":"Leviant,D.: Logical and mathematical reasoning about imperative programs. In: Proc. of the 1985 POPL (12th Annual ACM Symp. on Princliles of Progr. Languages, New Orleans, 1985) 132\u2013140.","DOI":"10.1145\/318593.318625"},{"key":"26_CR38","unstructured":"Leivant,D.: Explicit and modal capturing of the relational semantics of programs. In: proc. of the ASL 1985 European Summer Meeting at Orsay, to appear."},{"key":"26_CR39","unstructured":"Makowsky,J.A., Sain,I.: On the equivalence of weak second order and nonstandard time semantics for various program verification systems. Logic in Computer Science (Proc. Conf. Cambridge USA 1986) Springer 1986, to appear."},{"key":"26_CR40","unstructured":"Makowsky,J.A., Sain,I.: On the equivalence of weak second order and nonstandard time semantics for Floyd-Hoare logic. MTA MKI Preprint No 70\/1985. Theoretical Computer Science, to appear."},{"key":"26_CR41","unstructured":"Manders,K.L.: First-order Logical Systems and Set-theoretic Definability. Preprint, University of Pittsburgh, 1979."},{"key":"26_CR42","unstructured":"Manna, Z,: Mathematical Theory of Computation, McGraw-Hill, 1974."},{"key":"26_CR43","unstructured":"Meyer, A.: discussions with L. Csirmaz at Symposium on Logic in Computer Science, Cambridge, Massachusetts, June 16\u201318, 1986."},{"key":"26_CR44","first-page":"951","volume-title":"Proc. IFIP Congress 1983","author":"A Meyer","year":"1983","unstructured":"Meyer, A: Understanding Algol: a view of a recent convert to denotational semantics, in Proc. IFIP Congress 1983, pp. 951\u2013962, North Holland, Amsterdam 1983."},{"key":"26_CR45","volume-title":"A Theory of programming Language Semantics (2 volumes)","author":"R.E. Milne","year":"1976","unstructured":"Milne, R.E., Strachey, C.: A Theory of programming Language Semantics (2 volumes), Chapman and Hall, London, and Wiley, New York (1976)."},{"key":"26_CR46","doi-asserted-by":"crossref","unstructured":"Monk,J.D.: Mathematical Logic. Springer, 1976.","DOI":"10.1007\/978-1-4684-9452-5"},{"key":"26_CR47","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/3-540-07854-1_211","volume":"45","author":"P.D. Mosses","year":"1976","unstructured":"Mosses, P.D.: Compiler generation using denotational semantics, Proc. Symposium on Mathematical Foundations of Computer Science. Gdansk, Lecture Notes in Computer Science, 45, pp. 436\u201341, Springer, Berlin (1976).","journal-title":"Lecture Notes in Computer Science"},{"key":"26_CR48","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BFb0025789","volume":"131","author":"I. Nemeti","year":"1982","unstructured":"Nemeti, I.: Nonstandard Dynamic Logic. In: Logics of Programs, ed.: D. Kozen (Proc. Conf. New York 1981) Lecture Notes in Computer Science Vol 131, Springer 1982, 311\u2013348.","journal-title":"Lecture Notes in Computer Science"},{"issue":"1","key":"26_CR49","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0747-7171(86)80013-X","volume":"2","author":"A. Pasztor","year":"1986","unstructured":"Pasztor, A.: Nonstandard algorithmic and dynamic logic. J. Symbolic Computation, Academic Press, Vol 2, No 1, 1986, 59\u201381.","journal-title":"J. Symbolic Computation, Academic Press"},{"key":"26_CR50","series-title":"Research Report","volume-title":"Nonstandard Dynamic Logic to Prove Standard Properties of Programs","author":"A. Pasztor","year":"1984","unstructured":"Pasztor, A.: Nonstandard Dynamic Logic to Prove Standard Properties of Programs. Research Report 84-3, Carnegie-Mellon University, Pittsburgh, 1984."},{"key":"26_CR51","series-title":"Research Report","volume-title":"Nonstandard Logics of Programs \u2014 Survey and Perspective","author":"A. Pasztor","year":"1985","unstructured":"Pasztor, A.: Nonstandard Logics of Programs \u2014 Survey and Perspective. Research Report 85-3, Carnegie-Mellon University, Pittsburgh, 1985."},{"key":"26_CR52","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF Considered as a programming Language, Th. Comp. Science, 5, (1977), pp.223\u2013255.","journal-title":"Th. Comp. Science"},{"key":"26_CR53","first-page":"251","volume":"VI","author":"V.R. Pratt","year":"1982","unstructured":"Pratt, V.R.: Dynamic Logic. Logic, Methodology, and Philos. of Sci. Vol. VI, North-Holland 1982, 251\u2013261.","journal-title":"Methodology, and Philos. of Sci."},{"key":"26_CR54","first-page":"667","volume":"42","author":"M.M. Richter","year":"1986","unstructured":"Richter, M.M., Szabo, M.E.: Nonstandard Computation Theory. In: Algebra, Combinatorics and Logic in Computer Science, eds.: J. Demetrovics, G. Katona, A. Salomaa (Proc. Conf. Gyor 1983) Colloq. Math. Soc. J. Bolyai Vol 42, North-Holland 1986, 667\u2013693.","journal-title":"Colloq. Math. Soc. J. Bolyai"},{"key":"26_CR55","volume-title":"Saturated model theory, Lecture Notes Series","author":"G.E. Sacks","year":"1972","unstructured":"Sacks, G.E.: Saturated model theory, Lecture Notes Series, W.A. Benjamin Inc., Massachusetts, 1972."},{"key":"26_CR56","first-page":"195","volume":"13","author":"I. Sain","year":"1979","unstructured":"Sain, I.: There are general rules for specifying semantics: Observations on Abstract Model Theory. CL and CL (Computational Linguistics and Computer Languages) 13, 1979, 195\u2013250.","journal-title":"CL and CL (Computational Linguistics and Computer Languages)"},{"key":"26_CR57","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-10854-8_37","volume":"117","author":"I. Sain","year":"1981","unstructured":"Sain, I.: First order dynamic logic with decidable proofs and workeable model theory. In: Fundamentals of Computation Theory'81, ed.: F. Gecseg (Proc.Conf.Szeged 1981) Lecture Notes in Computer Science Vol 117, Springer 1981, 334\u2013340.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"26_CR58","first-page":"64","volume":"12","author":"I. Sain","year":"1983","unstructured":"Sain, I.: Total correctness in nonstandard dynamic logic. Bull,Section of Logic Vol 12, no 2, Warsaw-Lodz 1983, 64\u201370.","journal-title":"Bull,Section of Logic"},{"key":"26_CR59","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/malq.19840303102","volume":"30","author":"I. Sain","year":"1984","unstructured":"Sain, I.: Structured nonstandard dynamic logic. Zeitschrift fur Math. Logik u. Grundlagen d. Math. Heft 3, Band 30, 1984. 481\u2013497.","journal-title":"Zeitschrift fur Math. Logik u. Grundlagen d. Math. Heft 3, Band"},{"key":"26_CR60","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(85)90024-6","volume":"35","author":"I. Sain","year":"1985","unstructured":"Sain, I.: A simple proof for completeness of Floyd method. Theoretical Computer Science 35, 1985, 345\u2013348.","journal-title":"Theoretical Computer Science"},{"key":"26_CR61","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-15648-8_24","volume":"193","author":"I. Sain","year":"1985","unstructured":"Sain, I.: The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods. In: Logics of Programs, ed.: R. Parikh (Proc. Conf. Brooklyn USA 1985) Lecture Notes in Computer Science Vol 193, Springer 1985, 302\u2013319.","journal-title":"Lecture Notes in Computer Science"},{"key":"26_CR62","unstructured":"Sain,I.: Total correctness in nonstandard dynamic logic. Theoretical Computer Science, to appear."},{"key":"26_CR63","unstructured":"Sain,I.: Elementary proof for some semantic characterizations of non-deterministic Floyd-Hoare logic. Notre Dame J. Formal Logic, to appear."},{"key":"26_CR64","unstructured":"Sain,I.: Relative program verifying powers of the various temporal logics. MTA MKI Preprint No 40\/1985. Information and Control, submitted."},{"key":"26_CR65","unstructured":"Sain,I.: Dynamic Logic with nonstandard model theory, Thesis, Budapest, 1986."},{"key":"26_CR66","unstructured":"Sain,I., Nemeti,I.: Lattice of logics of programs via nonstandard dynamic logic. Zeitschrift fur Math. Logik u. Grundlagen d. Math., to appear."},{"key":"26_CR67","volume-title":"Denotational Semantics","author":"D.A. Schmidt","year":"1986","unstructured":"Schmidt, D.A.: Denotational Semantics, A Methodology for Language Development, Allyn and Bacon, 1986."},{"key":"26_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0022470","volume-title":"Denotational semantics of parallelism, Semantics of Concurrent Computation","author":"J.S. Schwarz","year":"1979","unstructured":"Schwarz, J.S.: Denotational semantics of parallelism, Semantics of Concurrent Computation, Proc. of the Int. Symposium, Evian, France, pp. 191\u2013202, Lecture Notes in Computer Science, 70, Springer, Berlin (1979)."},{"key":"26_CR69","first-page":"225","volume-title":"Mathematical concepts in programming language semantics, Proc. 1972 Spring Joint Computer Conference","author":"D.S. Scott","year":"1972","unstructured":"Scott, D.S.: Mathematical concepts in programming language semantics, Proc. 1972 Spring Joint Computer Conference, pp. 225\u201334, AFIPS Press, Montvale, N.J. (1972)."},{"key":"26_CR70","first-page":"19","volume-title":"Proc. of the Symposium on Computers and Automata","author":"D.S. Scott","year":"1971","unstructured":"Scott, D.S., Strachey, C.: Towards a mathematical semantics for computer languages, Proc. of the Symposium on Computers and Automata (ed., J. Fox), pp. 19\u201346, Polytechnic Institute of Brooklyn Press, New York (1971); also technical monograph PRG-6, programming Research Group, University of Oxford (1971)."},{"key":"26_CR71","volume-title":"Denotational Semantics: The Scott-Strachey Approach to programming Language Theory","author":"J.E. Stoy","year":"1977","unstructured":"Stoy, J.E.: Denotational Semantics: The Scott-Strachey Approach to programming Language Theory, MIT Press, Cambridge, Mass. (1977)."},{"key":"26_CR72","unstructured":"Suchenek,M.: Floyd-Hoare implication is not uniformly axiomatizable within nonstandard dynamic logic. Preprint, Warsaw 1983. Computer Languages, Linguistics, and Logic Vol 1, to appear."},{"issue":"8","key":"26_CR73","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1145\/360303.360308","volume":"19","author":"R.D. Tennent","year":"1976","unstructured":"Tennent, R.D.: The denotational semantics of programming languages, Comm. ACM,19(8), 437\u201353(1976).","journal-title":"Comm. ACM"},{"key":"26_CR74","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-07854-1_168","volume":"45","author":"B.A. Trakhtenbrot","year":"1976","unstructured":"Trakhtenbrot, B.A., Recursive Program Schemes and Computable Functionals, Lecture Notes in Computer Science, Vol.45, (1976), pp.137\u2013152.","journal-title":"Lecture Notes in Computer Science"},{"key":"26_CR75","unstructured":"Trakhtenbrot,B.A., Topics in Typed programming Languages, Lecture Notes, Carnegie-Mellon University, CS Dept., Fall 1985."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50667-5_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T10:08:41Z","timestamp":1561370921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50667-5_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540506676","9783540460633"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/3-540-50667-5_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}