674 search results - page 58 / 135 » Arguments and Results |
WOLLIC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
SPE
2002
13 years 8 months ago
2002
FC++ is a library for programming functionally in C++. Compared to other C++ functional programming libraries, FC++ is distinguished by its powerful type system which allows manip...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
LFCS
1994
Springer
14 years 26 days ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...