Sciweavers

4370 search results - page 310 / 874
» Algebra of Logic Programming
Sort
View
DAM
2007
83views more  DAM 2007»
15 years 22 days ago
The proof theoretic strength of the Steinitz exchange theorem
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
Michael Soltys
112
Voted
ENTCS
2007
161views more  ENTCS 2007»
15 years 22 days ago
Bialgebraic Methods in Structural Operational Semantics: Invited Talk
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of alg...
Bartek Klin
106
Voted
ENTCS
2002
121views more  ENTCS 2002»
15 years 17 days ago
Modal Predicates and Co-equations
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
Alexander Kurz, Jirí Rosický
106
Voted
ESOP
2000
Springer
15 years 4 months ago
A Kleene Analysis of Mobile Ambients
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
ESOP
2000
Springer
15 years 4 months ago
Sharing Continuations: Proofnets for Languages with Explicit Control
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
Julia L. Lawall, Harry G. Mairson