Sciweavers

265 search results - page 27 / 53
» entcs 2007
Sort
View
94
Voted
ENTCS
2007
114views more  ENTCS 2007»
14 years 10 months ago
Active Evaluation Contexts for Reaction Semantics
In the context of process algebras it is customary to define semantics in the form of a reaction relation supported by a structural congruence relation. Recently process algebras...
Henrik Pilegaard, Flemming Nielson, Hanne Riis Nie...
ENTCS
2007
112views more  ENTCS 2007»
14 years 10 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
ENTCS
2007
101views more  ENTCS 2007»
14 years 10 months ago
Solving Sudoku Puzzles with Rewriting Rules
The aim of the sudoku puzzle (also known as number place in the United States) is to enter a numeral from 1 through 9 in each cell of a grid, most frequently a 9 × 9 grid made up...
Gustavo Santos-García, Miguel Palomino
ENTCS
2007
110views more  ENTCS 2007»
14 years 10 months ago
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
Camil Demetrescu, Giuseppe F. Italiano
78
Voted
ENTCS
2007
82views more  ENTCS 2007»
14 years 10 months ago
Syntactic Logical Relations for Polymorphic and Recursive Types
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in ...
Karl Crary, Robert Harper