Sciweavers

4355 search results - page 35 / 871
» From Interpretation to Compilation
Sort
View
138
Voted
RTA
2005
Springer
15 years 10 months ago
Partial Inversion of Constructor Term Rewriting Systems
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
162
Voted
PLDI
1994
ACM
15 years 9 months ago
Optimizing Dynamically-Dispatched Calls with Run-Time Type Feedback
: Object-oriented programs are difficult to optimize because they execute many dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler does not k...
Urs Hölzle, David Ungar
ENTCS
2007
101views more  ENTCS 2007»
15 years 4 months ago
From Functional Programs to Interaction Nets via the Rewriting Calculus
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising fro...
Horatiu Cirstea, Germain Faure, Maribel Fern&aacut...
GI
2004
Springer
15 years 10 months ago
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
Jan Olaf Blech, Sabine Glesner
IEEEINTERACT
2003
IEEE
15 years 10 months ago
Procedure Cloning and Integration for Converting Parallelism from Coarse to Fine Grain
This paper introduces a method for improving program run-time performance by gathering work in an application and executing it efficiently in an integrated thread. Our methods ext...
Won So, Alexander G. Dean