Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Horn programs and semicomputable relations on abstract structures

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 372))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • J. Barwise (1975). Admissible Sets and Structures, Springer-Verlag, Berlin, Heidelberg, New York.

    Google Scholar 

  • A.G. Cohn (1987). A more expressive formulation of many-sorted logic, J. Automated Reasoning, 3, 113–200.

    Article  Google Scholar 

  • M. Fitting (1981). Fundamentals of Generalized Recursion Theory, North-Holland, Amsterdam.

    Google Scholar 

  • M. Fitting (1987). Computability Theory, Semantics and Logic Programming, Oxford University Press.

    Google Scholar 

  • J.A. Goguen, J. Meseguer (1984). Equality, types, modules and (why not?) generics for logic programming, J. Logic Programming, 2, 179–210.

    Article  Google Scholar 

  • J.A. Goguen, J.W. Thatcher, E.G. Wagner (1978). An initial approach to the specification, correctness and implementation of abstract data types. 80–149 in: Current Trends in Programming Methodology, vol. 4: Data Structuring (ed. R.T. Yeh), Prentice-Hall, Englewood Cliffs, NJ.

    Google Scholar 

  • C.E. Gordon (1970). Comparisons between some generalizations of recursion theory, Compositio Mathematica22, 333–346.

    Google Scholar 

  • S.C. Kleene (1952). Introduction to Metamathematics, North-Holland, Amsterdam.

    Google Scholar 

  • J.W. Lloyd (1987). Foundations of Logic Programming (Second edition), Springer-Verlag, Berlin, Heidelberg, New York.

    Google Scholar 

  • A.I. Mal'cev (1973). Algebraic Systems, Springer-Verlag, Berlin, Heidelberg, New York.

    Google Scholar 

  • R. Montague (1968). Recursion theory as a branch of model theory. 63–86 in: Logic, Methodology and Philosophy of Science III (ed. B. van Rootselaar and J.F. Staal), North-Holland, Amsterdam.

    Google Scholar 

  • Y.N. Moschovakis (1969). Abstract First Order Computability. I, Trans. AMS138, 427–464.

    Google Scholar 

  • J. Sebelik, P. Stepánek (1982). Horn clause programs for recursive functions. 325–340 in: Logic Programming (eds. K.J. Clark and S.Ã…. Tärnlund), Academic Press, London.

    Google Scholar 

  • S.Ã…. Tärnlund (1977). Horn clause computability, BIT17, 215–226.

    Article  Google Scholar 

  • J.V. Tucker, J.I. Zucker (1988). Program Correctness over Abstract Data Types, with Error-State Semantics. CWI Monograph Series, North-Holland and the Centre for Mathematics and Computer Science (CWI), Amsterdam.

    Google Scholar 

  • C Walther (1987). A Many-sorted Calculus based on Resolution and Paramodulation, Pitman, London.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University College of Swansea, Swansea SA2 Wales

    J. V. Tucker

  2. Department of Computer Science, SUNY-Buffalo, 14260, Buffalo, NY, USA

    J. I. Zucker

Authors
  1. J. V. Tucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. I. Zucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tucker, J.V., Zucker, J.I. (1989). Horn programs and semicomputable relations on abstract structures. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035796

Download citation

  • DOI: https://doi.org/10.1007/BFb0035796

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation