Sciweavers

1559 search results - page 82 / 312
» Fundamentals of Generic Programming
Sort
View
IWPC
2009
IEEE
15 years 4 months ago
Intensions are a key to program comprehension
The classical comprehension theories study relations between extensions, intensions, and names. Originally developed in linguistics and mathematics, these theories are applicable ...
Václav Rajlich
SAC
2004
ACM
15 years 3 months ago
Adding wildcards to the Java programming language
This paper describes wildcards, a new language construct designed to increase the flexibility of object-oriented type systems with parameterized classes. Based on the notion of v...
Mads Torgersen, Christian Plesner Hansen, Erik Ern...
CL
2000
Springer
15 years 2 months ago
Proving Failure in Functional Logic Programs
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
Francisco Javier López-Fraguas, Jaime S&aac...
EUROPAR
2006
Springer
15 years 1 months ago
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
WCE
2007
14 years 11 months ago
Program for Structural Synthesis of the Multiple Fixtures
—This paper presents a program for structural synthesis -conception and design work-of the multiple fixture devices in the machine-tool structure. This program was created accord...
N. Seghedin, C. Zlati, N. Zlati