What is an Algorithm? Extensional and Intensional Equivalences between Programs

Project Information

Walgo

Grant agreement ID: 655222

DOI

10.3030/655222

Project closed

EC signature date 2 March 2015

Start date 1 September 2015

End date 31 August 2017

Funded under

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Total cost

€ 200 194,80

EU contribution

€ 200 194,80

Coordinated by

KOBENHAVNS UNIVERSITET
Denmark

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (2)

More intensional versions of Rice's Theorem

Author(s): Jean-Yves Moyen Jakob Grue Simonsen
Published in: Developments in Implicit Computational Complexity, DICE'16, 2016
Publisher: Damiano Mazza

Loop Quasi-Invariant Chunk Detection

Author(s): Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Published in: International Symposium on Automated Technology for Verification and Analysis ATVA 2017, 2017, Page(s) 91-108
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-68167-2_7

Peer reviewed articles (2)

Computability in the Lattice of Equivalence Relations

Author(s): Jean-Yves Moyen, Jakob Grue Simonsen
Published in: Electronic Proceedings in Theoretical Computer Science, Issue 248, 2017, Page(s) 38-46, ISSN 2075-2180
Publisher: Guillaume Bonfante and Georg Möser
DOI: 10.4204/EPTCS.248.8

Loop Quasi-Invariant Chunk Motion by peeling with statement composition

Author(s): Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Published in: Electronic Proceedings in Theoretical Computer Science, Issue 248, 2017, Page(s) 47-59, ISSN 2075-2180
Publisher: Guillaume Bonfante and Georg Möser
DOI: 10.4204/EPTCS.248.9

Thesis and dissertations (1)

Implicit Complexity in Theory and Practice

Author(s): Jean-Yves Moyen
Published in: 2017
Publisher: University of Copenhagen