×

Found 5 Documents (Results 1–5)

The complexity of the diagonal problem for recursion schemes. (English) Zbl 1491.68101

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 45, 14 p. (2018).
MSC:  68Q45 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Recursion schemes and the WMSO+U logic. (English) Zbl 1491.03010

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 53, 16 p. (2018).
MSC:  03B25 03D05 03B40
PDFBibTeX XMLCite
Full Text: DOI

The diagonal problem for higher-order recursion schemes is decidable. (English) Zbl 1401.68158

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 96-105 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the significance of the collapse operation. (English) Zbl 1360.68569

Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25–28, 2012. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4769-5). 521-530 (2012).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field

Software