All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 14 Next

Displaying 261 – 280 of 291

Showing per page

Two extensions of system F with (co)iteration and primitive (co)recursion principles

Favio Ezequiel Miranda-Perea (2009)

RAIRO - Theoretical Informatics and Applications

This paper presents two extensions of the second order polymorphic lambda calculus, system F, with monotone (co)inductive types supporting (co)iteration, primitive (co)recursion and inversion principles as primitives. One extension is inspired by the usual categorical approach to programming by means of initial algebras and final coalgebras; whereas the other models dialgebras, and can be seen as an extension of Hagino's categorical lambda calculus within the framework of parametric polymorphism....

Usage of modular scissors in the implementation of FEM

Frydrych, Dalibor (2010)

Programs and Algorithms of Numerical Mathematics

Finite Element Method (FEM) is often perceived as a unique and compact programming subject. Despite the fact that many FEM implementations mention the Object Oriented Approach (OOA), this approach is used completely, only in minority of cases in most real-life situations. For example, one of building stones of OOA, the interface-based polymorphism, is used only rarely. This article is focusing on the design reuse and at the same time it gives a complex view on FEM. The article defines basic principles...

Currently displaying 261 – 280 of 291