 |
|
|
|
|
 |
|
|
Syntactic Pattern-Matching and Combinatory Logic
|
|
|
|
|
|
| Organization: | Universidad Autonoma de Querétaro |
| Department: | Facultad de Informatica |
|
|
|
|
|
|
| Instituto Tecnologico y de Estudios Superiores de Monterrey. Research Report |
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
|
|
|
|
Pattern-matching, unification, parsing, combinatory logic, combinators, genealogies.
|
|
For the newest resources, visit Wolfram Repositories and Archives »
