Sisal 3.2 Language Structure Decomposition
The functional programming system SFP under development at the Institute of Informatics Systems in Novosibirsk is aimed at supporting development of parallel computing applications that still offer high performance and portability. The paper describes equivalent transformations of the Sisal 3.2 programming language (based on Sisal 90) structures. These transformations are to decompose the complex language structures into more simple ones that can be directly expressed by the internal representation IR1, which is based on the intermediate form language IF1. Currently some description of similar transformations can be found in few works about Sisal 90 in the form of examples. These transformations are performed by the front-end compiler from Sisal 3.2 into IR1 and help to better understand its translation strategy. The paper also briefly describes IR1 languages.
KeywordsOutput Port Input Port Array Element Range Generator Scatter Node
The authors are thankful to all colleagues taking part in the SFP project. The work was partially supported by the Russian Foundation for Basic Research under grant N 07-07-12050.
- 4.Feo J, et al (1995) SISAL 90. In: Proc. High Performance Functional Computing, Denver, pp 35–47Google Scholar
- 5.Stasenko AP, Sinyakov AI (2006) Basic means of the Sisa 3.1 language (in Russian). Preprint N 132, A.P. Ershov Institute of Informatics Systems, NovosibirskGoogle Scholar
- 6.Kasyanov VN, Stasenko AP, Gluhankov MP, Dortman PA, Pyjov KA, Sinyakov AI (2006) SFP – An interactive visual environment for supporting of functional programming and supercomputing. WSEAS Trans Comput 5:2063–2070Google Scholar
- 7.Kasyanov VN, Biryukova YuV, Evstigneev VA (2001) A functional language SISAL 3.0 (in Russian). In: Supercomputing support and Internet-oriented technologies, Novosibirsk, pp 54–67Google Scholar
- 8.Stasenko AP (2004) Internal representation of functional programming system SISAL 3.0 (in Russian). Preprint N 110, A.P. Ershov Institute of Informatics Systems, NovosibirskGoogle Scholar
- 9.Skedzielewski SK, Glauert J (1985) IF1 – An intermediate form for applicative languages, version 1.0. Tech. Rep. M-170, Lawrence Livermore National Laboratory, Livermore, CAGoogle Scholar
- 10.Kasyanov VN, Lisitsyn IA (2000) Hierarchical graph models and visual processing. In: Proceedings of the International Conference on Software: Theory and Practice, 16th IFIP World Computer Congress, PHEI, Beijing, pp 179–182Google Scholar