Sciweavers

1989 search results - page 256 / 398
» Set functions for functional logic programming
Sort
View
AOSD
2007
ACM
15 years 7 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
ICSE
2009
IEEE-ACM
15 years 10 months ago
Semantics-based code search
Our goal is to use the vast repositories of available open source code to generate specific functions or classes that meet a user’s specifications. The key words here are spec...
Steven P. Reiss
CALCO
2009
Springer
172views Mathematics» more  CALCO 2009»
15 years 9 months ago
Coalgebraic Components in a Many-Sorted Microcosm
The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe composi...
Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokol...
IFL
2000
Springer
15 years 6 months ago
Improving Cache Effectiveness through Array Data Layout Manipulation in SAC
Sac is a functional array processing language particularly designed with numerical applications in mind. In this field the runtime performance of programs critically depends on the...
Clemens Grelck
EOR
2010
219views more  EOR 2010»
15 years 3 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...