Context patterns in haskell

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1268, Issue , 1997, Pages 41-57

  Mohnen, Markus ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; SEMANTICS;

CONTEXT PATTERNS; FUNCTIONAL LANGUAGES; HASKELL; HASKELL PROGRAMS; NONLOCAL; SUBTERMS; TYPICAL APPLICATION;

COMPUTATIONAL LINGUISTICS;

EID: 84957709454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63237-9_18     Document Type: Conference Paper

References (25)

1. Bar85[] H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and The Foundations of Mathematics. North-Holland, 1985.
2. BvELP87[] T. Brus, M. van Ecklen, M. Van Leer, and M. Plasmeijer. Clean - A Language for Functional Graph Rewriting. In G. Kahn, editor, Proc-cedings of the 3rd Conference on Functional Programming Languages and Computer Architecture (FPCA), number 274 in Lecture Notes in Computer Science, pages 364-384. Springer-Verlag, September 1987.
3. [DJ95] D. J. Dougherty and P. Johann. A Combinatory Approach to Higher- Order E-Unification. Theoretical Computer Science, 139(1-2):207-242, March 1995.
4. [DM90] P. Deransart and J. Maluszyliski, editors. Proccedings of the 2nd Inter- national Workshop on Programming Language Implementation and Logic Programming (PLILP), number 456 in Lecture Notes in Computer Science. Springer-Verlag, 1990.
5. Fer90[] C. Ferdinand. Pattern Matching in a Functional Transformational Lan- guage using Treeparsing. In Deransart and Maluszyliski [DM90], pages 358-371.
6. Go181[] W. D. Goldfarb. The Undecidability of the Second-Order Unification Problem. Theoretical Computer Science, 13(2):225-230, February 1981.
7. Hec88[] R. Heckmann. A Functional Language for the Specification of Com- plex Tree Transformations. In H. Ganzinger, editor, Proccedings of the 2nd International Symposium on European Symposium on Programming (ESOP), number 300 in Lecture Notes in Computer Science, pages 175-190. Springer-Verlag, 1988.
8. [HF92] P. Hudak and J. H. Fasel. A Gentle Introduction to Haskell. Technical report, Department of Computer Science, 1992.
9. [HKMN95] M. Hanus, H. Kuchen, and J. J. Moreno-Navarro. Curry: A Truly Functional Logic Language. In Proc. ILPS'95 Workshop on Visions for the Future of Logic Programming, pages 95-107, 1995.
10. [HL78] G. Huet and B. Lang. Proving and applying Program Transformations Expressed with Second Order Patterns. Acta Informatica, 11:31-55, 1978.
11. [HPW92] P. Hudak, S. L. Peyton Jones, and P. Wadler et. al. Report on the Pro- gramming Language Haskell — A Non-strict, Purely Functional Language. Research Report 1.2, Department of Computer Science and Department of Computing Science, March 1992.
12. Hue75[] G. Huet. A Unification Algorithm for Typed A-Calculus. Theoretical Computer Science, 1:27-57, 1975.
13. Hug86[] R. J. M. Huges. A Novel Representation of Lists and Its Apllication to the Function "reverse". Information Processing Letters, 22(3):141-144, March 1986.
14. [KLMNRA96] H. Kuchen, R. Loogen, J.J. Moreno-Navarro, and M. Rodriguez-Artalejo. The Functional Logic Language BABEL and its Implementation on a Graph Machine. New Generation Computing, 14:391-427, 1996.
15. Mi184[] R. Milner. The standard ML core language. Dept Computer Science, University of Edinburgh, 1984.
16. MT97[] M. Mohnen and S. Tobies. Implementing Context Patterns in the Glas- gow Haskell Compiler. Technical Report AIB-97-04, RWTH Aachen, 1997. to be published.
17. [OW97] M. Odersky and P. Wadler. Pizza into Java: Translating theory into practice. In Proceedings of the 24th Symposium on Principles of Programming Languages (POPL), pages 146-159. ACM, January 1997.
18. Pey87[] S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.
19. Pey96[] S. L. Peyton Jones. Compiling Haskell by Program Transformations: A Report from the Trenches. In H. R. Nielson, editor, Proceedings of the 6th International Symposium on European Symposium on Programming (ESOP), number 1058 in LNCS, pages 18-44. Springer—Verlag, 1996.
20. Pre94[] C. Prehofer. Decidable Higher-order Unification Problems. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction (CADE), number 814 in Lecture Notes in Computer Science, pages 635-649. Springer—Verlag, 1994.
21. [PS94] S. L. Peyton Jones and A. Santos. Compilation by Transformation in the Glasgow Haskell Compiler. In Functional Programming, Glasgow 1994, Workshops in Computing. Springer—Verlag, 1994.
22. Que90[] C. Queinnec. Compilation of Non-Linear, Second Order Patterns on S-Expressions. In Deransart and Maluszynski EDM901, pages 340-357.
23. SG89[] W. Snyder and J. Gallier. Higher Order Unification Revisited: Complete Sets of Tranformations. Journal of Symbolic Computation, 8(1-2):101-140,1989. unification. Part two.
24. IThi931 P. Thiemann. Avoiding repeated tests in pattern matching. In P. Cousot, M. Falaschi, G. File, and A. Rauzy, editors, Proceedings of the 3rd International Workshop on Static Analysis (WSA), number 724 in Lecture Notes in Computer Science, pages 141-152. Springer—Verlag, 1993.
25. Wil90[] R. Wilhelm. Tree Transformations, Functional Languages, and Attrib- ute Grammars. In P. Deransart and M. Jourdan, editors, Attribute Grammars and their Applications, number 461 in LNCS, pages 116-129. Springer—Verlag, 1990.