Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings

Syntactic Pattern-Matching and Combinatory Logic

Jaime Rangel-Mondragón
Organization: Universidad Autonoma de Querétaro
Department: Facultad de Informatica
Journal / Anthology

Instituto Tecnologico y de Estudios Superiores de Monterrey. Research Report
Year: 1996

Given a pattern and a string, this work addresses the problem of finding all instantiations of the variables forming the pattern to match those appearing in the string. The work adopts a pragmatic approach relying heavily on functional programming techniques using the language Mathematica. Two solutions are described; the first one using a recursive approach and the second one using Mathematica's argument-matching mechanism. An application to Combinatory Logic is offered towards solving the problem of finding the geneology of a given combinator via a family of given combinators.

*Applied Mathematics > Computer Science
*Mathematica Technology > Kernel > Pattern Matching
*Mathematics > Foundations of Mathematics > Logic

Pattern-matching, unification, parsing, combinatory logic, combinators, genealogies.

Translate this page: