Sciweavers

4835 search results - page 161 / 967
» Refactoring Functional Programs
Sort
View
AGP
1997
IEEE
15 years 2 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
ENTCS
2007
113views more  ENTCS 2007»
14 years 10 months ago
The Interactive Curry Observation Debugger iCODE
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...
Parissa H. Sadeghi, Frank Huch
CORR
2000
Springer
103views Education» more  CORR 2000»
14 years 10 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
INFORMATICALT
2000
108views more  INFORMATICALT 2000»
14 years 10 months ago
Theoretical Foundations of an Environment-Based Multiparadigm Language
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...
Mario Blazevic, Zoran Budimac, Mirjana Ivanovic