Results 1  10
of
5,512
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 649 (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
Recursive Structures for Standard ML
, 2001
"... MLis as tatically typed programming language thatis stwR for the consGHw[URY of boths mall and large programs "Programming in thes mall"is captured by StandardML Core language. "Programming in the large" is captured by Modules language that provides consN1N1N for organisw[ rela ..."
Abstract

Cited by 70 (8 self)
 Add to MetaCart
MLis as tatically typed programming language thatis stwR for the consGHw[URY of boths mall and large programs "Programming in thes mall"is captured by StandardML Core language. "Programming in the large" is captured by Modules language that provides consN1N1N for organisw[ related Core language definitions intos elfcontained modules with desAA11w[ e interfaces While the Core is usA to expres details ofalgorithms and data sawRARNw[U Modules is use toexpres the overalla chitecture of asYG wares ysewA In Standard ML, modular programs mus have asANH1Yw hierarchicalslwNHA1w the dependency between modules can never be cyclic. In particular, definitions of mutuallyrecursA e Core types and values that aris frequently in practice, can neverswN module boundaries This limitation compromisU modular programming, forcing the programmer to merge conceptually (i.e. architecturally) disural modules We prop os a practical and sndwN extensNY of the Modules language thatcaters for cyclic dependencies between both types andterms defined inswHAUYw modules OurdesEH leverages exissH features of the language,s upports stsUH compilation of mutually recursw e modules and is eas to implement.
01 laws for recursive structures
 Archive of Mathematical Logic
, 1997
"... We discuss resourcebounded measures on the class of recursive structures and prove that with respect to such measures a random recursive structure is almost surely isomorphic to the unique countable model of the extension axioms. ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We discuss resourcebounded measures on the class of recursive structures and prove that with respect to such measures a random recursive structure is almost surely isomorphic to the unique countable model of the extension axioms.
Towards a Theory of Recursive Structures
 In Proceedings of 23rd International Symposium on Mathematical Foundations of Computer Science MFCS 98
, 1998
"... In computer science, one is interested mainly in finite objects. Insofar as infinite objects are of interest, they must be computable, i.e., recursive, thus admitting an effective finite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure, model o ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
In computer science, one is interested mainly in finite objects. Insofar as infinite objects are of interest, they must be computable, i.e., recursive, thus admitting an effective finite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure, model
An Algorithmic Framework for Recursive Structural Types
, 2011
"... Structural type systems provide an interesting alternative to the more common nominal typing scheme. Many existing languages employ structural types in some form, including Modula3, Scala and various extensions proposed for Java. Previous work has addressed many aspects of structural types, such as ..."
Abstract
 Add to MetaCart
, such as efficient subtyping algorithms. Unlike nominal type systems, implementing a (recursive) structural type system remains a significant challenge. This is because a large gap exists between the formalisation of a recursive structural type system, and its algorithmic realisation. In this paper, we aim to reduce
Recursive Distributed Representations
 Artificial Intelligence
, 1990
"... A longstanding difficulty for connectionist modeling has been how to represent variablesized recursive data structures, such as trees and lists, in fixedwidth patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations for such compo ..."
Abstract

Cited by 414 (9 self)
 Add to MetaCart
A longstanding difficulty for connectionist modeling has been how to represent variablesized recursive data structures, such as trees and lists, in fixedwidth patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations
Productionrule complexity of recursive structures
"... Complex recursive structures, such as fractals, are often described by sets of production rules, also known as Lsystems. According to this description, a structure is characterized by a sequence of elements, or letters, from a finite alphabet; a production rule prescribes replacement of each letter ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Complex recursive structures, such as fractals, are often described by sets of production rules, also known as Lsystems. According to this description, a structure is characterized by a sequence of elements, or letters, from a finite alphabet; a production rule prescribes replacement of each
Data Flow Analysis of Recursive Structures
, 1996
"... . Most imperative languages only offer arrays as "firstclass" data structures. Other data structures, especially recursive data structures such as trees, have to be manipulated using explicit control of memory, i.e., through pointers to explicitly allocated portions of memory. We believe ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. Most imperative languages only offer arrays as "firstclass" data structures. Other data structures, especially recursive data structures such as trees, have to be manipulated using explicit control of memory, i.e., through pointers to explicitly allocated portions of memory. We believe
Results 1  10
of
5,512