Program transformation by templates based on term rewriting

2005 ◽  
Author(s):  
Yuki Chiba ◽  
Takahito Aoto ◽  
Yoshihito Toyama
Keyword(s):  
Program Transformation ◽  
Term Rewriting

scholarly journals Program Transformation Templates for Tupling Based on Term Rewriting

2010 ◽  
Vol E93-D (5) ◽  
pp. 963-973
Author(s):  
Yuki CHIBA ◽  
Takahito AOTO ◽  
Yoshihito TOYAMA
Keyword(s):  
Program Transformation ◽  
Term Rewriting

scholarly journals Making legacy Fortran code type safe through automated program transformation

2021 ◽  
Author(s):  
Wim Vanderbauwhede
Keyword(s):  
Side Effect ◽  
Program Transformation ◽  
The Novel ◽  
Formal Approach ◽  
Type Checking ◽  
Type Safety ◽  
Fortran Code ◽  
Fortran 90 ◽  
Code Type ◽  
Fortran 77

AbstractFortran is still widely used in scientific computing, and a very large corpus of legacy as well as new code is written in FORTRAN 77. In general this code is not type safe, so that incorrect programs can compile without errors. In this paper, we present a formal approach to ensure type safety of legacy Fortran code through automated program transformation. The objective of this work is to reduce programming errors by guaranteeing type safety. We present the first rigorous analysis of the type safety of FORTRAN 77 and the novel program transformation and type checking algorithms required to convert FORTRAN 77 subroutines and functions into pure, side-effect free subroutines and functions in Fortran 90. We have implemented these algorithms in a source-to-source compiler which type checks and automatically transforms the legacy code. We show that the resulting code is type safe and that the pure, side-effect free and referentially transparent subroutines can readily be offloaded to accelerators.

PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE
Keyword(s):  
Programming Languages ◽  
Pattern Matching ◽  
Term Rewriting ◽  
Directed Acyclic Graphs ◽  
Tree Automaton ◽  
Minimal Tree ◽  
Term Rewriting Systems ◽  
Rewriting Systems ◽  
Acyclic Graphs ◽  
Space Requirements

We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.

Sign in / Sign up

Export Citation Format

Share Document