@inproceedings{'Mon4',
title = {{Proof pearl: From concrete to functional unparsing} },
author = {Monin, Jean-Fran\c{c}ois},
month = {September},
year = {2004},
booktitle = {{Theorem Proving in Higher Order Logics (17th International Conference on TPHOLs 2004)}},
address = {Park City, Utah, USA},
pages = {217--224},
publisher = {Springer Verlag},
series = {LNCS},
volume = {3223},
team = {PACSS},
ps = {Docs/http://www-verimag.imag.fr/~monin/Publis/tphols04.ps},
pdf = {Docs/http://www-verimag.imag.fr/~monin/Publis/tphols04.pdf},
abstract = {We provide a proof that the elegant trick of Olivier Danvy for expressing printf-like functions without dependent types is correct, where formats are encoded by functional expressions in continuation-passing style. Our proof is formalized in the Calculus of Inductive Constructions. We stress a methodological point: when one proves equalities between functions, a common temptation is to introduce a comprehension axiom and then to prove that the considered functions are extensionally equal. Rather than weakening the result (and adding an axiom), we prefer to strenghten the inductive argumentation in order to stick to the intensional equality.},
}
