Sciweavers

811 search results - page 20 / 163
» Refactoring Using Type Constraints
Sort
View
PPDP
2010
Springer
13 years 7 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
FLAIRS
2008
13 years 11 months ago
Contrast Pattern Mining with Gap Constraints for Peptide Folding Prediction
1 In this paper, we propose a peptide folding prediction method which discovers contrast patterns to differentiate and predict peptide folding classes. A contrast pattern is defin...
Chinar C. Shah, Xingquan Zhu, Taghi M. Khoshgoftaa...
ESOP
2006
Springer
14 years 8 days ago
Polymorphic Type Inference for the JNI
We present a multi-lingual type inference system for checking type safety of programs that use the Java Native Interface (JNI). The JNI uses specially-formatted strings to represe...
Michael Furr, Jeffrey S. Foster
SCP
2008
144views more  SCP 2008»
13 years 8 months ago
Implicit ownership types for memory management
Abstract. The Real-time Specification for Java (RTSJ) introduced a range of language features for explicit memory management. While the RTSJ gives programmers fine control over mem...
Tian Zhao, Jason Baker, James Hunt, James Noble, J...
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 10 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif