Sciweavers

424 search results - page 9 / 85
» A Lambda Calculus with Forms
Sort
View
TCS
1998
14 years 11 months ago
Unary PCF is Decidable
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
Ralph Loader
ECOOP
1998
Springer
15 years 3 months ago
On Object Extension
The last few years have seen the development of statically typed object based (also called prototype-based) programming languages. Two proposals, namely the Lambda Calculus of Obje...
Luigi Liquori
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
15 years 3 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
LICS
1993
IEEE
15 years 3 months ago
A lambda calculus of objects and method specialization
This paper presents an untyped lambda calculus, extended with object primitives that reflect the capabilities of so-called delegation-based object-oriented languages. A type infer...
John C. Mitchell, Furio Honsell, Kathleen Fisher
CTCS
1987
Springer
15 years 3 months ago
A Typed Lambda Calculus with Categorical Type Constructors
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categoric...
Tatsuya Hagino