1888 search results - page 18 / 378 » Proof theory and computational analysis |
117
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
108
Voted
CSL
2005
Springer
15 years 6 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
95
Voted
ROOM
2000
15 years 1 months ago
2000
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
118
click to vote
ICFP
2007
ACM
16 years 15 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
101
click to vote
ECML
2006
Springer
15 years 4 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...