Search Results: 'lambda calculus'

Search

×
×
×
×
13 results for "lambda calculus"
Lecture Notes on the Lambda Calculus By Peter Selinger
Hardcover: List Price: $27.78 $16.67 | You Save: 40%
Prints in 3-5 business days
This is a set of lecture notes that developed out of courses on the lambda calculus that the author taught at the University of Ottawa in 2001 and at Dalhousie University in 2007 and 2013. Topics... More > covered in these notes include the untyped lambda calculus, the Church-Rosser theorem, combinatory algebras, the simply-typed lambda calculus, the Curry-Howard isomorphism, weak and strong normalization, polymorphism, type inference, denotational semantics, complete partial orders, and the language PCF.< Less
Compiling Lambda Calculus By Nils M Holm
eBook (PDF): $29.95
This book introduces the reader to the theory and interpretation of lambda calculus. It first describes lambda calculus as a formal term rewriting system and outlines some simple applications, like... More > Church numerals, the Y combinator, etc. The next part of the book defines and implements a tiny subset of the Scheme programming language and then extends it iteratively until it can be used as the basis for a real-world implementation. This part covers two models of interpretation as well as the transformation of lambda calculus to abstract machine code and portable C code. The final part of the book explores a language that resembles lambda calculus more closely, by supporting partial function application. The compilers and languages introduced in the book are implemented in Scheme and provided under the Creative Commons Zero license (a.k.a. Public Domain). Intended audience: compiler writers and everyone interested in the theoretical background of LISPy languages.< Less
Compiling Lambda Calculus By Nils M Holm
Paperback: $34.95
Prints in 3-5 business days
This book introduces the reader to the theory and interpretation of lambda calculus. It first describes lambda calculus as a formal term rewriting system and outlines some simple applications, like... More > Church numerals, the Y combinator, etc. The next part of the book defines and implements a tiny subset of the Scheme programming language and then extends it iteratively until it can be used as the basis for a real-world implementation. This part covers two models of interpretation as well as the transformation of lambda calculus to abstract machine code and portable C code. The final part of the book explores a language that resembles lambda calculus more closely, by supporting partial function application. The compilers and languages introduced in the book are implemented in Scheme and provided under the Creative Commons Zero license (a.k.a. Public Domain). Intended audience: compiler writers and everyone interested in the theoretical background of LISPy languages.< Less
Volume 3676, Lalemant --- Lambda calculus By Print Wikipedia
Hardcover: $80.00
Prints in 3-5 business days
Volume 3676, Lalemant---Lambda calculus Print Wikipedia is a both a utilitarian visualization of the largest accumulation of human knowledge and a poetic gesture towards the inhuman scale of big... More > data. Michael Mandberg wrote software that parses the entirety of the English-language Wikipedia database and programmatically lays out nearly 7500 volumes, complete with covers, and then uploads them to Lulu.com for print-on-demand. Print Wikipedia draws attention to the sheer size of the encyclopedia's content and the impossibility of rendering Wikipedia as a material object in fixed form: Once a volume is printed it is already out of date. It is also a work of found poetry built on what is likely the largest appropriation ever made. As we become increasingly more dependent on information and source material on the Internet today, Mandiberg explores the accessibility of its vastness.< Less
Compiling Lambda Calculus (Int'l Ed.) By Nils M Holm
Paperback: $36.50
Prints in 3-5 business days
(SHIPPING FROM GLOBAL LOCATIONS) This book introduces the reader to the theory and interpretation of lambda calculus. It first describes lambda calculus as a formal term rewriting system and outlines... More > some simple applications, like Church numerals, the Y combinator, etc. The next part of the book defines and implements a tiny subset of the Scheme programming language and then extends it iteratively until it can be used as the basis for a real-world implementation. This part covers two models of interpretation as well as the transformation of lambda calculus to abstract machine code and portable C code. The final part of the book explores a language that resembles lambda calculus more closely, by supporting partial function application. The compilers and languages introduced in the book are implemented in Scheme and provided under the Creative Commons Zero license (a.k.a. Public Domain). Intended audience: compiler writers and everyone interested in the theoretical background of LISPy languages.< Less
Volume 3677, Lambda Calculus --- Lamb of God (band) By Print Wikipedia
Hardcover: $80.00
Prints in 3-5 business days
Volume 3677, Lambda Calculus---Lamb of God (band) Print Wikipedia is a both a utilitarian visualization of the largest accumulation of human knowledge and a poetic gesture towards the inhuman scale... More > of big data. Michael Mandberg wrote software that parses the entirety of the English-language Wikipedia database and programmatically lays out nearly 7500 volumes, complete with covers, and then uploads them to Lulu.com for print-on-demand. Print Wikipedia draws attention to the sheer size of the encyclopedia's content and the impossibility of rendering Wikipedia as a material object in fixed form: Once a volume is printed it is already out of date. It is also a work of found poetry built on what is likely the largest appropriation ever made. As we become increasingly more dependent on information and source material on the Internet today, Mandiberg explores the accessibility of its vastness.< Less
Volume 3677, Lambda Calculus --- Lamb of God (band) By Print Wikipedia
Hardcover: $80.00
Prints in 3-5 business days
Volume 3677, Lambda Calculus---Lamb of God (band) Print Wikipedia is a both a utilitarian visualization of the largest accumulation of human knowledge and a poetic gesture towards the inhuman scale... More > of big data. Michael Mandberg wrote software that parses the entirety of the English-language Wikipedia database and programmatically lays out nearly 7500 volumes, complete with covers, and then uploads them to Lulu.com for print-on-demand. Print Wikipedia draws attention to the sheer size of the encyclopedia's content and the impossibility of rendering Wikipedia as a material object in fixed form: Once a volume is printed it is already out of date. It is also a work of found poetry built on what is likely the largest appropriation ever made. As we become increasingly more dependent on information and source material on the Internet today, Mandiberg explores the accessibility of its vastness.< Less
The Complexity of Flow Analysis in Higher-Order Languages By David Van Horn
Paperback: $15.20
Prints in 3-5 business days
This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis problems in higher-order programming languages. We give exact characterizations of the computational... More > complexity of 0CFA, the kCFA hierarchy, and related analyses. In each case, we precisely capture both the expressiveness and feasibility of the analysis, identifying the elements responsible for the trade-off.< Less
Polynomial Time Calculi By Stefan Schimanski
Paperback: $43.83
Prints in 3-5 business days
This thesis is about type systems which guarantee polynomial time complexity of typed programs. A type system is a tool to give a computer program an additional structure which makes sure that it... More > satisfies certain properties. In this work type systems are introduced and mathematically analysed, which type only those algorithms which terminate after polynomially many execution steps in the size of the input. Polynomial time is an important complexity class for practical application because polynomial algorithms grow reasonable fast to be feasibly computable also for bigger inputs.< Less
Polynomial Time Calculi By Stefan Schimanski
eBook (PDF): $0.00
This thesis is about type systems which guarantee polynomial time complexity of typed programs. A type system is a tool to give a computer program an additional structure which makes sure that it... More > satisfies certain properties. In this work type systems are introduced and mathematically analysed, which type only those algorithms which terminate after polynomially many execution steps in the size of the input. Polynomial time is an important complexity class for practical application because polynomial algorithms grow reasonable fast to be feasibly computable also for bigger inputs.< Less

Top 10

see more >
Age Verification Required