Product Description
High Quality Content by WIKIPEDIA articles! Extended ML is a wide-spectrum language covering both specification and implementation and based on the ML programming language. It extends the syntax of ML to include axioms, which need not be executable but can rigorously specify the behavior of the program. With this addition the language can be used for stepwise refinement, proceeding gradually from an initial formal specification to eventually yield an executable Standard ML program. Correctness of the final executable SML program with respect to the original specification can then be established by proving the correctness of each of the refinement steps. Extended ML is used for research into and teaching of formal program development and specification, and research into automatic program verification. ... Read more

Product Description
High Quality Content by WIKIPEDIA articles! Dependent ML is an experimental functional programming language proposed by Frank Pfenning and Hongwei Xi. Dependent ML extends ML by a restricted notion of dependent types: types may be dependent on static indices of type Nat. Dependent ML employs a constraint theorem prover to decide a strong equational theory over the index expressions. Dependent ML has been superseded by ATS and is no longer under active development. ... Read more

Product Description
High Quality Content by WIKIPEDIA articles! Extensible ML (EML) is an ML-like programming language that adds support for object-oriented idioms in a functional setting. EML extends ML-style datatypes and functions with a class construct designed to be extended into hierarchies, thus allowing the programmer to seamlessly integrate the object-oriented programming paradigm with the traditional functional style. Extensible ML is related neither to the programming language Extended ML (other than being similarly derived from ML), nor to the specification language eXtensible Markup Language, nor to extensible programming. ... Read more

Product Description
High Quality Content by WIKIPEDIA articles! Lazy ML (LML) is a functional programming language developed in the early 1980s by Lennart Augustsson and Thomas Johnsson at Chalmers University of Technology, prior to Miranda and Haskell. LML is a strongly typed, statically scoped implementation of ML, with lazy evaluation. The key innovation of LML was to demonstrate how to compile a lazy functional language. Until then, lazy languages had been implemented via interpreted graph reduction. LML compiled to G-machine code. LML is also notable as the language in which HBC, the Haskell B Compiler, was implemented. ... Read more

Product Description
HOL is a proof development system intended for applications to both hardware and software. It is principally used in two ways: for directly proving theorems, and as theorem-proving support for application-specific verification systems. HOL is currently being applied to a wide variety of problems, including the specification and verification of critical systems. Introduction to HOL provides a coherent and self-contained description of HOL containing both a tutorial introduction and most of the material that is needed for day-to-day work with the system. After a quick overview that gives a 'hands-on feel' for the way HOL is used, there follows a detailed description of the ML language. The logic that HOL supports and how this logic is embedded in ML are then described in detail. This is followed by an explanation of the theorem-proving infrastructure provided by HOL. Finally two appendices contain a subset of the reference manual, and an overview of the HOL library, including an example of an actual library documentation. ... Read more

Product Description
This book shows how continuation-passing style is used as an intermediate representation to perform optimizations and program transformations. Continuations can be used to compile most programming languages.The method is illustrated in a compiler for the programming language Standard ML.Prior knowledge of ML, however, is not necessary, as the author carefully explains each concept as it arises. This is the first book to show how concepts from the theory of programming languages can be applied to the production of practical optimizing compilers for modern languages like ML. All the details of compiling are covered, including the interface to a runtime system and garbage collector. ... Read more

Customer Reviews (3)

I'm still getting into it
I haven't finished with this book yet, but it looks like a good book, and it was hghly recommended by
trusted people.

This book changed my life
I found this book while trying to build a interpreter for a distributed language.Appel's approach not only solved my immediate issues (a uniform means of procedure call in the presence of mobility) but opened my mind to the utility of continuations in many areas of CS.It was a real mind opener, and the explanations were clear enough that I could adopt this approach with little difficulty.

Surprisingly readable, given the subject matter.
This is a very nice little book, and I found it to be surprisingly readable.The book is nicely written. Standard ML is used to illustrate the technique of compiling a functional language using continuations as theprimary intermediate representation.Lack of familiarity with ML is notparticularly burdensome. I would like to have seen more discussion of otherlanguages, though (Scheme?). ... Read more

Product Description

Gegenstand dieses Werkes sind die Theorie und Praxis der modernen funktionalen Programmierung. Dabei betrachten die Autoren aber nicht nur das, was mittels der heute implementierten Sprachen wie HASKELL, OPAL, ML usw. machbar ist, sondern weisen auch auf aktuelle Entwicklungen hin.

Zum einen werden fortgeschrittene Programmiertechniken vorgestellt, wie z.B. die Verwendung unendlicher Datenstrukturen, Parser als Funktionen höherer Ordnung, Approximations-Algorithmen, Lösung von Gleichungssystemen usw. Zum anderen werden aber auch Sprachkonzepte diskutiert, wie z.B. eine systematische Form der Modularisierung oder besonders ausdrucksstarke und flexible Formen der Typisierung. Ein besonderes Gewicht wird generell auf die Integration verschiedener Paradigmen gelegt, wie etwa die Verbindung mit Konzepten der objektorientierten, der nebenläufigen oder der Constraint-basierten Programmierung. In diesem Zusammenhang wird speziell auch die Bedeutung von Monaden analysiert und kritisch hinterfragt.