The intensional content of Rice's theorem
From MaRDI portal
Publication:3189831
DOI10.1145/1328438.1328455zbMath1295.03025OpenAlexW1975754030MaRDI QIDQ3189831
Publication date: 12 September 2014
Published in: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1328438.1328455
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Reverse complexity ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ A formalization of multi-tape Turing machines ⋮ Intensional Kleene and Rice theorems for abstract program semantics ⋮ Subrecursive equivalence relations and (non-)closure under lattice operations
This page was built for publication: The intensional content of Rice's theorem
