Cambridge Two-Level Functional Languages - Series 34 Book - Image 1

£87.40

Cambridge University Press Cambridge Two-Level Functional Languages - Series 34 Book

Name: Cambridge Two-Level Functional Languages - Series 34 Book
Brand: Cambridge University Press
Price: 87.4 GBP
Availability: InStock

Architecture & Microprocessors

This is the most expensive it has ever been. Walk away.

£87 today · previous high £87 · all-time low £74

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 70 days · 70 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 70 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £75 (29 days, 41.4%)

Price range: £74 - £87

Price levels: 4 different prices over 70 days

Description

Explore advanced concepts in programming theory with Two-Level Functional Languages, part of the Cambridge Tracts in Theoretical Computer Science series. This academic text provides a detailed framework for extending type notation in functional languages to include binding times. By distinguishing between run-time and compile-time, this work offers a method to improve code specification and program correctness verification. The book details two primary developments. First, it introduces the binding time distinction into the lambda calculus, following a method similar to how types are introduced into the untyped lambda calculus. Second, it presents specific methods for introducing combinators for run-time. This resource is essential for those studying computer science architecture, microprocessors, and theoretical programming models.

Key Features

Introduces a framework for extending type notation in functional languages to include specific binding times.

Distinguishes between run-time and compile-time to help improve the ability to specify code.

Provides methods to enhance the verification of program correctness through binding time distinction.

Applies binding time distinctions to the lambda calculus in a manner analogous to type introduction.

Includes presented methods for the introduction of combinators specifically for run-time use.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 0521403847
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 16 July 1992
Listed Since: 22 January 2007

Barcode

No barcode data available

Cambridge University Press Cambridge Two-Level Functional Languages - Series 34 Book

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Two Level Functional Languages: 34 (Cambridge Tracts in Theoretical Computer Science, Series Number 34)

Cambridge Functional Programming Implementation Book - Series 45

Functional Programming, Glasgow 1994: Proceedings of the 1994 Glasgow Workshop on Functional Programming, Ayr, Scotland, 12–14 September 1994 (Workshops in Computing)

Lambda-calculus, Combinators and Functional Programming: 4 (Cambridge Tracts in Theoretical Computer Science, Series Number 4)

Mathematics in Programming

Lambda-Calculus and Combinators: An Introduction

Implementing Functional Logic Programs: by Translation into Purely Functional Programs

Verified Functional Programming in Agda (ACM Books)

Verified Functional Programming in Agda (ACM Books)

Theories of Programming Languages

Abstract Computing Machines: A Lambda Calculus Perspective (Texts in Theoretical Computer Science. An EATCS Series)

Functional Programming, Glasgow 1992: Proceedings of the 1992 Glasgow Workshop on Functional Programming, Ayr, Scotland, 6–8 July 1992 (Workshops in Computing)

Theories of Programming Languages

Foundational and Practical Aspects of Resource Analysis: First International Workshop, FOPARA 2009, Eindhoven, The Netherlands, November 6, 2010, ... (Lecture Notes in Computer Science, 6324)

Typed Lambda Calculi and Applications: Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, ... 902 (Lecture Notes in Computer Science, 902)

Practical Foundations for Programming Languages

Reflections on the Work of C.A.R. Hoare

Understanding Programming Languages

Introduction to Programming Languages

Semantics of the Probabilistic Typed Lambda Calculus: Markov Chain Semantics, Termination Behavior, and Denotational Semantics

Programming Language Explorations

Java Software Solutions:Foundations of Program Design, CodeMate Enhanced Edition(International Edition) with Haskell:The Craft of Functional Programming

Introduction to Programming Languages

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity