• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Mogensen-Scott Encoding

Mogensen-Scott Encoding

Paperback

General Computers

Currently unavailable to order

ISBN10: 6133249811
ISBN13: 9786133249813
Publisher: Vdm Verlag Dr Mller Ag & Co Kg
Pages: 108
Weight: 0.37
Height: 0.26 Width: 9.02 Depth: 6.00
Language: English
High Quality Content by WIKIPEDIA articles! In computer science, Scott encoding is a way to embed inductive datatypes in the lambda calculus. Mogensen-Scott encoding extends and slightly modifies this to an embedding of all terms of the untyped lambda calculus. The Scott and Church encodings coincide on enumerated datatypes such as the boolean datatype. Church encoded data and operations on them are typable in system F, but Scott encoded data and operations are not obviously typable in system F. Universal as well as recursive types appear to be required, and since strong normalization does not hold for recursively typed lambda calculus, termination of programs manipulating Scott-encoded data cannot be established by determining well-typedness of such programs.

Also in

General Computers