40 search results - page 6 / 8 » Unary Primitive Recursive Functions |
107
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
118
Voted
PPDP
2009
Springer
15 years 9 months ago
2009
Springer
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...
134
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generali...
112
Voted
ISMVL
2002
IEEE
15 years 7 months ago
2002
IEEE
Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider ways to improve the construction of multiple-value...
112
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...