Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism

ACM SIGPLAN Notices

Volumn 38, Issue 9, 2003, Pages 249-262

  Washburn, Geoffrey ^a   Weirich, Stephanie ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Catamorphism; Higher order abstract syntax; Modal type system; Parametric polymorphism; Parametricity

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; DATA STRUCTURES; ENCODING (SYMBOLS); FORMAL LOGIC; THEOREM PROVING;

CATAMORPHISM; HIGHER ORDER ABSTRACT SYNTAX; MODAL TYPE SYSTEM; PARAMETRIC POLYMORPHISM; PARAMETRICITY;

SYNTACTICS;

EID: 1442313298     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/944746.944728     Document Type: Conference Paper

References (31)

1. U. Acar, G. Blelloch, and R. Harper. Selective memoization. In Thirtieth ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages, New Orleans, LA, Jan. 2002.
2. S. Ambler, R. L. Crole, and A. Momigliano. Combining higer order abstract syntax with tactical theorem proving and (co)induction. In Theorem Proving in Higher Order Logics, 15th International Conference, TPHOLs 2002, Hampton, VA, USA, August 20-23, 2002, Proceedings, volume 2410 of Lecture Notes in Computer Science. Springer, 2002.
3. C. Böhm and A. Berarducci. Automatic synthesis of typed Λ-programs on term algebras. Theoretical Computer Science, 39:135-154, 1985.
4. A. Church. A formulation of the simple theory of types. Journal of Scientific Logic, 5:56-68, 1940.
5. D. Clarke, R. Hinze, J. Jeuring, A. Löh, and J. de Wit. The Generic Haskell user's guide. Technical Report UU-CS-2001-26, Utrecht University, 2001.
6. O. Danvy and A. Filinski. Representing control: a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, Dec. 1992.
7. R. Davies and F. Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555-604, May 2001.
8. J. Despeyroux and P. Leleu. Recursion over objects of functional type. Mathematical Structures in Computer Science, 11:555-572, 2001.
9. L. Fegaras and T. Sheard. Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space). In Twenty-Third ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 284-294, St. Petersburg Beach, FL, USA, 1996.
10. J.-Y. Girard. Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination de coupures dans l'analyse et la théorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63-92. North-Holland Publishing Co., 1971.
11. R. Hinze. Polytypic values possess polykinded types. Science of Computer Programming, 43(2-3):129-159, 2002. MPC Special Issue.
12. P. Johann. A generalization of short-cut fution and its correctness proof. Higher-Order and Symbolic Computation, 15:273-300, 2002.
13. M. P. Jones. A system of constructor classes: overloading and implicit higher-order polymorphism. Journal of Functional Programming, 5(1), Jan. 1995.
14. M. P. Jones. Type classes with functional dependencies. In Proceedings of the 9th European Symposium on Programming, ESOP 2000, Berlin, Germany, number 1782 in LNCS. Springer-Verlag, 2000.
15. E. Meijer, M. M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In FPCA91: Conference on Functional Programming Languages and Computer Architecture, pages 124-144, 1991.
16. E. Meijer and G. Hutton. Bananas in space: Extending fold and unfold to exponential types. In FPCA95: Conference on Functional Programming Languages and Computer Architecture, pages 324-333, La Jolla, CA, June 1995.
17. D. Miller. An extension to ML to handle bound variables in data structures: Preliminary report. In Proceedings of the Logical Frameworks BRA Workshop, May 1990.
18. A. Nanevski. Meta-programming with names and necessity. In Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pages 206-217. ACM Press, 2002.
19. S. Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
20. F. Pfenning and R. Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11(4):511-540, Aug. 2001.
21. F. Pfenning and C. Elliott. Higher-order abstract syntax. In 1988 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 199-208, Atlanta, GA, USA, June 1988.
22. F. Pfenning and C. Schürmann. System description: Twelf-a meta-logical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, July 1999.
23. A. M. Pitts and M. Gabbay. A metalanguage for programming with bound names modulo renaming. In Mathematics of Program Construction, pages 230-255, 2000.
24. C. Schürmann, J. Despeyroux, and F. Pfenning. Primitive recursion for higher-order abstract syntax. Theoretical Computer Science, 266(1-2):1-58, Sept. 2001.
25. C. Schürmann, R. Fontana, and Y. Liao. Delphin: Functional programming with deductive systems. Available at http://cs-www.cs.yale.edu/homes/carsten/, 2002.
26. E. Sumii and N. Kobayashi. A hybrid approach to online and offline partial evaluation. Higher-Order and Symbolic Computation, 14(2/3):101-142, 2001.
27. V. Trifonov, B. Saha, and Z. Shao. Fully reflexive intensional type analysis. In Fifth ACM SIGPLAN International Conference on Functional Programming, pages 82-93, Montreal, Sept. 2000.
28. P. Wadler. Theorems for free! In FPCA89: Conference on Functional Programming Languages and Computer Architecture, London, Sept. 1989.
29. G. Washburn. Modal typing for specifying run-time code generation. Available from http://www.cis.upenn.edu/~geoffw/research/, 2001.
30. S. Weirich. Higher-order intensional type analysis in type-erasure semantics. Available from http://www.cis.upenn.edu/~sweirich/, 2003.
31. H. Xi, C. Chen, and G. Chen. Guarded recursive datatype constructors. In Thirtieth ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 224-235, New Orleans, LA, USA, Jan. 2003.