Sciweavers

1613 search results - page 216 / 323
» Functional and Constraint Logic Programming
Sort
View
PPDP
2005
Springer
14 years 3 months ago
Automatic type inference via partial evaluation
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
Aaron Tomb, Cormac Flanagan
CASSIS
2004
Springer
14 years 3 months ago
Mobile Resource Guarantees for Smart Devices
We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certificates are attached...
David Aspinall, Stephen Gilmore, Martin Hofmann, D...
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 4 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
ESOP
2012
Springer
12 years 5 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
ICLP
2005
Springer
14 years 3 months ago
Guard and Continuation Optimization for Occurrence Representations of CHR
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new ...
Jon Sneyers, Tom Schrijvers, Bart Demoen