Sciweavers

797 search results - page 72 / 160
» MODULA-2 and Its Compilation
Sort
View
COLING
1996
15 years 5 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury
ECEASST
2008
87views more  ECEASST 2008»
15 years 4 months ago
The GP Programming System
Abstract: We describe the programming system for the graph-transformation lan, focusing on the implementation of its compiler and abstract machine. We also compare the system'...
Greg Manning, Detlef Plump
JFP
2007
85views more  JFP 2007»
15 years 4 months ago
What is the meaning of these constant interruptions?
Asynchronous exceptions, or interrupts, are important for writing robust, modular programs, but are traditionally viewed as being difficult from a semantic perspective. In this ar...
Graham Hutton, Joel Wright
PLDI
2003
ACM
15 years 9 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
QNS
1996
15 years 5 months ago
Real Inferno
Inferno is an operating system well suited to applications that need to be portable, graphical, and networked. This paper describes the fundamental oating point facilities of the...
Eric Grosse