Even higher-order functions for parsing or why would anyone ever want to use a sixth-order function?

Journal of Functional Programming

Volumn 8, Issue 2, 1998, Pages 195-199

  Okasaki, Chris ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032377934     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796898003001     Document Type: Article

References (6)

1. Burge, W. H. (1975) Recursive Programming Techniques. Addison-Wesley.
2. Hutton, G. (1992) Higher-order functions for parsing. J. Functional Programming 2(3), 323-343.
3. Hutton, G. and Meijer, E. (1996) Monadic Parsing Combinators. Technical Report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham.
4. Milner, R., Tofte, M. and Harper, R. (1990) The Definition of Standard ML. MIT Press.
5. Wadler, P. (1985) How to replace failure by a list of successes. Conference on Functional Programming Languages and Computer Architecture, pp. 113-128.
6. Wadler, P. (1992) The essence of functional programming. ACM Symposium on Principles of Programming Languages, pp. 1-14.