Results 1  10
of
403,587
Alphastructural recursion and induction
 Journal of the ACM
, 2006
"... The nominal approach to abstract syntax deals with the issues of bound names and αequivalence by considering constructions and properties that are invariant with respect to permuting names. The use of permutations gives rise to an attractively simple formalisation of common, but often technically i ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
incorrect uses of structural recursion and induction for abstract syntax modulo αequivalence. At the heart of this approach is the notion of finitely supported mathematical objects. This paper explains the idea in as concrete a way as possible and gives a new derivation within higherorder logic
Structural Recursion as a Query Language
 In Proceedings of 3rd International Workshop on Database Programming Languages
, 1991
"... We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. Its main computational engine is structural recursion on sets. All programming is done within a "nicely" typed la ..."
Abstract

Cited by 121 (12 self)
 Add to MetaCart
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. Its main computational engine is structural recursion on sets. All programming is done within a "nicely" typed
Using structural recursion for corecursion
 In Types for Proofs and Programs, International Conference, TYPES 2008, volume 5497 of LNCS
, 2009
"... Abstract. We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect the guardedness condition. The guardedness condition is imposed on definitions of corecursive functions in Coq, AGDA, and other higherorder proof assistants. In ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. In this paper, we concentrate in particular on those nonguarded equations where recursive calls appear under functions. We use a correspondence between streams and functions over natural numbers to show that some classes of nonguarded definitions can be modelled through the encoding as structural recursive
Structurally Recursive Descent Parsing
, 2008
"... Recursive descent parsing does not terminate for left recursive grammars. We turn recursive descent parsing into structurally recursive descent parsing, acceptable by total dependently typed languages like Agda, by using the type system to rule out left recursion. The resulting library retains much ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Recursive descent parsing does not terminate for left recursive grammars. We turn recursive descent parsing into structurally recursive descent parsing, acceptable by total dependently typed languages like Agda, by using the type system to rule out left recursion. The resulting library retains much
A Predicative Analysis of Structural Recursion
, 1999
"... We introduce a language based upon lambda calculus with products, coproducts and strictly positive inductive types that allows the definition of recursive terms. We present the implementation (foetus) of a syntactical check that ensures that all such terms are structurally recursive, i.e., recursive ..."
Abstract

Cited by 42 (20 self)
 Add to MetaCart
We introduce a language based upon lambda calculus with products, coproducts and strictly positive inductive types that allows the definition of recursive terms. We present the implementation (foetus) of a syntactical check that ensures that all such terms are structurally recursive, i
Nominal Structures and Structural Recursion
"... It is possible within Tree Adjoining Grammar to reproduce many of the syntactic analyses originally formulated by linguists in transformational terms. Tothe extent that these analyses are wellmotivated empirically, this fact makes TAG interesting for use in developing computational learning and ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
It is possible within Tree Adjoining Grammar to reproduce many of the syntactic analyses originally formulated by linguists in transformational terms. Tothe extent that these analyses are wellmotivated empirically, this fact makes TAG interesting for use in developing computational learning and processing models (Joshi 1990, Frank 1992, Rambow 1994), since the use of other nontransformational formalisms sometimes forces choices of linguistic description different from those ordinarily made by descriptive syntacticians. Thus, using TAG, one can takeadvantage in the construction of parsers and learners of the computational tractability of a mathematically restrictive formalism without having to reinvent empirical syntax in order to do so. At the same time, TAG analyses are not identical in every detail to their transformational counterparts; and it is interesting to compare them where they diverge. The differences arise because of a fundamental difference in the way that synt...
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract

Cited by 653 (3 self)
 Add to MetaCart
A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations
On Two Forms of Structural Recursion
 in &quot;LNCS 893: Proceedings of 5th International Conference on Database Theory,&quot; 111124
, 1995
"... . We investigate and compare two forms of recursion on sets for querying nested collections. The first one is called sri and it corresponds to sequential processing of data. The second one is called sru and it corresponds to dataparallel processing. A uniform firstorder translation from sru into s ..."
Abstract

Cited by 18 (12 self)
 Add to MetaCart
. We investigate and compare two forms of recursion on sets for querying nested collections. The first one is called sri and it corresponds to sequential processing of data. The second one is called sru and it corresponds to dataparallel processing. A uniform firstorder translation from sru
Bidirectionalizing structural recursion on graphs
"... The GRACE technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electro ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The GRACE technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.
Unifying structured recursion schemes
 in International Conference on Functional Programming. ACM
"... Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify the various generalisations: two prominent su ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
such unifications are the ‘recursion schemes from comonads ’ of Uustalu, Vene and Pardo, and our own ‘adjoint folds’. Until now, these two unified schemes have appeared incompatible. We show that this appearance is illusory: in fact, adjoint folds subsume recursion schemes from comonads. The proof of this claim
Results 1  10
of
403,587