Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Thirteenth Annual IEEE Symposium on

Logic in Computer Science (LICS 1998)

Paper: Realizability for Constructive Theory of Functions and Classes and its Application to Program Synthesis (at LICS 1998)

Authors: Makoto Tatsuta

Abstract

This paper gives a q-realizability interpretation for Feferman's constructive theory T0 of functions and classes by using a set completion program without doubling variables, and proves its soundness. This result solves an open problem proposed by Feferman in 1979. Moreover by using this interpretation we can prove a program extraction theorem for T0, which enables us to use constructive sets of T0 for program synthesis

BibTeX

  @InProceedings{Tatsuta-RealizabilityforCon,
    author = 	 {Makoto Tatsuta},
    title = 	 {Realizability for Constructive Theory of Functions and Classes and its Application to Program Synthesis},
    booktitle =  {Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1998)},
    year =	 {1998},
    month =	 {June}, 
    pages =      {358--367},
    location =   {Indianapolis, IN, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2018-06-2121:59
Andrzej Murawski