Logic of Programs 1985: Logics of Programs pp 106-117 | Cite as

A Hoare Calculus for functions defined by recursion on higher types

  • Andreas Goerdt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 193)


Base Type Free Variable High Type Application Rule Operation Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Cl 79.
    E.M. Clarke, Programming language constructs for which it is impossible to obtain good Hoare — like axioms, JACM 26, 129–147, (1979)Google Scholar
  2. ClGeHa 82.
    E.M. Clarke, S.M. German, J.Y. Halpern, On effective axiomatizations of Hoare logics, Proceedings 9th POPL, 309–321, (1982)Google Scholar
  3. DaJo 83.
    W. Damm, B. Josko, A sound and relatively* complete Hoare-Logic for a language with higher type procedures, Acta Informatica 20, 59–101, (1983)Google Scholar
  4. dBMeKl 82.
    J.W. deBakker, J.-J.Ch. Meyer, J.W. Klop, Correctness of programs with function procedures, Proceedings Logics of programs, LNCS 134, 94–112, (1982)Google Scholar
  5. ErNaOg 82.
    G.W. Ernst, J.K. Navlakha, W.F. Ogden, Verification of programs with procedure type parameters, Acta Informatica 18, 149–169, (1982)Google Scholar
  6. GeClHa 83.
    S.M. German, E.M. Clarke, J.Y. Halpern, Reasoning about procedures as parameters, Proceedings Logics of programs, LNCS 164, 206–220, (1983)Google Scholar
  7. Go 85.
    A. Goerdt, Ein Hoare Kalkül für getypte λ-Terme — Korrektheit, Vollständigkeit, Anwendungen, RWTH AachenGoogle Scholar
  8. Jo 84.
    B. Josko, On expressive interpretations of a Hoare-logic for Clarke's language L 4, STACS 1984, LNCS 166, 73–84, (1984)Google Scholar
  9. Ka 79.
    A. Kanda, Effektive solutions of recursive domain equations, Thesis Warwick, (1979)Google Scholar
  10. La 83.
    H. Langmaack, Aspects of programs with finite modes, FCT 83, LNCS 158, 241–254, (1983)Google Scholar
  11. Ol 84.
    E.-R. Olderog, Correctness of programs with PASCAL — like procedures without global variables, TCS 30, 49–90, (1984)Google Scholar
  12. Si 81.
    M. Sintzoff, Proof — oriented and applicative valuations in definitions of algorithms, Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, 155–162, (1981)Google Scholar
  13. Ur 83.
    P. Urzyczyn, A necessary and sufficient condition in order that a Herbrand interpretation is expressive relative to recursive programs, Information and Control 56, 212–219, (1983)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Andreas Goerdt
    • 1
  1. 1.Lehrstuhl für Informatik II RWTH AachenAachenWest-Germany

Personalised recommendations