Sciweavers

686 search results - page 17 / 138
» Foundations for Bidirectional Programming
Sort
View
ENTCS
2007
105views more  ENTCS 2007»
14 years 9 months 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...
NETWORKS
2008
14 years 9 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
ICFP
1997
ACM
15 years 1 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary
SE
2010
14 years 11 months ago
Projectional Language Workbenches as a Foundation for Product Line Engineering
: In this paper I explain the benefits of projectional language workbenches for product line engineering. The ability to extend programming languages with domain specific concepts,...
Markus Voelter
WDAG
2010
Springer
177views Algorithms» more  WDAG 2010»
14 years 8 months ago
Transactions as the Foundation of a Memory Consistency Model
We argue that traditional synchronization objects, such as locks, conditions, and atomic/volatile variables, should be defined in terms of transactions, rather than the other way ...
Luke Dalessandro, Michael L. Scott, Michael F. Spe...