Techniques for embedding postfix languages in Haskell

Authors:
Chris Okasaki
Affiliations:
United States Military Academy, West Point, New York
Venue:
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Year:
2002

Citing 8
Cited 1

GL—a denotational testbed with continuations and partial continuations as first-class objects

SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
A fresh look at combinator graph reduction

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Linear logic and permutation stacks—the Forth shall be first

ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
Functional reactive animation

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Lava: hardware design in Haskell

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Recursive monadic bindings

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
THEORETICAL PEARLS: Flattening combinators: surviving without parentheses

Journal of Functional Programming
Functional unparsing

Journal of Functional Programming

Declarative scripting in haskell

SLE'09 Proceedings of the Second international conference on Software Language Engineering

Quantified Score

Hi-index	0.01

Visualization

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.