Sciweavers

4370 search results - page 512 / 874
» Algebra of Logic Programming
Sort
View
CODES
1994
IEEE
15 years 8 months ago
Towards a declarative framework for hardware-software codesign
We present an experimental framework for mapping declarative programs, written in a language known as Ruby, into various combinations of hardware and software. Strategies for para...
Wayne Luk, Teddy Wu
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
15 years 8 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...
FLOPS
2008
Springer
15 years 5 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
ENTCS
2007
109views more  ENTCS 2007»
15 years 4 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
AUTOMATICA
2005
112views more  AUTOMATICA 2005»
15 years 4 months ago
Optimal controller tuning for nonlinear processes
: This work proposes a systematic methodology for the optimal selection of controller parameters, in the sense of minimizing a performance index which is a quadratic function of th...
Nikolaos Kazantzis, Costas Kravaris, Costas Tseron...