A general model for fixed look-ahead lr parsersBermudez, Manuel E.; Schimpf, Karl M. · International Journal of Computer Mathematics · 1988

On the (non-) relationship between SLR(1) and NQLALR(1) grammarsBermudez, Manuel E.; Schimpf, Karl M. · ACM Transactions on Programming Languages and Systems · 1988

[ACM Press the 1986 SIGPLAN symposium - Palo Alto, California, United States (1986.06.25-1986.06.27)] Proceedings of the 1986 SIGPLAN symposium on Compiler contruction - SIGPLAN '86 - A practical arbitrary look-ahead LR parsing techniqueBermudez, Manuel E.; Schimpf, Karl M. · 1986

Guarded recursive datatype constructorsXi, Hongwei; Chen, Chiyan; Chen, Gang · ACM SIGPLAN Notices · 2003

The towers of HanoiEggers, Bleicke · ACM SIGPLAN Notices · 1985

ESPDas, Manuvir; Lerner, Sorin; Seigle, Mark · ACM SIGPLAN Notices · 2002

Are applicative languages inefficient?Ponder, Carl G.; McGeer, Patrick; Ng, Anthony P-C. · ACM SIGPLAN Notices · 1988

Paths between imperative and functional programmingBall, Thomas · ACM SIGPLAN Notices · 1999

Scalable component abstractionsOdersky, Martin; Zenger, Matthias · ACM SIGPLAN Notices · 2005

PinocchioVerwaest, Toon; Bruni, Camillo; Gurtner, David; Lienhard, Adrian; Niestrasz, Oscar · ACM SIGPLAN Notices · 2010

Regularities considered harmfulPark, Heekwon; Baek, Seungjae; Choi, Jongmoo; Lee, Donghee; Noh, Sam H. · ACM SIGPLAN Notices · 2013