Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 108 pp. Englisch. Codice articolo 9786133249813
Quantità: 2 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Mogensen-Scott Encoding | Computer Science, Lambda Calculus, Anonymous Function | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786133249813 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Codice articolo 134911147
Quantità: 5 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computerscience, Scott encoding is a way to embed inductive datatypes in thelambda calculus. Mogensen-Scott encoding extends and slightly modifiesthis to an embedding of all terms of the untyped lambda calculus. TheScott and Church encodings coincide on enumerated datatypes such as theboolean datatype. Church encoded data and operations on them are typablein system F, but Scott encoded data and operations are not obviouslytypable in system F. Universal as well as recursive types appear to berequired, and since strong normalization does not hold for recursivelytyped lambda calculus, termination of programs manipulatingScott-encoded data cannot be established by determining well-typednessof such programs.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 108 pp. Englisch. Codice articolo 9786133249813
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. Codice articolo 9786133249813
Quantità: 1 disponibili