Advertisement

Deductive program synthesis and Markov's principle

  • A. A. Voronkov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hagiya M. A Proof Description Language and Its Reduction System. Publications of the Research Institute of Mathematics,1983,v.19,N 1, p.237–261.Google Scholar
  2. 2.
    R.L. Constable. Programs as Proofs: A Synopsis. — Information Processing Letters,1983,v.16,N 3,p. 105–112.Google Scholar
  3. 3.
    P.Martin-Löf. An Intuitionistic theory of Types,Predicative Part. In: Logic Colloquim'73, North-Holland,1975,p.73–118.Google Scholar
  4. 4.
    A.A.Voronkov. An Intuitionistic List Theory.(Russian)— In: Proc. 8-th USSR National Conf.on Mathematical Logic,Moscow Univ.,1986,p.32.Google Scholar
  5. 5.
    Y.L.Ershov. Enumeration Theory (Russian). — Nauka, 1977Google Scholar
  6. 6.
    A.I.Maltsev. Algorithms and Recursive Functions.(Russian)— Nauka, 1965.Google Scholar
  7. 7.
    A.A.Markov,N.M.Nagorny. Algorithm Theory (Russian). — Nauka, 1984.Google Scholar
  8. 8.
    A.A.Voronkov. Logic Program Synthesis (Russian).— Preprint N 24, Institute of Mathematics of the Siberian Branch of the USSR Academy of Sciences,1986.Google Scholar
  9. 9.
    J.Barwise. Admissible Sets and Structures. — Springer Verlag,1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • A. A. Voronkov
    • 1
  1. 1.Institute of MathematicsSiberian Branch of the USSR Academy of SciencesNovosibirsk

Personalised recommendations