Questions tagged [church-encoding]

Questions about the Church encoding, a way to represent data using functions, and the Boehm-Berarducci encoding, a transposition of it to a typed setting. For questions primarily about the related Scott and Mogensen-Scott encodings, there is [scott-encoding].

Related Tags: , .

93 questions
0
votes
2 answers

Sml Church numeral type inference

I have this expression in SML and need to find the most general type of it. When run through the compiler I get what it shows below. How would I go about finding what the most general type would be of not only this function but other functions like…
0
votes
1 answer

Define the binary exponential operator CARAT in Lambda Calculus

I am trying to define binary exponential operator in lambda calculus say operator CARAT. For example, this operator may take two arguments, the lambda encoding of number 2 and the lambda encoding of number 4, and computes the lambda encoding of…
rips
  • 39
  • 2
  • 6
-1
votes
2 answers

unfolding recursive expressions

I've been recently working with recursive expressions in Python. An example of such expression is given as: ['+', [['*', ['i0','i1']], ['*', ['i2','i3']]]] I'm attempting to transform expressions like these into something I can directly compute,…
sdgaw erzswer
  • 2,182
  • 2
  • 26
  • 45
1 2 3 4 5 6
7