Efficient Interpretation by Transforming Data Types and Patterns to Functions

Efficient Interpretation by Transforming Data Types and Patterns to Functions (2007)

Cached

Download Links

[www.st.cs.ru.nl]
[www.cs.nott.ac.uk]
[www.st.cs.ru.nl]

Other Repositories/Bibliography

DBLP

by Jan Martin Jansen , Pieter Koopman , Rinus Plasmeijer

Venue:	In Trends in Functional Programming, volume 7. Intellect
Citations:	9 - 4 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Efficient Interpretation by Transforming Data Types and Patterns to Functions	SVM HeaderParse 0.2
AUTHOR NAME	Jan Martin Jansen	SVM HeaderParse 0.2
AUTHOR AFFIL	2 Institute for Computing and Information Sciences (ICIS),	SVM HeaderParse 0.2
AUTHOR ADDR	Radboud University Nijmegen, the Netherlands.	SVM HeaderParse 0.2
AUTHOR NAME	Pieter Koopman	SVM HeaderParse 0.2
AUTHOR AFFIL	2 Institute for Computing and Information Sciences (ICIS),	SVM HeaderParse 0.2
AUTHOR ADDR	Radboud University Nijmegen, the Netherlands.	SVM HeaderParse 0.2
AUTHOR NAME	Rinus Plasmeijer	SVM HeaderParse 0.2
AUTHOR AFFIL	2 Institute for Computing and Information Sciences (ICIS),	SVM HeaderParse 0.2
AUTHOR ADDR	Radboud University Nijmegen, the Netherlands.	SVM HeaderParse 0.2
ABSTRACT	In this paper we present the stepwise construction of an efficient interpreter for lazy functional programming languages like Haskell and Clean. The interpreter is realized by first transforming the source language to the intermediate language SAPL (Simple Application Programming Language) consisting of pure functions only. During this transformation algebraic data types and pattern-based function definitions are mapped to functions. This eliminates the need for constructs for Algebraic Data Types and Pattern Matching in SAPL. For SAPL a simple and elegant interpreter is constructed using straightforward graph reduction techniques. This interpreter can be considered as a prototype implementation of lazy functional programming languages. Using abstract interpretation techniques the interpreter is optimised. The performance of the resulting interpreter turns out to be very competitive in a comparison with other interpreters like Hugs, Helium, GHCi and Amanda for a number benchmarks. For some benchmarks the interpreter even rivals the speed of the GHC compiler. Due to its simplicity and the stepwise construction this implementation is an ideal subject for introduction courses on implementation aspects of lazy functional programming languages. 1	SVM HeaderParse 0.2
YEAR	2007	INFERENCE
VENUE	In Trends in Functional Programming, volume 7. Intellect	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	157--172	INFERENCE
CITATIONS	12 found	ParsCit 1.0