Abstract
Strongly sequential systems, developed by Huet and Levy [2], has formed the basis of equational programming languages. Experience with such languages so far suggests that even complex equational programs are based only on strongly sequential systems with constructors. However, these programs are not readily amenable for efficient parallel execution. This paper introduces a class of strongly sequential systems called path sequential systems. Equational programs based on path sequential systems are more natural for parallel evaluation. An algorithm for transforming any strongly sequential system with constructors into an equivalent path sequential system is described.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
