A Complete Transformational Toolkit for Compilers

No abstract is available for this paper.

• Publication year

  1996

• Venue

  European Symposium on Programming

• Publication date

  1996-04-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-61055-3_31
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Towards a complete transformational toolkit for compilers

  1996cited by this paper
• A Data Type Variety of Stack Algebras

  1995cited by this paper
• Global code motion/global value numbering

  1995cited by this paper
• Term Graph Rewriting

  1995cited by this paper
• Parametric program slicing

  1995cited by this paper
• Which Data Types have omega-complete Initial Algebra Specifications?

  1994influential reference
• Value dependence graphs: representation without taxation

  1994cited by this paper
• Inductive Theorem Proving for Algebraic Specifications - TIP System User's Manual

  1994cited by this paper
• Term rewriting systems

  1993cited by this paper
• Universal algebra

  1993cited by this paper
• Call by name, assignment, and the lambda calculus

  1993cited by this paper
• From Algebra to Operational Semantics

  1993cited by this paper
• Partial evaluation and automatic program generation

  1993cited by this paper
• Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting

  1992cited by this paper
• A Simple Rewriting Semantics for Realistic Imperative Programs and its Application to Program Analysis

  1992influential reference
• A program integration algorithm that accommodates semantics-preserving transformations

  1992cited by this paper
• A Control-Flow Normalization Algorithm and Its Complexity

  1992cited by this paper
• Partial evaluation of high-level imperative programming languages with applications in hard real-time systems

  1992cited by this paper
• Rewrite Systems

  1991cited by this paper
• Efficiently computing static single assignment form and the control dependence graph

  1991cited by this paper
• Assignments for Applicative Languages

  1991cited by this paper
• Algebraic Specification

  1991cited by this paper
• A Guide to LP, The Larch Prover

  1991cited by this paper
• Which data types have w-complete initial algebra specifications?*

  1990cited by this paper
• A program integration algorithm that accommodates semantics-preserving transformations

  1990cited by this paper
• The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages

  1990cited by this paper
• Formal models and semantics

  1990cited by this paper
• Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness

  1990cited by this paper
• Compiling scientific code using partial evaluation

  1990cited by this paper
• Customization: optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language

  1989cited by this paper
• Detecting Program Components With Equivalent Behaviors

  1989cited by this paper
• A Syntactic Theory of Sequential State

  1989cited by this paper
• Why Functional Programming Matters

  1989cited by this paper
• Axiomatizing operational equivalence in the presence of side effects

  1989cited by this paper
• The semantics of program dependence

  1989cited by this paper
• Controlled mixed computation and its application to systematic development of language-oriented parsers

  1987cited by this paper
• Term Graph Rewriting

  1987influential reference
• Natural Semantics

  1987cited by this paper
• Laws of programming

  1987cited by this paper
• Partial Evaluation and omega-Completeness of Algebraic Specifications

  1986influential reference
• Initiality, induction, and computability

  1986cited by this paper
• Side effects and aliasing can have simple axiomatic descriptions

  1985cited by this paper
• Partial evaluation and w-completeness of algebraic specifications

  1985cited by this paper
• The program dependence graph and its use in optimization

  1984cited by this paper
• A Basic Abstract Semantic Algebra

  1984cited by this paper
• Rewrite Methods for Clausal and Non-Clausal Theorem Proving

  1983cited by this paper
• Mixed Computation: Potential Applications and Problems for Study

  1982cited by this paper
• Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

  1978cited by this paper

• Precise reasoning with structured time, structured heaps, and collective operations

  2019cites this paper
• CEAL: a C-based language for self-adjusting computation

  2009cites this paper
• Concise Concrete Syntax

  2008cites this paper
• Automatic Construction of XML-Based Tools Seen as Meta-Programming

  2004cites this paper
• Automatic validation of code-improving transformations on low-level program representations

  2004influential citation
• Validation of code-improving transformations for embeded systems

  2003cites this paper
• Automatic Validation of Code-Improving Transformations

  2000cites this paper
• A formal model of real-time program compilation

  1999cites this paper
• Equations as a uniform framework for partial evaluation and abstract interpretation

  1998cites this paper
• CTADEL: A Generator of Efficient Numerical Codes

  1998influential citation
• Re-engineering needs generic programming language technology

  1997cites this paper
• A slicing-based approach for locating type errors

  1997cites this paper
• A case study of a slicing-based approach for locating type errors

  1997cites this paper
• Epic and ARM -- user''s guide --

  1997cites this paper
• RAPPORT Implicit induction techniques for the verification of PIMa transformational toolkit for compilers

  1996cites this paper
• A Complete Transformational Toolkit for Compilers a Complete Transformational Toolkit for Compilers a Complete Transformational Toolkit for Compilers

  1996cites this paper
• Compilation of Term Rewriting Systems

  1996cites this paper
• Dynamic dependence in term rewriting systems and its application to program slicing

  1994cites this paper
• REPORT RAPPORT

  year unknowncites this paper