Mogensen–Scott encoding
In computer science, Scott encoding is a way to represent (recursive) data types in the lambda calculus. Church encoding performs a similar function. The data and operators form a mathematical structure which is embedded in the lambda calculus. Whereas Church encoding starts with representations of the basic data types, and builds up from it, Scott encoding starts from the simplest method to compose algebraic data types.
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Mogensen–Scott encoding
In computer science, Scott encoding is a way to represent (recursive) data types in the lambda calculus. Church encoding performs a similar function. The data and operators form a mathematical structure which is embedded in the lambda calculus. Whereas Church encoding starts with representations of the basic data types, and builds up from it, Scott encoding starts from the simplest method to compose algebraic data types.
has abstract
In computer science, Scott enc ...... operated on by a meta program.
@en
Link from a Wikipage to an external page
Wikipage page ID
15,465,998
page length (characters) of wiki page
Wikipage revision ID
1,000,301,499
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
In computer science, Scott enc ...... compose algebraic data types.
@en
label
Mogensen–Scott encoding
@en