Sciweavers

199 search results - page 26 / 40
» Combining Strict and Soft Typing in Functional Programming
Sort
View
92
Voted
PEPM
1993
ACM
15 years 3 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
ICASSP
2011
IEEE
14 years 3 months ago
Phoneme selective speech enhancement using the generalized parametric spectral subtraction estimator
In this study, the generalized parametric spectral subtraction estimator is employed in the context of a ROVER speech enhancement framework to develop a robust phoneme class selec...
Amit Das, John H. L. Hansen
FOAL
2009
ACM
15 years 6 months ago
A machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...
Benjamin Delaware, William R. Cook, Don S. Batory
CORR
2002
Springer
96views Education» more  CORR 2002»
14 years 11 months ago
The Sketch of a Polymorphic Symphony
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
Ralf Lämmel
80
Voted
RTA
2010
Springer
15 years 3 months ago
A Rewriting Logic Semantics Approach to Modular Program Analysis
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on deļ...
Mark Hills, Grigore Rosu