On the Representation of Semigroups and Other Congruences in the Lambda Calculus | Zendy

Rick Statman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the Representation of Semigroups and Other Congruences in the Lambda Calculus

Author(s) -

Rick Statman

Publication year - 2016

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2016.09.044

Subject(s) - monoid , semigroup , mathematics , congruence relation , church encoding , combinatory logic , pointwise , lambda calculus , simply typed lambda calculus , free monoid , typed lambda calculus , representation (politics) , system f , algebra over a field , confluence , inverse semigroup , pure mathematics , discrete mathematics , computer science , politics , political science , law , mathematical analysis , programming language

We show that every semigroup with an RE word problem can be pointwise represented in the lambda calculus. In addition, we show that the free monoid generated by an arbitrary RE subset of combinators can be represented as the monoid of all terms which fix a finite set of points

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research