In recent years, logical frameworks which support formalizing language specifications together with their meta-theory have been pervasively used in small and large-scale applications, from certifying code [2] to advocating a general infrastructure for formalizing the meta-theory and semantics of programming languages [5]. In particular, the logical framework LF [9], based on the dependently typed lambdacalculus, and light-weight variants of it like LF4 [17] have played a major role in these applications. While the acceptance of logical framework technology has grown and they have matured, one of the most criticized points is concerned with the run-time performance. In this tutorial we give a brief introduction to logical frameworks, describe its state-of-the art and present recent advances in addressing some of the existing performance issues. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Pientka, B. (2006). Overcoming performance barriers: Efficient verification techniques for logical frameworks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4079 LNCS, pp. 3–10). Springer Verlag. https://doi.org/10.1007/11799573_3
Mendeley helps you to discover research relevant for your work.