The Diagonal Problem for Higher-Order Recursion Schemes is Decidable

Article Details
Title:	The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
Article URLs:	https://doi.org/10.1145/2933575.2934527 http://ieeexplore.ieee.org/document/8576412
Alternative Article URLs:
Authors:	Lorenzo Clemente	University of Warsaw
	Pawel Parys	University of Warsaw
	Sylvain Salvati	University of Bordeaux CNRS INRIA
	Igor Walukiewicz	University of Bordeaux CNRS INRIA
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/lics/ClementePSW16
Author Comments:

ACM/IEEE Logic in Computer Science, LICS 2016