Sciweavers

2652 search results - page 97 / 531
» Privacy-preserving linear programming
Sort
View
MP
2010
97views more  MP 2010»
14 years 6 months ago
Semidefinite representation of convex sets
Let S = {x Rn : g1(x) 0,
J. William Helton, Jiawang Nie
ICFP
2003
ACM
15 years 11 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
ISSAC
1993
Springer
119views Mathematics» more  ISSAC 1993»
15 years 4 months ago
Finding all Hypergeometric Solutions of Linear Differential Equations
Hypergeometric sequences are such that the quotient of two successive terms is a fixed rational function of the index. We give a generalization of M. Petkov6ek’s algorithm to fi...
Marko Petkovsek, Bruno Salvy
PPDP
2010
Springer
14 years 10 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
ENTCS
2006
146views more  ENTCS 2006»
14 years 12 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov