Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Interpolation in Computing Science: The Semantics of Modularization

Gerard R. Renardel de Lavalette
Synthese
Vol. 164, No. 3 (Oct., 2008), pp. 437-450
Published by: Springer
Stable URL: http://www.jstor.org/stable/40271082
Page Count: 14
  • Download ($43.95)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Interpolation in Computing Science: The Semantics of Modularization
Preview not available

Abstract

The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in several areas of computer science. We give a short overview, and focus on the theory of software systems and modules. An algebra of theories TA is presented, with a nonstandard interpretation of the existential quantifier ∃. In TA, the interpolation property of the underlying logic corresponds with the quantifier combination property ∃Σ ∃П S ≡ ∃(Σ ∪ П) S. It is shown how the Modularization Theorem, the Factorization Lemma and the Normal Form Theorem for module expressions can be proved in TA.

Page Thumbnails

  • Thumbnail: Page 
[437]
    [437]
  • Thumbnail: Page 
438
    438
  • Thumbnail: Page 
439
    439
  • Thumbnail: Page 
440
    440
  • Thumbnail: Page 
441
    441
  • Thumbnail: Page 
442
    442
  • Thumbnail: Page 
443
    443
  • Thumbnail: Page 
444
    444
  • Thumbnail: Page 
445
    445
  • Thumbnail: Page 
446
    446
  • Thumbnail: Page 
447
    447
  • Thumbnail: Page 
448
    448
  • Thumbnail: Page 
449
    449
  • Thumbnail: Page 
450
    450