Abstract
We present a schematic functional programming language coupled with a logic of programs. Our language allows for μ-recursion, λ-abstraction, nondeterminism and calls to predefined functions. We define a denotational semantics, show that Kozen's propositional μ-calculus and Harel's first order dynamic logic for regular programs can be embedded in our logic LRF, and establish the soundness and completeness of two different proof systems: one using infinitary rules and an arithmetically complete one.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andréka, H., Németi, I. and Sain, I., A Complete Logic for Reasoning about Programs via Nonstandard Model Theory, Parts I,II, T.C.S. 17 (1988), 193–212, 259–278.
Cartwright, R. and McCarthy, J., Representation of Recursive Programs in First Order Logic, Stanford Art. Int. Memo AIM-324 (1979).
Cartwright, R., Non-standard Fixed Points in First Order Logic, L.N.C.S. 164 (1984), 86–100.
Cartwright, R., Recursive Programs as Definitions in First Order Logic. SIAM J. Comput, 13 (1984), 374–408.
Cook, S.A., Soundness and Completeness of an Axiom System for Program Verification, SIAM J.Comput. 7 (1978), 70–90.
Ebbinghaus, H.D., Flum, J. and Thomas, W., Mathematical Logic, Springer-Verlag (1984).84).
Einsenbach,S. (ed). Functional Programming: Languages, Tools and Architectures, Ellis Horwood (1987).
Goerdt, A., Ein Hoare Kalkül für getypte λ-terme. Korrektheit, Vollständigkeit, Anwendungen, Dissertation, RWTH Aachen (1985).
Gordon, M.J., Milner, A.J. and Wadsworth, C.P., Edinburgh LCF, L.N.C.S. 78 Springer Verlag (1979).
Harel, D., First Order Dynamic Logic, L.N.C.S. 68 (1979) Springer Verlag.
Harel, D., Dynamic Logic, D.Gabbay and F. Guenthner (ed.) Handbook of Philosophical Logic 2, Reidel P.C. (1984), 479–604.
Keisler, H.J., Model Theory for Infinitary Logic, North-Holland (1971).
Kleene, S.C., Mathematical Logic, John Wiley and Sons (1967).
Kozen, D., Results on the propositional μ-calculus, T.C.S. 27 (1983), 333–354.
Meyer, A.R. and Mitchell, J.C., Termination Assertions for Recursive Programs: Completeness and Axiomatic Definiability, Inf. and Control 56 (1983), 112–138.
Pasztor, A., Nonstandard Algorithmic and Dynamic Logic, J. Symbolic Comput. 2 (1986), 59–81.
Pasztor, A., Recursive Programs and Denotational Semantics in Absolute Logics of Programs, Tech. Rep. FIU-SCS-87-1, Florida Int. Univ. (1987).
Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
Smullyan, R.M., First-order Logic, Springer-Verlag (1986).
Stoy, J., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press (1977).
Tarski, A., A Lattice Theoretical Fixpoint Theorem and its Applications, Pacific J. of Math. 5 (1955), 285–309.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gil-Luezas, A. (1989). A logic for nondeterministic functional programs extended abstract. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-51498-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51498-5
Online ISBN: 978-3-540-48180-5
eBook Packages: Springer Book Archive