Editorial message

Abstract

OBJECTIVES OF THE TRACKProgramming languages are programmers' most basic tools. With appropriate programming languages one can drastically reduce the cost of building new applications as well as maintaining existing ones. In the last decades programming languages have made a large shift from procedural and structured programming towards new programming paradigms such as logic, functional and object-oriented programming. The main driving force was and will continue being to better express programmer's ideas. Therefore, research in programming languages is an endless activity and the core of computer science. New language features, new programming paradigms, better compile-time and run-time mechanisms can be foreseen in the future. The PL Track aims at providing researchers and practitioners in the world with opportunities to present their ideas and experience in designing new programming concepts and implementing programming languages.Original papers and implementation reports were invited in all areas of programming languages. These included: compiling techniques, domain-specific languages, formal semantics and syntax, garbage collection, language design and implementations, new programming language ideas and concepts, new programming paradigms, practical experiences with programming languages, program analysis and verification, program generation and transformation, programming languages from all paradigms (agentoriented, aspect-oriented, functional, logic, object-oriented, etc.), and visual programming languages. STATISTICAL INFORMATIONThe response to the call for papers was better than in the previous years. A total of twenty papers were received, representing thirteen countries (). Eight regular papers and one poster paper were accepted after a rigorous reviewing process performed by the program committee and additional reviewers. Thus, the acceptance ratio for the track was 40%. THE CONTRIBUTED PAPERSMichaelson, Hammond, and Serot [1] describe a domain-specific language called FSM-Hume. It is a subset of Hume based on generalized linear bounded automata with statically determinable time and space use.