声明组合学:Haskell中的布尔函数、电路综合和BDD
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
摘要:
我们描述了有趣的组合生成算法的Haskell实现,重点是布尔函数和逻辑电路表示。首先,一个完整的精确组合逻辑电路合成器被描述为一个组合的变形和变形。使用配对和unpairing功能的自然数表示的真值表,我们得到了一个编码的二元决策图(BDD)的独特性质,其布尔值评估忠实地模仿其结构转换到一个自然数,通过递归应用的匹配配对功能。然后,我们使用这个结果来获得BDD和减少BDD的排名和unranking功能。最后,概括的编码技术,多终端BDD提供。这篇论文被组织成一个独立的文学Haskell程序,可在www.example.com上获得。保留字:精确组合逻辑综合,二元决策图,布尔函数编码,配对/取消配对函数,BDD和MTBDD的排名/取消排名函数,Haskell中的声明性组合学
英文摘要:
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact combinational logic circuit synthesizer is described as a combination of catamorphisms and anamorphisms. Using pairing and unpairing functions on natural number representations of truth tables, we derive an encoding for Binary Decision Diagrams (BDDs) with the unique property that its boolean evaluation faithfully mimics its structural conversion to a a natural number through recursive application of a matching pairing function. We then use this result to derive ranking and unranking functions for BDDs and reduced BDDs. Finally, a generalization of the encoding techniques to Multi-Terminal BDDs is provided. The paper is organized as a self-contained literate Haskell program, available at http://logic.csci.unt.edu/tarau/research/2008/fBDD.zip . Keywords: exact combinational logic synthesis, binary decision diagrams, encodings of boolean functions, pairing/unpairing functions, ranking/unranking functions for BDDs and MTBDDs, declarative combinatorics in Haskell
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。