67 search results - page 8 / 14 » A Proof Theory for Generic Judgments: An extended abstract |
HASKELL
2009
ACM
14 years 1 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
PLSA
1994
13 years 10 months ago
1994
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
COLT
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
LICS
1994
IEEE
13 years 10 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...