Sciweavers

1061 search results - page 150 / 213
» Dependently Sorted Logic
Sort
View
POPL
1997
ACM
15 years 4 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
ICCAD
1996
IEEE
92views Hardware» more  ICCAD 1996»
15 years 4 months ago
Generation of BDDs from hardware algorithm descriptions
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
Shin-ichi Minato
ICLP
1997
Springer
15 years 4 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian
ISCA
1990
IEEE
68views Hardware» more  ISCA 1990»
15 years 3 months ago
Maximizing Performance in a Striped Disk Array
Improvements in disk speeds have not kept up with improvements in processor and memory speeds. One way to correct the resulting speed mismatch is to stripe data across many disks. ...
Peter M. Chen, David A. Patterson
CSFW
2009
IEEE
15 years 3 months ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker