Sciweavers

200 search results - page 9 / 40
» The Intensional Lambda Calculus
Sort
View
TCS
1998
13 years 9 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
14 years 2 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»
14 years 1 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
LPAR
2005
Springer
14 years 3 months ago
Disjunctive Constraint Lambda Calculi
Abstract. Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no...
Matthias M. Hölzl, John N. Crossley
LICS
1993
IEEE
14 years 1 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