Adapting calculational logic to the undefined

Computer Journal

Volumn 42, Issue 2, 1999, Pages 73-81

  Schieder, Birgit ^a   Broy, Manfred ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; EQUIVALENCE CLASSES; MANY VALUED LOGICS; RECURSIVE FUNCTIONS; THEOREM PROVING;

PARTIAL FUNCTIONS;

COMPUTATIONAL METHODS;

EID: 0032646726     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/42.2.73     Document Type: Article

References (23)

1. Dijkstra, E. W. and Scholten, C. S. (1990) Predicate Calculus and Program Semantics. Springer, New York.
2. Gries, D. and Schneider, F. B. (1993) A Logical Approach to Discrete Math. Springer, New York.
3. Andréka, H., Craig, W. and Németi, I. (1988) A system of logic for partial functions under existence-dependent Kleene equality. J. Symbolic Logic, 53, 834-839.
4. Barringer, H., Cheng, J. H. and Jones, C. B. (1984) A logic covering undefinedness in program proofs. Acta Informatica, 21, 251-269.
5. Bijlsma, A. (1990) Semantics of quasi-boolean expressions. In Feijen, W. H. J., van Gasteren, A. J. M., Gries, D. and Misra, J. (eds), Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra, pp. 27-35. Springer, New York.
6. Blikle, A. (1991) Three-valued predicates for software specification and validation. Fundamenta Informaticae, XIV, 387-410.
7. Boyer, R. S. and Moore, J. S. (1988) The addition of bounded quantification and partial functions to a computational logic and its theorem prover. J. Automated Reasoning. 4, 117-172.
8. Cheng, J. H. and Jones, C. B. (1991) On the usability of logics which handle partial functions. In Morgan, C. and Woodcock, J. C. P. (eds), Third Refinement Workshop (Workshops in Computing Series), pp. 51-69. Springer, London.
9. Constable, R. L. (1983) Partial Functions in Constructive Formal Theories. Technical Report TR 83-549, Department of Computer Science, Cornell University.
10. Elvang-Gøransson, M. and Owe, O. (1993) A simple sequent calculus for partial functions. Theoret. Comp. Sci., 114, 317-330.
11. Gavilanes-Franco, A. and Lucio-Carrasco, F. (1990) A first order logic for partial functions. Theor. Comp. Sci., 74, 37-69.
12. Gavilanes-Franco, A., Lucio-Carrasco, F. and Rodríguez-Artalejo, M. (1993) Reasoning with higher order partial functions. In Börger, E., Jäger, G., Kleine Büning, H., Martini, S. and Richter, M. M. (eds), Computer Science Logic (Lecture Notes in Computer Science vol. 702), pp. 167-181. Springer, Berlin.
13. Gries, D. (1997) Foundations for calculational logic. In Broy, M. and Schieder, B. (eds), Mathematical Methods in Program Development (NATO ASI Series F: Computer and System Sciences vol. 158), pp. 83-126. Springer, Berlin.
14. Gries, D. and Schneider, F. B. (1995) Avoiding the Undefined by Underspecification. Technical Report TR 95-1520, Department of Computer Science, Cornell University.
15. Hoogewijs, A. (1987) Partial-predicate logic in computer science. Acta Informatica, 24, 381-393.
16. Jones, C. B. and Middelburg, C. A. (1994) A typed logic of partial functions reconstructed classically. Acta Informatica, 31, 399-430.
17. Jones, C. B. (1995) Partial functions and logics: A warning. Inform. Process. Lett., 54, 65-67.
18. Kleene, S. C. (1952) Introduction to Metamathematics (Bibliotheca Mathematica vol. 1). North-Holland, Amsterdam.
19. Konikowska, B., Tarlecki, A. and Blikle, A. (1991) A three-valued logic for software specification and validation. Fundamenta Informaticae, XIV, 411-453.
20. Owe, O. (1993) Partial logics reconsidered: A conservative approach. Formal Aspects of Computing, 5, 208-223.
21. Paulson, L. C. (1987) Logic and Computation: Interactive Proof with Cambridge LCF (Cambridge Tracts in Theoretical Computer Science vol. 2). Cambridge University Press, Cambridge, UK.
22. Tennent, R. D. (1987) A note on undefined expression values in programming logics. Inform. Process. Lett., 24, 331-333.
23. Tarski, A. (1955) A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math., 5, 285-309.