Results 1  10
of
4,346
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
Mathematics of Recursive Program Construction
, 2001
"... A discipline for the design of recursive programs is presented. The core concept ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A discipline for the design of recursive programs is presented. The core concept
Induction of Recursive Program Schemes
 In Proceedings of the 10th European Conference on Machine Learning (ECML98
, 1998
"... . In this paper we present an approach to the induction of recursive structures from examples which is based on the notion of recursive program schemes. We separate induction from examples in two stages: (1) constructing initial programs from examples and (2) folding initial programs to recursiv ..."
Abstract

Cited by 20 (17 self)
 Add to MetaCart
. In this paper we present an approach to the induction of recursive structures from examples which is based on the notion of recursive program schemes. We separate induction from examples in two stages: (1) constructing initial programs from examples and (2) folding initial programs
On Finitely Recursive Programs
 TO APPEAR IN THEORY AND PRACTICE OF LOGIC PROGRAMMING (TPLP)
, 2009
"... Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable model semantics is Π 1 1hard. In this paper we prove that a ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
larger class of programs, called finitely recursive programs, preserves most of the good properties of finitary programs under the stable model semantics, namely: (i) finitely recursive programs enjoy a compactness property; (ii) inconsistency checking and skeptical reasoning are semidecidable; (iii
Compiling Syntactically Recursive Programs
, 1993
"... Lisp programs are traditionally represented by Sexpressions. Sideeffecting Sexpressions allows to easily build cyclic Sexpressions which can be turned, through macroexpansion, into syntactically recursive programs i.e., programs which do not have a finite DAGlike representation. We do not know ..."
Abstract
 Add to MetaCart
Lisp programs are traditionally represented by Sexpressions. Sideeffecting Sexpressions allows to easily build cyclic Sexpressions which can be turned, through macroexpansion, into syntactically recursive programs i.e., programs which do not have a finite DAGlike representation. We do not know
Modular Verification of Recursive Programs
, 2009
"... We argue that verification of recursive programs by means of the assertional method of C.A.R. Hoare can be conceptually simplified using a modular reasoning. In this approach some properties of the program are established first and subsequently used to establish other program properties. We illustr ..."
Abstract
 Add to MetaCart
We argue that verification of recursive programs by means of the assertional method of C.A.R. Hoare can be conceptually simplified using a modular reasoning. In this approach some properties of the program are established first and subsequently used to establish other program properties. We
Recursive Programs in the Abstract
"... Semantics of recursive programs has been extensively studied for more than 30 years, and now there exist several wellestablished theories, most notably the fixedpoint semantics and domain theory developped by Dana Scott and others. Is it then true that all the issues regarding recursive programs h ..."
Abstract
 Add to MetaCart
Semantics of recursive programs has been extensively studied for more than 30 years, and now there exist several wellestablished theories, most notably the fixedpoint semantics and domain theory developped by Dana Scott and others. Is it then true that all the issues regarding recursive programs
Realizability of Concurrent Recursive Programs
, 2008
"... We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multistack visibly pushdown automata and Zielonka’s asynchronous automata towards a mod ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multistack visibly pushdown automata and Zielonka’s asynchronous automata towards a
Recursive Program Synthesis
"... Abstract. Inputoutput examples are a simple and accessible way of describing program behaviour. Program synthesis from inputoutput examples has the potential of extending the range of computational tasks achievable by endusers who have no programming knowledge, but can articulate their desired co ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
computations by describing inputoutput behaviour. In this paper, we present Escher, a generic and efficient algorithm that interacts with the user via inputoutput examples, and synthesizes recursive programs implementing intended behaviour. Escher is parameterized by the components (instructions) that can
Satisfiability modulo recursive programs
 In Static Analysis Symposium (SAS
, 2011
"... Abstract. We present a semidecision procedure for checking satisfiability of expressive correctness properties of recursive firstorder functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. We implemented our procedure and integrat ..."
Abstract

Cited by 31 (15 self)
 Add to MetaCart
Abstract. We present a semidecision procedure for checking satisfiability of expressive correctness properties of recursive firstorder functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. We implemented our procedure
Results 1  10
of
4,346