Computability Via The Lambda Calculus with Patterns

Bodin Skulkiat, Pimpen Vejjajiva, Mark Hall


We introduce a concept of \textbf{computability relative to a structure}, which specifies which functions on the universe of a first-order structure are computable, using the lambda calculus with patterns. In doing so, we add a new congruence, $\equiv_\mathfrak{A}$, called \textbf{congruence in a structure} to identify two syntactically different terms which represent the same element of the universe. We then show that, with the introduction of the new congruence, all the basic properties of the original lambda calculus with patterns still hold, including the Church-Rosser theorem.

Full Text:



Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the '' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.