Sciweavers

80 search results - page 5 / 16
» Recursive subtyping revealed
Sort
View
LICS
2000
IEEE
15 years 1 months ago
Efficient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
Jens Palsberg, Tian Zhao
FMOODS
2003
14 years 10 months ago
A Syntax-Directed Hoare Logic for Object-Oriented Programming Concepts
This paper outlines a sound and complete Hoare logic for a sequential object-oriented language with inheritance and subtyping like Java. It describes a weakest precondition calculu...
Cees Pierik, Frank S. de Boer
72
Voted
BMCBI
2010
177views more  BMCBI 2010»
14 years 9 months ago
Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets
Background: Phylogenetic analysis can be used to divide a protein family into subfamilies in the absence of experimental information. Most phylogenetic analysis methods utilize mu...
Aydin Albayrak, Hasan H. Otu, Ugur O. Sezerman
81
Voted
POPL
1995
ACM
15 years 1 months ago
A Type System Equivalent to Flow Analysis
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accep...
Jens Palsberg, Patrick O'Keefe
FPCA
1989
15 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,...