Converting an imperative program to a declarative one

Authors:
Mohamed Mbarki;Mohamed Mejri;Béchir Ktari
Affiliations:
Faculty of Software and Information Science, Department of Computer Science and Software Engineering, Laval University, Qué., Canada G1K 7P4;Faculty of Software and Information Science, Department of Computer Science and Software Engineering, Laval University, Qué., Canada G1K 7P4;Faculty of Software and Information Science, Department of Computer Science and Software Engineering, Laval University, Qué., Canada G1K 7P4
Venue:
Knowledge-Based Systems
Year:
2006

Citing 5
Cited 0

Semantics with applications: a formal introduction

Semantics with applications: a formal introduction
A type-theoretical alternative to ISWIM, CUCH, OWHY

Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
How to Integrate Object Orientation with Structured Analysis and Design

IEEE Software
The Butterfly Methodology: A Gateway-free Approach for Migrating Legacy Information Systems

ICECCS '97 Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems
A model of large program development

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main issue of this paper is to study the problem of formal translation of programs from an imperative language to a declarative one. To that end, we define a simple imperative language, denoted by L"1, that supports the basic types of statements that can be found in imperative paradigm such as assignment, looping, and selection or conditional branching. We also define a declarative language, denoted by L"2, where a program is a set of independent variable definitions that may involve some special arithmetic expressions (conditional expression or recursive expression). For instance, x=5+if(a