{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:32:07Z","timestamp":1730280727741,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470520","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["The Undecidability of System F Typability and Type Checking for Reductionists"],"prefix":"10.1109","author":[{"given":"Andrej","family":"Dudenhefner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"A Coq Library of Undecidable Problems","year":"0","author":"forster","key":"ref10"},{"key":"ref11","first-page":"2:1","article-title":"A simpler undecidability proof for system F inhabitation","volume":"130","author":"dudenhefner","year":"0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1988.5101"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"ref14","first-page":"9:1","article-title":"Undecidability of Semi-Unification on a Napkin","volume":"167","author":"dudenhefner","year":"0"},{"article-title":"The Coq proof assistant, version 8.12.0","year":"2020","author":"team","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.11.049"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3372885.3373816"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.07.013"},{"key":"ref19","first-page":"17:1","article-title":"A Certifying Extraction with Time Bounds from Coq to Call-By-Value Lambda Calculus","volume":"141","author":"forster","year":"0"},{"key":"ref4","volume":"149","author":"s\u00f8rensen","year":"2006","journal-title":"Lectures on the Curry- Howard Isomorphism"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800020025"},{"key":"ref6","first-page":"176","article-title":"Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and Undecidable","author":"wells","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567077"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(98)00047-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-06859-7_148"},{"key":"ref1","article-title":"Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur","author":"girard","year":"1972","journal-title":"Ph D Dissertation"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-004-6221-7"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","article-title":"Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the ChurchRosser theorem","volume":"75","author":"de bruijn","year":"1972","journal-title":"Indagationes Mathematicae (Proceedings)"},{"year":"0","key":"ref22","article-title":"The Coq Proof Assistant Reference Manual"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3293880.3294101"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796819000170"},{"key":"ref23","article-title":"Mechanising syntax with binders in Coq","author":"stark","year":"2020","journal-title":"Ph D Dissertation"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2021,6,29]]},"location":"Rome, Italy","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470520.pdf?arnumber=9470520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:22Z","timestamp":1652197582000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470520\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470520","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}