Sciweavers

76 search results - page 13 / 16
» Termination of just fair computations in term rewriting
Sort
View
CIE
2008
Springer
13 years 9 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
ICDCS
2003
IEEE
14 years 26 days ago
Partial Lookup Service
Lookup services are used in many Internet applications to translate a key (e.g., a file name) into an associated set of entries (e.g., the location of file copies). The key look...
Qixiang Sun, Hector Garcia-Molina
PODS
2010
ACM
249views Database» more  PODS 2010»
14 years 20 days ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...
DAC
2007
ACM
14 years 8 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...