2152 search results - page 176 / 431 » On Automating the Calculus of Relations |
130
click to vote
FOSSACS
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...
173
click to vote
FOSSACS
2005
Springer
16 years 19 hour ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
186
click to vote
TLCA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
190
click to vote
TYPES
2004
Springer
15 years 12 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
170
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The explicit management of Quality of Service (QoS) of network connectivity, such as, e.g., working cost, transaction support, and security, is a key requirement for the ...