Article

Techniques for embedding postfix languages in Haskell

Author:

Chris OkasakiAuthors Info & Claims

Haskell '02: Proceedings of the 2002 ACM SIGPLAN workshop on Haskell

Pages 105 - 113

https://doi.org/10.1145/581690.581699

Published: 03 October 2002 Publication History

Get Access

Abstract

One popular use for Haskell in recent years has been as a host language for domain-specific embedded languages. But how can one embed a postfix language in Haskell, given that Haskell only supports prefix and infix syntax? This paper describes several such embeddings for increasingly complex postfix languages.

References

[1]

Henry G. Baker. Linear logic and permutation stackts---the Forth shall be first. Computer Architecture News, 22(1):34-43, March 1994.]]

Digital Library

Google Scholar

[2]

Per Bjesse, Koen Claessen, Mary Sheeran, and Satnam Singh. Lava: Hardware design in Haskell. In ACM SIGPLAN International Conference on Functional Programming, pages 174-184, September 1998.]]

Digital Library

Google Scholar

[3]

Olivier Danvy. Functional unparsing. Journal of Functional Programming, 8(6):621-625, November 1998.]]

Digital Library

Google Scholar

[4]

Conal Elliott and Paul Hudak. Functional reactive animation. In ACM SIGPLAN International Conference on Functional Programming, pages 263-273, June 1997.]]

Digital Library

Google Scholar

[5]

Levent Erkök and John Launchbury. Recursive monadic bindings. In ACM SIGPLAN International Conference on Functional Programming, pages 174-185, September 2000.]]

Digital Library

Google Scholar

[6]

Paul Hudak, Tom Makucevich, Syam Gadde, and Bo Whong. Haskore music notation - an algebra of music. Journal of Functional Programming, 6(3):465-483, May 1996.]]

Crossref

Google Scholar

[7]

Graham Hutton. Higher-order functions for parsing. Journal of Functional Programming, 2(3):323-343, July 1992.]]

Crossref

Google Scholar

[8]

Gregory F. Johnson. GL---a denotational testbed with continuations and partial continuations as first-class objects. In Symposium on Interpreters and Interpretive Techniques, pages 165-176, June 1987.]]

Digital Library

Google Scholar

[9]

Philip Koopman and Peter Lee. A fresh look at combinator graph reduction. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 110-119, June 1989.]]

Digital Library

Google Scholar

[10]

Chris Okasaki. Flattening combinators: Surviving without parentheses. Journal of Functional Programming, 2002. To appear.]]

Digital Library

Google Scholar

[11]

John Peterson, Paul Hudak, and Conal Elliott. Lambda in motion: Controlling robots with Haskell. In Practical Aspects of Declarative Languages, pages 91-105, January 1999.]]

Digital Library

Google Scholar

[12]

Manfred von Thun. Joy: Forth's functional cousin. In Euro-Forth, 2001.]]

Google Scholar

Cited By

View all

Veresov A(2022)On a possible embedding of Lisp into the C languageKeldysh Institute Preprints10.20948/prepr-2022-30(1-35)Online publication date: 2022
https://doi.org/10.20948/prepr-2022-30
Erwig MWalkingshaw E(2014)Semantics-Driven DSL DesignComputational Linguistics10.4018/978-1-4666-6042-7.ch013(251-275)Online publication date: 2014
https://doi.org/10.4018/978-1-4666-6042-7.ch013
Erwig MWalkingshaw E(2013)Semantics-Driven DSL DesignFormal and Practical Aspects of Domain-Specific Languages10.4018/978-1-4666-2092-6.ch003(56-80)Online publication date: 2013
https://doi.org/10.4018/978-1-4666-2092-6.ch003
Show More Cited By

Index Terms

Techniques for embedding postfix languages in Haskell
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages

Recommendations

General purpose languages should be metalanguages
PEPM '10: Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation

In his paper, The Next 700 Programming Languages, the late Landin writes that "most programming languages are partly a way of expressing things in terms of other things and partly a basic set of given things." Landin tries to separate the general ...
The Intel labs Haskell research compiler
Haskell '13

The Glasgow Haskell Compiler (GHC) is a well supported optimizing compiler for the Haskell programming language, along with its own extensions to the language and libraries. Haskell's lazy semantics imposes a runtime model which is in general difficult ...
The Intel labs Haskell research compiler
Haskell '13: Proceedings of the 2013 ACM SIGPLAN symposium on Haskell

The Glasgow Haskell Compiler (GHC) is a well supported optimizing compiler for the Haskell programming language, along with its own extensions to the language and libraries. Haskell's lazy semantics imposes a runtime model which is in general difficult ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Haskell '02: Proceedings of the 2002 ACM SIGPLAN workshop on Haskell

October 2002

118 pages

ISBN:1581136056

DOI:10.1145/581690

Conference Chair:
Manuel Chakravarty
University of New South Wales, Australia

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: 03 October 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

HW02

Sponsor:

SIGPLAN

HW02: 2002 Haskell Workshop ( co-located with ICFP 2002 )

03 10 2002

Pennsylvania, Pittsburgh

Acceptance Rates

Haskell '02 Paper Acceptance Rate 9 of 24 submissions, 38%;

Overall Acceptance Rate 57 of 143 submissions, 40%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
583
Total Downloads

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

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Veresov A(2022)On a possible embedding of Lisp into the C languageKeldysh Institute Preprints10.20948/prepr-2022-30(1-35)Online publication date: 2022
https://doi.org/10.20948/prepr-2022-30
Erwig MWalkingshaw E(2014)Semantics-Driven DSL DesignComputational Linguistics10.4018/978-1-4666-6042-7.ch013(251-275)Online publication date: 2014
https://doi.org/10.4018/978-1-4666-6042-7.ch013
Erwig MWalkingshaw E(2013)Semantics-Driven DSL DesignFormal and Practical Aspects of Domain-Specific Languages10.4018/978-1-4666-2092-6.ch003(56-80)Online publication date: 2013
https://doi.org/10.4018/978-1-4666-2092-6.ch003
HINZE R(2011)Typed quote/antiquote or: Compile-time parsingJournal of Functional Programming10.1017/S095679681100005021:03(219-234)Online publication date: 27-May-2011
https://doi.org/10.1017/S0956796811000050
Bauer TErwig M(2009)Declarative scripting in haskellProceedings of the Second international conference on Software Language Engineering10.1007/978-3-642-12107-4_21(294-313)Online publication date: 5-Oct-2009
https://dl.acm.org/doi/10.1007/978-3-642-12107-4_21

View Options

Login options

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

Cited By

Index Terms

Recommendations

General purpose languages should be metalanguages

The Intel labs Haskell research compiler

The Intel labs Haskell research compiler