Sciweavers

1194 search results - page 141 / 239
» A Calculus for Predicative Programming
Sort
View
POPL
2004
ACM
16 years 6 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
ICFP
2004
ACM
16 years 6 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
KBSE
2008
IEEE
16 years 21 days ago
Type-Checking Software Product Lines - A Formal Approach
—A software product line (SPL) is an efficient means to generate a family of program variants for a domain from a single code base. However, because of the potentially high numb...
Christian Kästner, Sven Apel
ECOOP
2000
Springer
15 years 10 months ago
A Basic Model of Typed Components
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
João Costa Seco, Luís Caires
APLAS
2004
ACM
15 years 10 months ago
History Effects and Verification
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher-order programs. The ...
Christian Skalka, Scott F. Smith