2272 search results - page 6 / 455 » A Calculus for |
169
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
: We give a semantics for a typed object calculus, an extension of System F with object subsumption and method override. We interpret the calculus in a per model, proving the sound...
185
click to vote
FOSAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...
215
click to vote
APAL
2011
15 years 1 months ago
2011
We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an ex...
157
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
124
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.