Difference between revisions of "Climb"

Revision as of 14:42, 18 October 2013

It appears that if all the projects of the LRDE involve various application areas, a common underlying problem is how to reconcile two aspects that are usually contradictory: performance and genericity.

This issue has led the lab's teams to develop a long-term software engineering based on technical C++ with many templates. This approach has its drawbacks. Disadvantages include the fact that C++ is a heavy language with an extremely complex and ambiguous syntax, that the template system is actually a completely different language from standard C++, and finally that it is a static language. This last point has significant implications on the application, insofar as it imposes a strict chain of Compilation => Development => Run => Debug, making for example rapid prototyping or human-machine interfacing activities difficult. It becomes therefore essential to equip the involved projects with a third language infrastructure that is rather based on scripting languages.

Facing these problems, another team of the laboratory has chosen to focus on the persistent question of performance and genericity with a transversal approach, that is to say focused on alternative languages rather than on a particular application domain. The purpose of this research is therefore to examine the solutions offered by languages other than C++, especially dynamic languages, and we chose Common Lisp.

Perfomance

At first glance, it seems paradoxical indeed to use, for performance issues, a language which is legitimately expected to deteriorate them. Almost by definition, a dynamic language does less at compile-time and more at run-time (eg, type checking). Most modern dynamic languages like Python and Ruby match these preconceived notions. Common Lisp, however, has this ability to let you static type pieces of the code you write, and let the rest be dynamically typed. A compiler that is properly informed about such types is then free to perform any possible optimization, even to produce a weakly typed executable as a C compiler would do.

Therefore, one goal of this research focuses on comparing the performance obtained by some Common Lisp compilers with those of equivalent programs written in C or C++. This work involves a substantial set of performance measurements on micro-benchmarks to evaluate the cost of some basic operations (arithmetic, object instantiation, access to their members, dynamic dispatch, etc.).

Genericity

Once the issue of performance is resolved, we still have to demonstrate the benefits of a dynamic language for genericity. The basis of this approach lies in a fact that is this time widely recognized: dynamic languages are more expressive. By eliminating especially the static typing, and consequently, by expanding the scope of polymorphism, dynamic languages provide paradigms that are impossible or difficult to obtain in static languages. If we take simply the paradigm of object-oriented programming, Common Lisp goes further than other (static or dynamic) languages if that the object layer is based on a so-called meta-object protocol: a reflexive architecture that implements the object layer in itself, and that also allows to modify or extend it. Thus, far from the classical OO approach of traditional languages, the object-oriented layer of Common Lisp includes natively multimethods, and allows the use (and mix) of traditional classes-based, prototype-based, context-oriented approaches, etc.

The second line of research in this work consists in the study of all these new programming paradigms in terms of what they bring to the notion of genericity. To do this, we have chosen to clone one of the oldest projects of the laboratory (Olena) and to express the same issues following an axis of dynamic genericity.

Finally, a longer-term perspective will be to reconcile these aspects of dynamic genericity with the performances of a dedicated code. This step should also be made significantly easier than the manipulation of C++ templates because of the structural reflexivity of Lisp (code and data are represented in the same way). The system of macros in Common Lisp is unique because it can perform any function written in Lisp itself during the compilation, these functions themselves having access to the code to compile. This allows in particular to rewrite the code on the fly and provides for native JIT-compilation.

Publications

Conferences

Journals

	Author	Title	Published in	Date
A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams	Jim Newton Didier Verna	A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams	ACM Transactions on Computational Logic	28 August 2018
Lisp, Jazz, Aikido	Didier Verna	Lisp, Jazz, Aikido	The Art, Science and Engineering of Programming Journal	5 February 2018
Revisiting the Visitor: the Just Do It Pattern	Didier Verna	Revisiting the Visitor: the Just Do It Pattern	Journal of Universal Computer Science	1 January 2010
Binary Methods Programming: the CLOS Perspective (extended version)	Didier Verna	Binary Methods Programming: the CLOS Perspective (extended version)	Journal of Universal Computer Science	1 January 2008
How to make Lisp go faster than C	Didier Verna	How to make Lisp go faster than C	IAENG International Journal of Computer Science	1 December 2006

Book chapters

	Author	Title	Published in	Date
Extensible languages: blurring the distinction between DSLs and GPLs	Didier Verna	Extensible languages: blurring the distinction between DSLs and GPLs	Formal and Practical Aspects of Domain-Specific Languages: Recent Developments	1 September 2012

@@ Line 41: / Line 41: @@
 ===== Conferences =====
-{{#ask: [[Category:Publications]] [[Publication type::inproceedings]] [[Has author::~*Didier Verna*]] [[Published in::!~Onward* || TUGboat]]
+{{#ask: [[Category:Publications]] [[Publication type::inproceedings]] [[Has author::~*Didier Verna*]] [[Published in::!~Onward*]]  OR  [[Published in::!TUGboat]]
 | ?Has author = Author
 | ?Has title = Title