Johan Jeuring
- 1.A.V. Aho and M.J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333-340, 1975. Google Scholar
Digital Library
- 2.T.P. Baker. A technique for extending rapid exactmatch string matching to arrays of more than one dimension. SIAM Journal on Computing, 7(4):533-541, 1978.Google ScholarCross Ref
- 3.Richard Bird, Oege de Moor, and Paul Hoogendijk. Generic programming with relations and functors. Submitted for publication, 1993.Google Scholar
- 4.R.S. Bird. Two dimensional pattern matching. Information Processing Letters, 6(5):168-170, 1977.Google ScholarCross Ref
- 5.R.S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming'and Calculi of Discrete Design, volume F36 of NATO ASI Series, pages 5-42. Springer-Verlag, 1987. Google ScholarDigital Library
- 6.R~.S. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, volume F55 of NATO ASI Series, pages 151-216. Springer-Verlag, 1989.Google Scholar
- 7.J. Cat, R. Paige, and R. Tarjan. More efficient bottomup tree pattern matching. In Proceedings 15th Colloquium on Trees in Algebra and Programming, pages 72- 86, 1990. LNCS 431. Google ScholarDigital Library
- 8.T. Hagino. Category Theoretic Approach to Data Types. PhD thesis, University of Edinburgh, 1987.Google Scholar
- 9.C.M. Hoffmann and M.J. O'Donnell. Pattern matching in trees. Journal of the ACM, 29(1):68-95, 1982. Google ScholarDigital Library
- 10.James Hook and Tim Sheard. A semantics of compiletime reflection. Oregon Graduate institute of Science and Technology, Beaverton, OR, USA, 1993.Google Scholar
- 11.P. Hudak, S.L. Peyton Jones, and P. Wadler (eds.). Report on the programming language Haskell, version 1.2. A CM SIGPLAN notices, 27(5), May 1992. Google ScholarDigital Library
- 12.C. Barry Jay and J.R.B. Cockett. Shapely types and shape polymorphism. In Donald Sannella, editor, Proceedings Programming Languages and Systems-ESOP '9d, pages 302-316. Springer-Verlag, 1994. LNCS 788. Google ScholarDigital Library
- 13.J. Jeuring. Algorithms from theorems. In M. Broy and C.B. Jones, editors, Programming Concepts and Methods, pages 247-266. North-Holland, 1990.Google Scholar
- 14.J. Jeuring. The derivation of a hierarchy of algorithms for pattern matching on arrays. In G. Hains and L.M.R. Mullin, editors, Proceedings A TABLE-92, Second international workshop on array structures, pages 199- 213, 1992. DIRO publication number 841, Universit~ de Montreal.Google Scholar
- 15.J. Jeuring. Polytypic combinatorial functions. Unpublished manuscript, 1994.Google Scholar
- 16.D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6:323-350, 1978.Google ScholarCross Ref
- 17.G. Malcolm. Algebraic data types and program transformation. PhD thesis, University of Groningen, 1990.Google Scholar
- 18.G. Malcolm. Data structures and program transformation. Science of Computer Programming, 14:255-279, 1990. Google ScholarDigital Library
- 19.E.G. Manes and M.A. Arbib. Algebraic Approaches to Program Semantics. Text and Monographs in Computer Science. Springer Verlag, 1986. Google ScholarDigital Library
- 20.L. Meertens. Algorithmics--towards programming as a mathematical activity. In J.W. de Bakker, M. Hazewinkel, and J.K. Lenstra, editors, Proceedings of the CWI Symposium on Mathematics and Computer Science, volume I of CWI Monographs, pages 289-334. North-Holland, 1986.Google Scholar
- 21.L. Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413-425, 1992.Google ScholarCross Ref
- 22.E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes, and barbed wire. In J. Hughes, editor, Proceedings of the 5th A CM Conference on Functional Programming Languages and Computer Architecture, Cambridge, Massachusetts, pages 124-144, 1991. Google ScholarDigital Library
- 23.O. de Moor. Categories, relations and dynamic programming. PhD thesis, Oxford University, 1992. Technical Monograph PRG-98. Google ScholarDigital Library
- 24.O. de Moor. Categories, relations and dynamic programming. Mathematical Structures in Computer Science, 4:33-69, 1994.Google ScholarCross Ref
- 25.J. Peterson. Dynamic typing in Haskell. Technical Report YALEU/DCS/RR-1022, Yale University, Department of Computer Science, 1993.Google Scholar
- 26.T. Sheard. Type parametric programming. Oregon Graduate Institute of Science and Technology, Portland, OR, USA, 1993.Google Scholar
Index Terms
- Polytypic pattern matching
Recommendations
Elaborating dependent (co)pattern matching
In a dependently typed language, we can guarantee correctness of our programs by providing formal proofs. To check them, the typechecker elaborates these programs and proofs into a low level core language. However, this core language is by nature hard to ...
Pattern matching without K
ICFP '14: Proceedings of the 19th ACM SIGPLAN international conference on Functional programmingDependent pattern matching is an intuitive way to write programs and proofs in dependently typed languages. It is reminiscent of both pattern matching in functional languages and case analysis in on-paper mathematics. However, in general it is ...
Pattern matching without K
ICFP '14Dependent pattern matching is an intuitive way to write programs and proofs in dependently typed languages. It is reminiscent of both pattern matching in functional languages and case analysis in on-paper mathematics. However, in general it is ...
Comments