Lics

ACM/IEEE Symposium on Logic in Computer Science

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

Thirty first Annual IEEE Symposium on

Logic in Computer Science (LICS 2016)

Paper: The Diagonal Problem for Higher-Order Recursion Schemes is Decidable (at LICS 2016)

Authors: Lorenzo Clemente Pawel Parys Sylvain Salvati Igor Walukiewicz

Abstract

No Abstract Available

BibTeX

  @InProceedings{ClementeParysSalvat-TheDiagonalProblemf,
    author = 	 {Lorenzo Clemente and Pawel Parys and Sylvain Salvati and Igor Walukiewicz},
    title = 	 {The Diagonal Problem for Higher-Order Recursion Schemes is Decidable},
    booktitle =  {Proceedings of the Thirty first Annual IEEE Symposium on Logic in Computer Science (LICS 2016)},
    year =	 {2016},
    month =	 {July}, 
    pages =      {96--105},
    location =   {New York City}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2022-10-3113:49
Sam Staton