{"product_id":"two-level-functional-languages-paperback-9780521018470","title":"Two-Level Functional Languages (Paperback) 9780521018470","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eTwo-Level Functional Languages\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eThis book provides a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eFlemming Nielson (Author), Hanne Riis Nielson (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521018470, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback, published 22 August 2005\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e312 pages, 4 b\/w illus.  35 tables\u003cbr\u003e24.4 x 17 x 1.7 cm, 0.493 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThe authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus, in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of 'parametrized semantics' is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose; it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalises Wadler's analysis for lists.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e1. Introduction\u003cbr\u003e 2. Types made explicit\u003cbr\u003e 3. Binding-time made explicit\u003cbr\u003e 4. Combinators made explicit\u003cbr\u003e 5. Parametrized semantics\u003cbr\u003e 6. Code generation\u003cbr\u003e 7. Abstract interpretation\u003cbr\u003e 8. Conclusions\u003cbr\u003e Bibliography\u003cbr\u003e Summary of transformation functions\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Programming \u0026amp; scripting languages: general [\u003ca title=\"See our other books on Programming \u0026amp; scripting languages: general\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Programming%20\u0026amp;%20scripting%20languages:%20general%20%5BUMX%5D%22\"\u003eUMX\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46006154166552,"sku":"9780521018470","price":46.89,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521018470i_3bf0c719-86a7-407f-b026-a64d08460542.jpg?v=1691376781","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/two-level-functional-languages-paperback-9780521018470","provider":"Freshly Printed Books","version":"1.0","type":"link"}