research-article

Paradise: a two-stage DSL embedded in Haskell

Authors:

Lennart Augustsson,

Howard Mansell,

Ganesh SittampalamAuthors Info & Claims

ACM SIGPLAN Notices, Volume 43, Issue 9

Pages 225 - 228

https://doi.org/10.1145/1411203.1411236

Published: 20 September 2008 Publication History

Get Access

Abstract

We have implemented a two-stage language, Paradise, for building reusable components which are used to price financial products. Paradise is embedded in Haskell and makes heavy use of type-class based overloading, allowing the second stage to be compiled into a variety of backend platforms.

Paradise has enabled us to begin moving away from implementation directly in monolithic Excel spreadsheets and towards a more modular and retargetable approach.

Supplementary Material

JPG File (1411236.jpg)

Download
14.02 KB

index.html (index.html)

Slides from the presentation

Download
.93 KB

ZIP File (p225-slides.zip)

Supplemental material for: Paradise: a two-stage DSL embedded in Haskell

Download
5.52 MB

Audio only (1411236.mp3)

Download
7.24 MB

Video (1411236.mp4)

Download
100.54 MB

References

[1]

P. Bjesse, K. Claessen, M. Sheeran, and S. Singh. Lava: Hardware design in Haskell. In Proc. ICFP '98, pages 174--184. ACM Press, 1998.

Digital Library

Google Scholar

[2]

C. Elliott, S. Finne, and O. de Moor. Compiling embedded languages. Journal of Functional Programming, 13(2), 2003.

Digital Library

Google Scholar

[3]

S. Kamin. Standard ML as a meta-programming language. Technical report, University of Illinois at Urbana-Champaign, 1996.

Google Scholar

[4]

D. Leijen and E. Meijer. Domain specific embedded compilers. In Proc. 2nd USENIX Conference on Domain Specific Languages (DSL'99), pages 109--122, 1999.

Digital Library

Google Scholar

[5]

S. Peyton Jones, D. Vytiniotis, S. Weirich, and G. Washburn. Simple unification-based type inference for GADTs. In Proc. ICFP '06, pages 50--61. ACM Press, 2006.

Digital Library

Google Scholar

[6]

F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proc. PLDI '88, pages 199--208. ACM Press, 1988.

Digital Library

Google Scholar

[7]

T. Sheard and S. Peyton Jones. Template metaprogramming for Haskell. In Proc. Haskell Workshop '02, pages 1--16. ACM Press, 2002.

Digital Library

Google Scholar

Cited By

View all

Homer MJones TNoble J(2015)From APIs to languages: generalising method namesACM SIGPLAN Notices10.1145/2936313.281670851:2(1-12)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2936313.2816708
Homer MJones TNoble JSerrano M(2015)From APIs to languages: generalising method namesProceedings of the 11th Symposium on Dynamic Languages10.1145/2816707.2816708(1-12)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2816707.2816708
Günther S(2014)Design Patterns and Design Principles for Internal Domain-Specific LanguagesComputational Linguistics10.4018/978-1-4666-6042-7.ch017(352-410)Online publication date: 2014
https://doi.org/10.4018/978-1-4666-6042-7.ch017
Show More Cited By

Index Terms

Paradise: a two-stage DSL embedded in Haskell
1. Applied computing
2. Software and its engineering
  1. Software notations and tools
    1. Context specific languages
      1. Domain specific languages
    2. General programming languages
      1. Language types
        Functional languages

Recommendations

Paradise: a two-stage DSL embedded in Haskell
ICFP '08: Proceedings of the 13th ACM SIGPLAN international conference on Functional programming

We have implemented a two-stage language, Paradise, for building reusable components which are used to price financial products. Paradise is embedded in Haskell and makes heavy use of type-class based overloading, allowing the second stage to be ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell Symposium

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Metaprogramming with combinators
GPCE 2021: Proceedings of the 20th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences

There are a wide array of methods for writing code generators. We advocate for a point in the design space, which we call metaprogramming with combinators, where programmers use (and write) combinator libraries that directly manipulate object language ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 43, Issue 9

ICFP '08

September 2008

399 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/1411203

Issue’s Table of Contents

ICFP '08: Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
September 2008
422 pages
ISBN:9781595939197
DOI:10.1145/1411204
General Chair:
James Hook
Portland State University, USA
,
Program Chair:
Peter Thiemann
Universität Freiburg, Germany

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 September 2008

Published in SIGPLAN Volume 43, Issue 9

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
535
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Homer MJones TNoble J(2015)From APIs to languages: generalising method namesACM SIGPLAN Notices10.1145/2936313.281670851:2(1-12)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2936313.2816708
Homer MJones TNoble JSerrano M(2015)From APIs to languages: generalising method namesProceedings of the 11th Symposium on Dynamic Languages10.1145/2816707.2816708(1-12)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2816707.2816708
Günther S(2014)Design Patterns and Design Principles for Internal Domain-Specific LanguagesComputational Linguistics10.4018/978-1-4666-6042-7.ch017(352-410)Online publication date: 2014
https://doi.org/10.4018/978-1-4666-6042-7.ch017
Mintchev S(2014)User–Defined Rules Made Simple with Functional ProgrammingBusiness Information Systems10.1007/978-3-319-06695-0_20(229-240)Online publication date: 2014
https://doi.org/10.1007/978-3-319-06695-0_20
Günther S(2013)Design Patterns and Design Principles for Internal Domain-Specific LanguagesFormal and Practical Aspects of Domain-Specific Languages10.4018/978-1-4666-2092-6.ch007(156-214)Online publication date: 2013
https://doi.org/10.4018/978-1-4666-2092-6.ch007
Roth OGil Y(2023)Fluent APIs in Functional LanguagesProceedings of the ACM on Programming Languages10.1145/35860577:OOPSLA1(876-901)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586057
Broman DNierstrasz OGray JOliveira B(2019)A vision of miking: interactive programmatic modeling, sound language composition, and self-learning compilationProceedings of the 12th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3357766.3359531(55-60)Online publication date: 20-Oct-2019
https://dl.acm.org/doi/10.1145/3357766.3359531
Broman DSiek J(2018)Gradually typed symbolic expressionsProceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM '1810.1145/3175493.3162068(15-29)Online publication date: 2018
https://doi.org/10.1145/3175493.3162068
Palmkvist VBroman D(2018)Creating Domain-Specific Languages by Composing Syntactical ConstructsPractical Aspects of Declarative Languages10.1007/978-3-030-05998-9_12(187-203)Online publication date: 19-Dec-2018
https://doi.org/10.1007/978-3-030-05998-9_12
Broman DSiek JHenglein FKo H(2017)Gradually typed symbolic expressionsProceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3162068(15-29)Online publication date: 25-Dec-2017
https://dl.acm.org/doi/10.1145/3162068
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

Supplementary Material

References

Cited By

Index Terms

Recommendations