Sciweavers

1005 search results - page 129 / 201
» Operational Semantics and Program Equivalence
Sort
View
FPCA
1989
14 years 1 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,...
SAS
2007
Springer
126views Formal Methods» more  SAS 2007»
14 years 3 months ago
Hierarchical Pointer Analysis for Distributed Programs
We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space lan...
Amir Kamil, Katherine A. Yelick
ICFP
2010
ACM
13 years 10 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
PPDP
2009
Springer
14 years 3 months ago
Session types for linear multithreaded functional programming
The construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on prec...
Vasco Thudichum Vasconcelos
SEMWEB
2009
Springer
14 years 3 months ago
Processing OWL2 Ontologies using Thea: An Application of Logic Programming
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically...
Vangelis Vassiliadis, Jan Wielemaker, Chris Mungal...