Sciweavers

144 search results - page 16 / 29
» Type Substitution for Object-Oriented Programming
Sort
View
ECOOP
1997
Springer
13 years 11 months ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
ENTCS
2002
136views more  ENTCS 2002»
13 years 7 months ago
Comparing Calculi of Explicit Substitutions with Eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
Mauricio Ayala-Rincón, Flávio L. C. ...
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
14 years 27 days ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith
JUCS
2008
149views more  JUCS 2008»
13 years 7 months ago
Binary Methods Programming: the Clos Perspective
: Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise regarding the relationship between types and classes in the context of ...
Didier Verna
CADE
2005
Springer
14 years 7 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka