Scrap your nameplate (functional pearl)

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2005, Pages 180-191

  Cheney, James ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Binding; Generic programming; Names; Substitution

Indexed keywords

ABSTRACT SYNTAX; BINDING; FREE VARIABLE; GENERIC PROGRAMMING; NAME-BINDING; NAMES; RECENT RESEARCHES; SET FUNCTION;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; FUNCTIONAL PROGRAMMING; SUBSTITUTION REACTIONS; SYNTACTICS;

NAMEPLATES;

EID: 32044455559     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1086365.1086389     Document Type: Conference Paper

References (35)

1. Glasgow Parallel Haskell, June 2005. http://www.macs.hw.ac.uk/-~dsg/gph/.
2. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
3. Andrea Asperti and Stefano Guerrini. The Optimal Implementation of Functional Programming Languages. Cambridge University Press, 1999.
4. Lennart Augustsson, Mikael Rittri, and Dan Synek. On generating unique names. J. Funct. Program., 4(1):117-123, 1994.
5. Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, and Steve Zdancewic. Mechanized metatheory for the masses: The POPLmark Challenge. In Proceedings of the Eighteenth International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005), 2005. To appear.
6. Manuel M. T. Chakravarty, Gabriele Keller, Simon Peyton Jones, and Simon Marlow. Associated types with class. In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pages 1-13, New York, NY, USA, 2005. ACM Press.
7. J. Cheney and C. Urban. Alpha-Prolog: A logic programming language with names, binding and alpha-equivalence. In Proc. 20th Int. Conf. on Logic Programming (ICLP 2004), number 3132 in LNCS, pages 269-283, 2004.
8. Koen Claessen and John Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming (ICFP 2000), pages 268-279. ACM, 2000.
9. N. G. de Bruijn. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Mathematicae, 34(5):381-392, 1972.
10. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In Giuseppe Longo, editor, Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, pages 193-202, Washington, DC, 1999. IEEE, IEEE Press.
11. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
12. Ralf Hinze. Generics for the masses. In ICFP '04: Proceedings of the ninth ACM SIGPLAN International Conference on Functional Programming, pages 236-243, New York, NY, USA, 2004. ACM Press.
13. Ralf Hinze and Simon Peyton Jones. Derivable type classes. In Graham Hutton, editor, Proceedings of the 2000 ACM SIGPLAN Haskell Workshop, volume 41.1 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001.
14. J. Hughes. Restricted data types in Haskell. In E. Meijer, editor, Proceedings of the 1999 Haskell Workshop, number UU-CS-1999-28 in Technical report, Utrecht University, Department of Computer Science, 1999.
15. Simon Peyton Jones and Simon Marlow. Secrets of the Glasgow Haskell Compiler inliner. Journal of Functional Programming, 12(4):393-434, July 2002.
16. Ralf Lämmel. Towards generic refactoring. In Proc. of Third ACM SIGPLAN Workshop on Rule-Based Programming RULE'02, Pittsburgh, USA, 2002. ACM Press. 14 pages.
17. Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate: a practical design pattern for generic programming. In TLDI '03: Proceedings of the 2003 ACM SIGPLAN international workshop on Types in Language Design and Implementation, pages 26-37, New York, NY, USA, 2003. ACM Press.
18. Ralf Lämmel and Simon Peyton Jones. Scrap more boilerplate: reflection, zips, and generalised casts. In ICFP '04: Proceedings of the ninth ACM SIGPLAN International Conference on Functional Programming, pages 244-255, New York, NY, USA, 2004. ACM Press.
19. Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate with class. In Benjamin Pierce, editor, Proceedings of the 10th International Conference on Functional Programming (ICFP 2005), Tallinn, Estonia, 2005.
20. Andres Löh and Johan Jeuring (editors). The Generic Haskell user's guide, version 1.42 - coral release. Technical Report UU-CS-2005-004, Utrecht University, 2005.
21. Conor McBride. First-Order Unification by Structural Recursion. Journal of Functional Programming, 13(6):1061-1075, 2003.
22. James McKinna and Robert Pollack. Some lambda calculus and type theory formalized. J. Autom. Reason., 23(3):373-409, 1999.
23. G. Nadathur and D. Miller. Higher-order logic programming. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, chapter 8, pages 499-590. Oxford University Press, 1998.
24. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI '89), pages 199-208. ACM Press, 1989.
25. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 183:165-193, 2003.
26. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In R. Backhouse and J. N. Oliveira, editors, Proc. 5th Int. Conf. on Mathematics of Programme Construction (MPC2000), number 1837 in Lecture Notes in Computer Science, pages 230-255, Ponte de Lima, Portugal, July 2000. Springer-Verlag.
27. François Pottier. An overview of Cαml, June 2005. Available at http://cristal.inria.fr/~fpottier/publis/-fpottier-alphacaml.pdf.
28. Tim Sheard, March 2005. Personal communication.
29. Tim Sheard and Simon Peyton Jones. Template meta-programming for Haskell. In Haskell '02: Proceedings of the ACM SIGPLAN workshop on Haskell, pages 1-16, New York, NY, USA, 2002. ACM Press.
30. M. R. Shinwell, A. M. Pitts, and M. J. Gabbay. FreshML: Programmming with binders made simple. In Proc. 8th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP 2003), pages 263-274, Uppsala, Sweden, 2003. ACM Press.
31. Olin Shivers and Mitchell Wand. Bottom-up-reduction: Uplinks and-DAGs. In M. Sagiv, editor, Proceedings of the 14th European Symposium on Programming (ESOP 2005), number 3444 in LNCS, pages 217-232, 2005.
32. J. Staples, P. J. Robinson, R. A. Paterson, R. A. Hagen, A. J. Craddock, and P. C. Wallis. Qu-Prolog: An extended Prolog for meta level programming. In Harvey Abramson and M. H. Rogers, editors, Meta-Programming in Logic Programming, chapter 23. MIT Press, 1996.
33. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. Theoretical Computer Science, 323(1-3):473-497, 2004.
34. C. Urban and C. Tasson. Nominal techniques in Isabelle/HOL. In Proceedings of the 20th International Conference on Automated Deduction (CADE 2005), 2005. To appear.
35. Phil Wadler, Andrew Pitts, and Koen Claessen, September 2003. Personal communication.