Implementation of Functional Languages

15th International Workshop, IFL 2003, Edinburgh, UK, September 8-11, 2003. Revised Papers

Phil Trinder, Greg Michaelson, Ricardo Pena (Herausgeber)

Buch | Softcover

X, 190 Seiten

2004 | 2005
Springer Berlin (Verlag)
978-3-540-23727-3 (ISBN)

Artikel merken

Functional programminghas a long history,reaching back through early reali- tions in languages like LISP to foundational theories of computing, in particular ?-calculus and recursive function theory. In turn, functional programming has had wide in?uence in computing, both through developments within the dis- pline, such as formal semantics, polymorphic type checking, lazy evaluation and structural proof, and as a practical embodiment of formalized approaches, such as speci?cation, transformation and partial application. One of the engaging features of functional programming is precisely the crossover between theory and practice. In particular, it is regarded as ess- tial that all aspects of functional programming are appropriately formalized, especially the speci?cation and implementation of functional languages. Thus, specialist functional programming events like the International Workshop on the Implementation of Functional Languages (IFL) attract contributions where strong use is made of syntactic, semantic and meta-mathematical formalisms to motivate, justify and underpin very practical software systems. IFL grew out of smaller workshops aimed at practitioners wrestling with the nuts and bolts of making concrete implementations of highly abstract l- guages. Functional programming has always been bedeviled by an unwarranted reputation for slowand ine?cient implementations. IFL is one venue where such problemsaretackledheadon,alwaysusing formaltechniques to justify practical implementations.

Implementation of Functional Languages.- Lazy Assertions.- Interfacing Haskell with Object-Oriented Languages.- A Functional Shell That Dynamically Combines Compiled Code.- Polymorphic Type Reconstruction Using Type Equations.- Correctness of Non-determinism Analyses in a Parallel-Functional Language.- Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs.- Dynamic Chunking in Eden.- With-Loop Scalarization - Merging Nested Array Operations.- Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms.- Generic Graphical User Interfaces.- Polytypic Programming in Haskell.

Erscheint lt. Verlag	29.11.2004
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	X, 190 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	315 g
Themenwelt	Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge
Themenwelt	Informatik ► Theorie / Studium ► Compilerbau
Schlagworte	algorithm • algorithms • formale Sprachen • Functional Programming • functional programming languages • Functional Theorem Proving • Generic Programming • Hardcover, Softcover / Informatik, EDV/Programmiersprachen • haskell programming • HC/Informatik, EDV/Programmiersprachen • higher-order functional programs • programming • Programming Languages Implementation • Type Systems
ISBN-10	3-540-23727-5 / 3540237275
ISBN-13	978-3-540-23727-3 / 9783540237273
Zustand	Neuware