673 papers · page 21 of 34
Adrian Johnstone, Elizabeth Scott, Giorgios Economopoulos
We discuss generalisations of bottom up parsing, emphasising the relative costs for real programming languages. Our goal is to provide a roadmap of the available approaches in terms of their space and time performance for programming language applications, focusing mainly on GLR …
Stefan Kral, Franz Franchetti, Juergen Lorenz, Christoph W. Ueberhuber, Peter Wurzinger
Abstract elided by the publisher.
Jennifer Lhoták, Ondrej Lhoták, Laurie J. Hendren
Abstract elided by the publisher.
Christian Lindig, Norman Ramsey
Abstract elided by the publisher.
Scott McPeak, George C. Necula
Abstract elided by the publisher.
Benoît Meister
Abstract elided by the publisher.
Tim Owen, Des Watson
Abstract elided by the publisher.
Emre Özer, Andy Nisbet, David Gregg
Abstract elided by the publisher.
Erin Parker, Siddhartha Chatterjee
Abstract elided by the publisher.
Venkatesh Prasad Ranganath, John Hatcliff
Abstract elided by the publisher.
Kevin Redwine, Norman Ramsey
Abstract elided by the publisher.
Byoungro So, Mary W. Hall
Abstract elided by the publisher.
Mary Lou Soffa
Abstract elided by the publisher.
Thomas VanDrunen, Antony L. Hosking
Abstract elided by the publisher.
Christian Andersson
Abstract elided by the publisher.
Hezi Azatchi, Erez Petrank
Abstract elided by the publisher.
Cédric Bastoul, Paul Feautrier
Abstract elided by the publisher.
Michael Burrows, Stephen N. Freund, Janet L. Wiener
Abstract elided by the publisher.
Olivier Danvy
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pass, duplicates no code, generates no chains of thunks, and is properly tail recursive. It makes a cruc…
Etienne Gagnon, Laurie J. Hendren
Abstract elided by the publisher.