Sciweavers

ICDIM
2010
IEEE
13 years 2 months ago
High-order functions and their ordering relations
High-order functions are the sole elements in a class of recursive functions. The functions are related to each other through application, i.e., applying a function to an argument...
Kevin H. Xu, Jingsong Zhang, Shelby Gao
VLDB
2002
ACM
97views Database» more  VLDB 2002»
13 years 4 months ago
Structural Function Inlining Technique for Structurally Recursive XML Queries
Structurally recursive XML queries are an important query class that follows the structure of XML data. At present, it is difficult for XQuery to type and optimize structurally re...
Chang-Won Park, Jun-Ki Min, Chin-Wan Chung
TCS
2008
13 years 4 months ago
Learning recursive functions: A survey
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
Thomas Zeugmann, Sandra Zilles
APAL
2005
119views more  APAL 2005»
13 years 4 months ago
Elementary arithmetic
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
Geoffrey E. Ostrin, Stanley S. Wainer
MSCS
2006
97views more  MSCS 2006»
13 years 4 months ago
An extremely sharp phase transition threshold for the slow growing hierarchy
We investigate natural systems of fundamental sequences for ordinals below the Howard Bachmann ordinal and study growth rates of the resulting slow growing hierarchies. We consider...
Andreas Weiermann
KBS
2006
92views more  KBS 2006»
13 years 4 months ago
Facilitating formal specification acquisition by using recursive functions on context-free languages
Although formal specification techniques are very useful in software development, the acquisition of formal specification is a difficult task. This paper presents the formal softw...
Haiming Chen, Yunmei Dong
CORR
2008
Springer
75views Education» more  CORR 2008»
13 years 4 months ago
Inductive and Coinductive Components of Corecursive Functions in Coq
In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for c...
Yves Bertot, Ekaterina Komendantskaya
BIRTHDAY
2010
Springer
13 years 5 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
FLOPS
2006
Springer
13 years 8 months ago
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
Gilles Barthe, Julien Forest, David Pichardie, Vla...
CIE
2006
Springer
13 years 8 months ago
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions
In this paper we first survey recent advances on phase transition phenomena which are related to natural subclasses of the recursive functions. Special emphasis is put on descent ...
Andreas Weiermann