Sciweavers

3552 search results - page 512 / 711
» Proof theory in the abstract
Sort
View
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
16 years 4 days ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
EUROPAR
2005
Springer
16 years 3 days ago
Batch-Scheduling Dags for Internet-Based Computing
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...
Grzegorz Malewicz, Arnold L. Rosenberg
ACMICEC
2004
ACM
148views ECommerce» more  ACMICEC 2004»
16 years 8 hour ago
A secure and private clarke tax voting protocol without trusted authorities
Electronic voting has become one of the most popular activities over the Internet. Security and privacy are always regarded as crucial factors in electronic voting system design. ...
Changjie Wang, Ho-fung Leung
SPAA
2004
ACM
16 years 10 min ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ICALP
2004
Springer
15 years 12 months ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt