747 search results - page 88 / 150 » Theory and Construction of Molecular Computers |
TLCA
2007
Springer
14 years 2 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
AGP
2010
IEEE
14 years 1 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
EMMCVPR
2001
Springer
14 years 1 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
FOSSACS
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...