Abstract
A string-formatting function such as printf in C seemingly requires dependent
types, because its control string determines the rest of its arguments. Examples:formula hereWe show how changing the representation of the control string makes it possible to program
printf in ML (which does not allow dependent types). The result is well typed and perceptibly
more efficient than the corresponding library functions in Standard ML of New Jersey and
in Caml.
Publisher
Cambridge University Press (CUP)
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Generic level polymorphic n-ary functions;Proceedings of the 4th ACM SIGPLAN International Workshop on Type-Driven Development - TyDe 2019;2019
2. Typed Embedding of a Relational Language in OCaml;Electronic Proceedings in Theoretical Computer Science;2018-12-31
3. Partially-static data as free extension of algebras;Proceedings of the ACM on Programming Languages;2018-07-30
4. Selective CPS transformation for shift and reset;Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM '18;2018
5. Selective CPS transformation for shift and reset;Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation;2017-12-25