This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestat...