Sciweavers

1096 search results - page 33 / 220
» Type inference for atomicity
Sort
View
FLOPS
2008
Springer
13 years 9 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
IWPC
2000
IEEE
14 years 2 days ago
Types and Concept Analysis for Legacy Systems
We combine type inference and concept analysis in order to gain insight into legacy software systems. Type inference for COBOL yields the types for variables and program parameter...
Tobias Kuipers, Leon Moonen
ESOP
2006
Springer
13 years 11 months ago
Types for Dynamic Reconfiguration
We define a core language combining computational and architectural primitives, and study how static typing may be used to ensure safety properties of component composition and dyn...
João Costa Seco, Luís Caires
WCRE
1999
IEEE
13 years 12 months ago
An Incremental Semi-Automatic Method for Component Recovery
Atomic components are sets of related variables, types, rograms, e.g., abstract data types and objects. Many techniques exist to detect them automatically. However, as an evaluati...
Rainer Koschke
ICFP
2003
ACM
14 years 7 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet