Sciweavers

89 search results - page 4 / 18
» Unboxed Objects and Polymorphic Typing
Sort
View
LICS
2012
IEEE
11 years 9 months ago
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
Naohiko Hoshino
ENTCS
2006
89views more  ENTCS 2006»
13 years 7 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke
PODS
1994
ACM
91views Database» more  PODS 1994»
13 years 11 months ago
A Polymorphic Calculus for Views and Object Sharing
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...
Atsushi Ohori, Keishi Tajima
POPL
1995
ACM
13 years 11 months ago
Compiling Polymorphism Using Intensional Type Analysis
Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations eve...
Robert Harper, J. Gregory Morrisett
FPCA
1989
13 years 11 months ago
F-Bounded Polymorphism for Object-Oriented Programming
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
Peter S. Canning, William R. Cook, Walter L. Hill,...