Sciweavers

254 search results - page 24 / 51
» Qualified Computations in Functional Logic Programming
Sort
View
ESOP
2012
Springer
12 years 6 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
APNOMS
2006
Springer
14 years 2 months ago
Proposal of Operation Method for Application Servers on NGN Using Unified Management Environment
Abstract. The Next Generation Network (NGN) has a multilayer logical construction. Network carriers use various tools in complex procedures to operate application servers on the NG...
Atsushi Yoshida, Yu Miyoshi, Yoshihiro Otsuka
ENTCS
2008
116views more  ENTCS 2008»
13 years 11 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
LATA
2009
Springer
14 years 5 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
POPL
2008
ACM
14 years 11 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume