An implicit characterization of the polynomial-time decidable sets by cons-free rewriting

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

OriginalsprogEngelsk
TitelRewriting and typed lambda calculi : Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings
RedaktørerGilles Dowek
Antal sider15
ForlagSpringer Science+Business Media
Publikationsdato2014
Sider179-193
ISBN (Trykt)978-3-319-08917-1
ISBN (Elektronisk)978-3-319-08918-8
DOI
StatusUdgivet - 2014
BegivenhedJoint International Conference, RTA-TLCA 2014 - Vienna, Østrig
Varighed: 14 jul. 201417 jul. 2014

Konference

KonferenceJoint International Conference, RTA-TLCA 2014
LandØstrig
ByVienna
Periode14/07/201417/07/2014
NavnLecture notes in computer science
Vol/bind8560
ISSN0302-9743

ID: 132043229