Sciweavers

632 search results - page 110 / 127
» Proving Invariants of Functional Programs
Sort
View
TACS
1994
Springer
15 years 4 months ago
Full Abstraction for PCF
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
Samson Abramsky, Pasquale Malacaria, Radha Jagadee...
127
Voted
ITP
2010
178views Mathematics» more  ITP 2010»
15 years 2 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
ENTCS
2007
105views more  ENTCS 2007»
15 years 12 days ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
112
Voted
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 3 days ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
101
Voted
SIAMJO
2010
108views more  SIAMJO 2010»
14 years 10 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer