Sciweavers

571 search results - page 94 / 115
» Domain Theory in Logical Form
Sort
View
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
15 years 6 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
FSKD
2007
Springer
140views Fuzzy Logic» more  FSKD 2007»
15 years 3 months ago
QoS-Aware Web Service Selection by a Synthetic Weight
The selection of web services according to different quality of service (QoS) is one of the most important decision issues for which complex considerations are involved. In many c...
PengCheng Xiong, Yushun Fan
PLDI
2004
ACM
15 years 3 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
CONTEXT
2003
Springer
15 years 2 months ago
On the Difference between Bridge Rules and Lifting Axioms
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
Paolo Bouquet, Luciano Serafini
DNA
2003
Springer
122views Bioinformatics» more  DNA 2003»
15 years 2 months ago
Self-Assembled Circuit Patterns
Abstract. Self-assembly is a process in which basic units aggregate under attractive forces to form larger compound structures. Recent theoretical work has shown that pseudo-crysta...
Matthew Cook, Paul W. K. Rothemund, Erik Winfree