2272 search results - page 328 / 455 » A Calculus for |
ECOOP
2000
Springer
15 years 5 months ago
2000
Springer
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
ICFP
1999
ACM
15 years 5 months ago
1999
ACM
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
107
Voted
CSL
1999
Springer
15 years 5 months ago
1999
Springer
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
102
Voted
LICS
1999
IEEE
15 years 5 months ago
1999
IEEE
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
94
Voted
TABLEAUX
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...