2152 search results - page 176 / 431 » On Automating the Calculus of Relations |
145
click to vote
FOSSACS
2007
Springer
16 years 1 months 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...
197
click to vote
FOSSACS
2005
Springer
16 years 19 days 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...
207
click to vote
TLCA
2005
Springer
16 years 17 days 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. ...
211
Voted
TYPES
2004
Springer
16 years 13 days 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...
190
click to vote
BIRTHDAY
2003
Springer
16 years 10 days 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 ...