Search results for: combinators-and-functional-programming-languages

Combinators and Functional Programming Languages

Author : Guy Cousineau
File Size : 34.29 MB
Format : PDF
Download : 862
Read : 401
Download »

Combinators and Functional Programming Languages

Author : Laboratoire informatique theorique et programmation (France). Spring School
File Size : 78.41 MB
Format : PDF, Mobi
Download : 455
Read : 1030
Download »

Functional Programming Languages and Computer Architecture

Author : Jean-Pierre Jouannaud
File Size : 89.84 MB
Format : PDF, ePub, Mobi
Download : 931
Read : 826
Download »

Categorical Combinators Sequential Algorithms and Functional Programming

Author : P.-L. Curien
File Size : 45.33 MB
Format : PDF, Kindle
Download : 514
Read : 798
Download »
This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a general effort to improve typography, English, and presentation, the main novelty of this second edition is the integration of some new material. Part of it is mine (mostly jointly with coauthors). Here is brief guide to these additions. I have augmented the account of categorical combinatory logic with a description of the confluence properties of rewriting systems of categor ical combinators (Hardin, Yokouchi), and of the newly developed cal culi of explicit substitutions (Abadi, Cardelli, Curien, Hardin, Levy, and Rios), which are similar in spirit to the categorical combinatory logic, but are closer to the syntax of A-calculus (Section 1.2). The study of the full abstraction problem for PCF and extensions of it has been enriched with a new full abstraction result: the model of sequential algorithms is fully abstract with respect to an extension of PCF with a control operator (Cartwright, Felleisen, Curien). An order extensional model of error-sensitive sequential algorithms is also fully abstract for a corresponding extension of PCF with a control operator and errors (Sections 2.6 and 4.1). I suggest that sequential algorithms lend themselves to a decomposition of the function spaces that leads to models of linear logic (Lamarche, Curien), and that connects sequentiality with games (Joyal, Blass, Abramsky) (Sections 2.1 and 2.6).

Lambda calculus Combinators and Functional Programming

Author : G. E. Revesz
File Size : 68.76 MB
Format : PDF, Kindle
Download : 560
Read : 815
Download »
Originally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated. The main purpose of the book is to provide computer science students and researchers with a firm background in lambda-calculus and combinators and show the applicabillity of these theories to functional programming. The presentation of the material is self-contained. It can be used as a primary text for a course on functional programming. It can also be used as a supplementary text for courses on the structure and implementation of programming languages, theory of computing, or semantics of programming languages.

A Framework for Programming Interactive Graphics in a Functional Programming Language

Author : Enno Scholz
File Size : 47.84 MB
Format : PDF, Docs
Download : 460
Read : 197
Download »

Verified Functional Programming in Agda

Author : Aaron Stump
File Size : 82.83 MB
Format : PDF, Docs
Download : 587
Read : 755
Download »
Agda is an advanced programming language based on Type Theory. Agda's type system is expressive enough to support full functional verification of programs, in two styles. In external verification, we write pure functional programs and then write proofs of properties about them. The proofs are separate external artifacts, typically using structural induction. In internal verification, we specify properties of programs through rich types for the programs themselves. This often necessitates including proofs inside code, to show the type checker that the specified properties hold. The power to prove properties of programs in these two styles is a profound addition to the practice of programming, giving programmers the power to guarantee the absence of bugs, and thus improve the quality of software more than previously possible. Verified Functional Programming in Agda is the first book to provide a systematic exposition of external and internal verification in Agda, suitable for undergraduate students of Computer Science. No familiarity with functional programming or computer-checked proofs is presupposed. The book begins with an introduction to functional programming through familiar examples like booleans, natural numbers, and lists, and techniques for external verification. Internal verification is considered through the examples of vectors, binary search trees, and Braun trees. More advanced material on type-level computation, explicit reasoning about termination, and normalization by evaluation is also included. The book also includes a medium-sized case study on Huffman encoding and decoding.

An Architecture for Combinator Graph Reduction

Author : Philip John Koopman
File Size : 90.63 MB
Format : PDF, ePub, Docs
Download : 935
Read : 306
Download »
An Architecture for Combinator Graph Reduction examines existing methods of evaluating lazy functional programs using combinator reduction techniques, implementation, and characterization of a means for accomplishing graph reduction on uniprocessors, and analysis of the potential for special-purpose hardware implementations. Comprised of eight chapters, the book begins by providing a background on functional programming languages and existing implementation technology. Subsequent chapters discuss the TIGRE (Threaded Interpretive Graph Reduction Engine) methodology for implementing combinator graph reduction; the TIGRE abstract machine, which is used to implement the graph reduction methodology; the results of performance measurements of TIGRE on a variety of platforms; architectural metrics for TIGRE executing on the MIPS R2000 processor; and the potential for special-purpose hardware to yield further speed improvements. The final chapter summarizes the results of the research, and suggests areas for further investigation. Computer engineers, programmers, and computer scientists will find the book interesting.

Central European Functional Programming School

Author : Viktória Zsók
File Size : 52.59 MB
Format : PDF, ePub, Mobi
Download : 519
Read : 822
Download »
This volume presents the revised lecture notes of selected talks given at the Fifth Central European Functional Programming School, CEFP 2013, held in July 2013 in Cluj-Napoca, Romania. The 14 revised full papers presented were carefully reviewed and selected. The lectures cover a wide range of distributed and multicore functional programming subjects. The last 5 papers are selected papers of the PhD Workshop organized for the participants of the summer school.

Implementation of Functional Languages

Author : Kevin Hammond
File Size : 45.46 MB
Format : PDF
Download : 174
Read : 588
Download »
This book constitutes the thoroughly refereed post-workshop proceedings of the 10th International Workshop on the Implementation of Functional Languages, IFL'98, held in London, UK, in September 1998. The 15 revised full papers presented were carefully selected during two rounds of reviewing. The volume covers a wide range of topics including parallel process organization, parallel profiling, compilation and semantics of parallel systems, programming methodology, interrupt handling, strictness analysis, concurrency and message passing, and inter-language working.