Sciweavers

1302 search results - page 106 / 261
» Fair Equivalence Relations
Sort
View
BIRTHDAY
2006
Springer
14 years 1 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
RTA
2000
Springer
14 years 1 months ago
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
Jordi Levy, Mateu Villaret
ESOP
2008
Springer
13 years 12 months ago
Upper Adjoints for Fast Inter-procedural Variable Equalities
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
Markus Müller-Olm, Helmut Seidl
ZEUS
2010
214views Communications» more  ZEUS 2010»
13 years 11 months ago
On the behavioural dimension of correspondences between process models
Enterprise-wide process harmonisation initiatives require the analysis of commonalities of existing business process models. That is, correspondences between activities are identif...
Matthias Weidlich, Mathias Weske
MCU
1998
117views Hardware» more  MCU 1998»
13 years 11 months ago
The Turing Closure of an Archimedean Field
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
Paolo Boldi, Sebastiano Vigna