Sciweavers

4211 search results - page 38 / 843
» Types as Abstract Interpretations
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
14 years 11 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
MABS
2000
Springer
15 years 3 months ago
The Use of Models - Making MABS More Informative
g of target systems attempted but rather an abstraction of the target systems is modelled and insights bout the abstraction then applied back to the target systems. The MABS modell...
Bruce Edmonds
FPCA
1989
15 years 3 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
CACM
1998
81views more  CACM 1998»
14 years 11 months ago
Toward a Model of Type Inheritance
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...
C. J. Date, Hugh Darwen
MPC
2004
Springer
109views Mathematics» more  MPC 2004»
15 years 5 months ago
Optimizing Generic Functions
Abstract. Generic functions are defined by induction on the structural representation of types. As a consequence, by defining just a single generic operation, one acquires this o...
Artem Alimarine, Sjaak Smetsers