Sciweavers

117 search results - page 2 / 24
» Automatic type inference via partial evaluation
Sort
View
LOPSTR
2004
Springer
13 years 10 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
ECOOP
2011
Springer
12 years 5 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller
JFP
2000
163views more  JFP 2000»
13 years 5 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
ICASSP
2011
IEEE
12 years 9 months ago
Learning and inference algorithms for partially observed structured switching vector autoregressive models
We present learning and inference algorithms for a versatile class of partially observed vector autoregressive (VAR) models for multivariate time-series data. VAR models can captu...
Balakrishnan Varadarajan, Sanjeev Khudanpur
ECOOP
2012
Springer
11 years 7 months ago
Inference and Checking of Object Ownership
Ownership type systems describe a heap topology and enforce an encapsulation discipline; they aid in various program correctness and understanding tasks. However, the annotation ov...
Wei Huang, Werner Dietl, Ana Milanova, Michael D. ...