Kód: 02017954
The 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 abi ... celý popis
Angličtina
Nákupem získáte 161 bodů
Anotace knihy
The 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. It is also shown how the results of abstract interpretation may be used to improve the code generation. The work is both an exposition and synthesis of recent research and as such will be valuable to research workers and graduate students working in formal methods and functional languages.
Parametry knihy
Zařazení knihy Knihy v angličtině Computing & information technology Computer programming / software development Programming & scripting languages: general
1613 Kč
Angličtina
Osobní odběr Praha, Brno a 46804 dalších
Copyright ©2008-26 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies
Vrácení do měsíce
571 999 099 (8-15.30h)Nákupní košík ( prázdný )