This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
Y. Bertot & P. Casteran (2004) Interactive Theorem Proving and Program Development. Springer-Verlag.
R. Bird & J. Gibbons (2003) Arithmetic coding with folds and unfolds. In Advanced Functional Programming 4, J. Jeuring & S. Peyton Jones (eds), Lecture Notes in Computer Science, vol. 2638. Springer-Verlag, pp. 1–26.
R. D. Cameron (1988) Source encoding using syntactic information source models. IEEE Trans. Inf. Theory 34 (4), 843–850.
K. Claessen & J. Hughes (2000) Quickcheck: A lightweight tool for random testing of Haskell programs. In ICFP '00: Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming. New York: ACM, pp. 268–279.
J. F. Contla (1985) Compact coding of syntactically correct source programs. Softw. Pract. Exper. 15, 625–636.
D. Coutts , R. Leshchinskiy & D. Stewart (2007) Stream fusion: From lists to streams to nothing at all. In ICFP '07: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming. New York: ACM, pp. 315–326.
P. Elias (1975) Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21 (2), 197–203.
K. Fisher , Y. Mandelbaum & D. Walker (2006) The next 700 data description languages. SIGPLAN Not. 41 (1), 2–15.
J. Gibbons (2007) Datatype-generic programming. In Datatype-Generic Programming, R. Backhouse , J. Gibbons , R. Hinze & J. Jeuring (eds), LNCS, vol. 4719. Berlin, Heidelberg: Springer, pp. 1–71.
V. Haldar , C. H. Stork & M. Franz (2002) The source is the proof. In NSPW '02: Proceedings of the 2002 Workshop on New Security Paradigms. New York: ACM, pp. 69–73.
D. E. Knuth (1992) Axioms and Hulls, LNCS, vol. 606. Springer-Verlag.
G. C. Necula & P. Lee (1998) The design and implementation of a certifying compiler. In PLDI '98: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation. New York: ACM, pp. 333–344.
G. C. Necula & S. P. Rahul (2001) Oracle-based checking of untrusted software. In POPL'01: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. New York: ACM, pp. 142–154.
L. Nielsen & F. Henglein (2011) Bit-coded regular expression parsing. In Proceedings of the 5th Int'l Conference on Language and Automata Theory and Applications (LATA), LNCS, vol. 6638. Springer, pp. 402–413.
M. H. Palka , K. Claessen , A. Russo & J. Hughes (2011) Testing an optimising compiler by generating random lambda terms. In Proceedings of the 6th International Workshop on Automation of Software Test (AST), AST '11. New York: ACM, pp. 91–97.
T. Rendel & K. Ostermann (2010) Invertible syntax descriptions: unifying parsing and pretty printing. SIGPLAN Not. 45, 1–12.
D. Salomon (2008) A Concise Introduction to Data Compression, Undergraduate Topics in Computer Science. Springer.
M. H. Sørensen & P. Urzyczyn (2006) Lectures on the Curry-Howard Isomorphism (Studies in Logic and the Foundations of Mathematics, Volume 149). New York: Elsevier Science.