Functional pearl: Every bit counts

ACM SIGPLAN Notices

Volumn 45, Issue 9, 2010, Pages 15-26

  Vytiniotis, Dimitrios ^a   Kennedy, Andrew J ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DATA; BINARY ENCODINGS;

CALCULATIONS; DECODING; SET THEORY;

ENCODING (SYMBOLS);

EID: 79551669359     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1932681.1863548     Document Type: Conference Paper

References (22)

1. Y. Bertot and P. Casteran. Interactive Theorem Proving and Program Development. Springer-Verlag, 2004.
2. R. Bird and J. Gibbons. Arithmetic coding with folds and unfolds. In J. Jeuring and S. Peyton Jones, editors, Advanced Functional Programming 4, volume 2638 of Lecture Notes in Computer Science, pages 1-26. Springer-Verlag, 2003. Code available at http://www.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/ publications/arith.zip.
3. J. Cheney. Statistical models for term compression. In DCC'00: Proceedings of the Conference on Data Compression, page 550, Washington, DC, USA, 2000. IEEE Computer Society.
4. K. Claessen and J. Hughes. Quickcheck: a lightweight tool for random testing of Haskell programs. In ICFP'00: Proceedings of the fifth ACM SIGPLAN International Conference on Functional Programming, pages 268-279, New York, NY, USA, 2000. ACM.
5. D. Coutts, R. Leshchinskiy, and D. Stewart. Stream fusion: from lists to streams to nothing at all. In ICFP'07: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, pages 315-326, New York, NY, USA, 2007. ACM.
6. J. Duan, J. Hurd, G. Li, S. Owens, K. Slind, and J. Zhang. Functional correctness proofs of encryption algorithms. In Logic for Programming, Artificial Intelligence and Reasoning (LPAR), volume 3835 of LNCS, pages 519-533. Springer, 2005.
7. ECMA. Standard ECMA-335: Common language infrastructure (CLI), 2006.
8. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, 21(2):197-203, 1975.
9. K. Fisher, Y. Mandelbaum, and D. Walker. The next 700 data description languages. SIGPLAN Not., 41(1):2-15, 2006.
10. M. Franz, V. Haldar, C. Krintz, and C. H. Stork. Tamper-proof annotations by construction. Technical Report 02-10, Dept of Information and Computer Science, University of California, Irvine, March 2002.
11. N. Ghani, P. Hancock, and D. Pattinson. Representations of stream processors using nested fixed points. Logical Methods in Computer Science, 5(3), 2009.
12. J. Gibbons. Datatype-generic programming. In R. Backhouse, J. Gibbons, R. Hinze, and J. euring, editors, Datatype-Generic Programming, volume 4719 of LNCS, chapter 1, pages 1-71. Springer, Berlin, Heidelberg, 2007.
13. V. Haldar, C. H. Stork, and M. Franz. The source is the proof. In NSPW'02: Proceedings of the 2002 workshop on New security paradigms, pages 69-73, New York, NY, USA, 2002. ACM.
14. R. Hinze, J. Jeuring, and A. Löh. Comparing approaches to generic programming in Haskell. In Spring School on Datatype-Generic Programming, 2006.
15. S. Holdermans, J. Jeuring, A. Löh, and A. Rodriguez. Generic views on data types. In In T. Uustalu, editor, Proceedings of the 8th International Conference on Mathematics of Program Construction, MPC06, volume 4014 of LNCS, pages 209-234. Springer, 2006.
16. A. J. Kennedy. Functional Pearl: Pickler Combinators. Journal of Functional Programming, 14(6):727-739, October 2004.
17. G. C. Necula and P. Lee. The design and implementation of a certifying compiler. In PLDI'98: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, pages 333-344, New York, NY, USA, 1998. ACM.
18. G. C. Necula and S. P. Rahul. Oracle-based checking of untrusted software. In POPL'01: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 142-154, New York, NY, USA, 2001. ACM.
19. D. Salomon. A Concise Introduction to Data Compression. Undergraduate Topics in Computer Science. Springer, 2008.
20. M. H. Sørensen and P. Urzyczyn. Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics). Elsevier Science Inc., New York, NY, USA, 2006.
21. M. Sozeau. Subset coercions in Coq. In Selected papers from the International Workshop on Types for Proofs and Programs (TYPES'06), pages 237-252. Springer, 2006.
22. M. Sulzmann, M. Chakravarty, and S. Peyton Jones. System F with type equality coercions. In ACM Workshop on Types in Language Design and Implementation (TLDI). ACM, 2007.