Abstract
Ever since the Computer Science community has discovered the concept of a programming language there has been a continuous quest for the ideal, all-encompassing programming language; despite this we have been overwhelmed by an everlasting flow of all kinds of special purpose programming languages. Attempts to bridge this gap between a single language and infinitely many caused research into so-called extensible programming languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wadler, P.: A prettier printer (March 1998), Available at http://cm.bell-labs.com/cm/cs/who/wadler/topics/recent.html
Fokker, J.: Functional parsers. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 1–52. Springer, Heidelberg (1995)
Hudak, P.: Haskore music tutorial. In: Launchbury, J., Sheard, T., Meijer, E. (eds.) AFP 1996. LNCS, vol. 1129, pp. 38–67. Springer, Heidelberg (1996)
de Moor, O., Bird, R.: Algebra of Programming. Prentice-Hall, London (1997)
Hughes, J.: The design of a pretty-printing library. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 53–96. Springer, Heidelberg (1995)
Jeuring, J., Jansson, P.: Polytypic programming. In: Launchbury, J., Sheard, T., Meijer, E. (eds.) AFP 1996. LNCS, vol. 1129, pp. 68–114. Springer, Heidelberg (1996)
Kieburtz, R., Lewis, J.: Programming with algebras. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 267–307. Springer, Heidelberg (1995)
Swierstra, S.D., de Moor, O.: Virtual data structures. In: Möller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol. 755, pp. 355–371. Springer, Heidelberg (1993)
Azero, P., Swierstra, S.D.: Optimal pretty-printing combinators (April 1998), Available at http://www.cs.ruu.nl/groups/ST/Software/PP/
Wadler, P.: Deforestation transforming programs to eliminate trees. Theoretical Computer Science 73, 231–248 (1990)
Johnsson, T.: Attribute grammars as a functional programming paradigm. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol. 274, pp. 154–173. Springer, Heidelberg (1987)
Bird, R.: Using circular programs to eliminate multiple travesals of data. Acta Informatica 21, 239–250 (1984)
Swierstra, S.D., Duponcheel, L.: Deterministic, error correcting combinatory parsers. In: Launchbury, J., Sheard, T., Meijer, E. (eds.) AFP 1996. LNCS, vol. 1129, pp. 184–207. Springer, Heidelberg (1996)
Jones, M.P.: Functional programming with overloading and higher-order polymorphism. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 97–136. Springer, Heidelberg (1995)
Fokkinga, M., Meijer, E., Paterson, R.: Functional programming with bananas, lenses and barbed wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 124–144. Springer, Heidelberg (1991)
Kuiper, M., Swierstra, S.D.: Using attribute grammars to derive efficient functional programs. In: Computing Science in the Netherlands CSN 1987 (November 1987), ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1986/1986-16.ps.gz
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Swierstra, S.D., Azero Alcocer, P.R., Saraiva, J. (1999). Designing and Implementing Combinator Languages. In: Swierstra, S.D., Oliveira, J.N., Henriques, P.R. (eds) Advanced Functional Programming. AFP 1998. Lecture Notes in Computer Science, vol 1608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10704973_4
Download citation
DOI: https://doi.org/10.1007/10704973_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66241-9
Online ISBN: 978-3-540-48506-3
eBook Packages: Springer Book Archive
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.