Sciweavers

38 search results - page 6 / 8
» Permutative Logic
Sort
View
ANCS
2006
ACM
14 years 20 days ago
A practical fast parallel routing architecture for Clos networks
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
Si-Qing Zheng, Ashwin Gumaste, Enyue Lu
PPDP
2009
Springer
14 years 1 months ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau
RTA
2009
Springer
14 years 1 months ago
An Explicit Framework for Interaction Nets
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
Marc de Falco
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
14 years 23 days ago
Building a better Boolean matcher and symmetry detector
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
Donald Chai, Andreas Kuehlmann
ICFP
2007
ACM
14 years 6 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson