Published in: LIPIcs, Volume 15, 23rd International Conference on Rewriting Techniques and Applications (RTA'12) (2012)
Denis Cousineau and Olivier Hermant. A Semantic Proof that Reducibility Candidates entail Cut Elimination. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 133-148, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{cousineau_et_al:LIPIcs.RTA.2012.133, author = {Cousineau, Denis and Hermant, Olivier}, title = {{A Semantic Proof that Reducibility Candidates entail Cut Elimination}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {133--148}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.133}, URN = {urn:nbn:de:0030-drops-34899}, doi = {10.4230/LIPIcs.RTA.2012.133}, annote = {Keywords: cut elimination, reducibility candidates, (pre-)Heyting algebras} }
Feedback for Dagstuhl Publishing