Sciweavers

16844 search results - page 389 / 3369
» How to Design Programs
Sort
View
TOOLS
1997
IEEE
15 years 11 months ago
Dynamically Extensible Objects in a Class-Based Language
Object-oriented programming techniques support construction of reusable and extensible code. However, class-based languages have poor support for implementing type-orthogonal beha...
R. W. Schmidt
FPCA
1989
15 years 11 months ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl
IJCAI
1989
15 years 8 months ago
Simulating Student Programmers
A cognitive model of student programmers is presented. The model is based on protocol studies of students writing Pascal programs, and is implemented in a computer simulation prog...
James C. Spohrer, Elliot Soloway
CONCURRENCY
2000
106views more  CONCURRENCY 2000»
15 years 6 months ago
Performance characteristics for OpenMP constructs on different parallel computer architectures
OpenMP is emerging as a quasi-standard for shared memory parallel programming on small SMP-systems. To serve as a common programming interface in shared memory parallel programmin...
Rudolf Berrendorf, Guido Nieken
CSL
2007
Springer
16 years 1 months ago
Classical Program Extraction in the Calculus of Constructions
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
Alexandre Miquel