Sciweavers

131 search results - page 16 / 27
» types 1993
Sort
View
PPCP
1993
13 years 11 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
SIGGRAPH
1993
ACM
13 years 11 months ago
Mesh optimization
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 11 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
TAPSOFT
1993
Springer
13 years 11 months ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
13 years 11 months ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao