Sciweavers

4767 search results - page 101 / 954
» Structures for Abstract Rewriting
Sort
View
ENTCS
2008
101views more  ENTCS 2008»
13 years 9 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 9 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
ENTCS
2006
116views more  ENTCS 2006»
13 years 9 months ago
Stepwise Refinement of Processes
Industry is looking to create a market in reliable "plug-and-play" components. To model components in a modular style it would be useful to combine event-based and state...
Steve Reeves, David Streader
KI
2008
Springer
13 years 9 months ago
Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
Martin Hofmann 0008, Emanuel Kitzelmann, Ute Schmi...
SIAMCOMP
2008
86views more  SIAMCOMP 2008»
13 years 9 months ago
The Complexity of Monadic Second-Order Unification
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...