Sciweavers

2272 search results - page 6 / 455
» A Calculus for
Sort
View
LICS
1994
IEEE
14 years 21 days ago
A Semantics of Object Types
: 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...
Martín Abadi, Luca Cardelli
FOSAD
2000
Springer
14 years 5 days ago
Notes on Nominal Calculi for Security and Mobility
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...
Andrew D. Gordon
APAL
2011
13 years 3 months ago
A sorting network in bounded arithmetic
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...
Emil Jerábek
ESOP
2000
Springer
14 years 5 days ago
A Calculus for Link-Time Compilation
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. ...
Elena Machkasova, Franklyn A. Turbak
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 8 months ago
The Lambek-Grishin calculus is NP-complete
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.
Jeroen Bransen