Picture 1 of 1

Stock photo

Nikos B Troulli Head-Order Techniques and Other Pragmatics of Lambda (Paperback) - Picture 1 of 1

Head-Order Techniques and Other Pragmatics of Lambda Calculus Graph Reduction by Nikos B. Troullinos (2011, Trade Paperback)

rarewaves-usa (467440)

98.3% positive feedback

Price:

US $49.66

(inclusive of GST)

ApproximatelyS$ 63.54

+ $4.35 shipping

Estimated delivery Thu, 31 Jul - Thu, 28 Aug

Returns:

30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

About this product

Product Identifiers

PublisherUniversal Publishers

ISBN-101612337570

ISBN-139781612337579

eBay Product ID (ePID)167561079

Product Key Features

Number of Pages250 Pages

LanguageEnglish

Publication NameHead-Order Techniques and Other Pragmatics of Lambda Calculus Graph Reduction

SubjectComputer Science, Physics / Mathematical & Computational, Computer Engineering

Publication Year2011

TypeTextbook

AuthorNikos B. Troullinos

Subject AreaComputers, Science

FormatTrade Paperback

Dimensions

Item Height0.5 in

Item Weight16 Oz

Item Length9.7 in

Item Width7.4 in

Additional Product Features

SynopsisAvailable in Paperback Available in eBook editions (PDF format) Institution: Syracuse University (Syracuse, NY, USA) Advisor(s): Prof. Klaus J. Berkling Degree: Ph.D. in Computer and Information Science Year: 1993 Book Information: 248 pages Publisher: Dissertation.com ISBN-10: 1612337570 ISBN-13: 9781612337579 View First 25 pages: (free download) Abstract The operational aspects of Lambda Calculus are studied as a fundamental basis for high-order functional computation. We consider systems having full reduction semantics, i.e., equivalence-preserving transformations of functions. The historic lineage from Eval-Apply to SECD to RTNF/RTLF culminates in the techniques of normal-order graph Head Order Reduction (HOR). By using a scalar mechanism to artificially bind relatively free variables, HOR makes it relatively effortless to reduce expressions beyond weak normal form and to allow expression-level results while exhibiting a well-behaved linear self-modifying code structure. Several variations of HOR are presented and compared to other efficient reducers, with and without sharing, including a conservative breadth-first one which mechanically takes advantage of the inherent, fine-grained parallelism of the head normal form. We include abstract machine and concrete implementations of all the reducers in pure functional code. Benchmarking comparisons are made through a combined time-space efficiency metric. The original results indicate that circa 2010 reduction rates of 10-100 million reductions per second can be achieved in software interpreters and a billion reductions per second can be achieved by a state-of-the art custom VLSI implementation.