Sciweavers

284 search results - page 3 / 57
» Recursive Abstractions for Parameterized Systems
Sort
View
KI
2007
Springer
13 years 11 months ago
Inductive Synthesis of Recursive Functional Programs
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
Martin Hofmann 0008, Andreas Hirschberger, Emanuel...
ICDT
2003
ACM
126views Database» more  ICDT 2003»
13 years 11 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
ICFP
2007
ACM
14 years 5 months ago
A type system for recursive modules
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
Derek Dreyer
CSL
2010
Springer
13 years 6 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
JOT
2007
68views more  JOT 2007»
13 years 5 months ago
A Parameterized Type System for Simple Loose Ownership Domains
ome this restriction, we develop so-called loose domains which abstract over several precise domains. Similar to the relation between supertypes and subtypes, we get a relation bet...
Jan Schaefer, Arnd Poetzsch-Heffter