Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Toy program
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The transformational programming method of algorithm derivation starts with a formal specification of the result to be achieved… Expand
2011
2011
The fundamental turn of software toward concurrency, decentralization, distribution, interaction calls for conceptually extending… Expand
2009
2009
We suggest a new basic framework for the Weyl-Feferman predicativist program by constructing a formal predicative set theory P ZF… Expand
Highly Cited
2003
Highly Cited
2003
Students in programming courses generally write "toy" programs that are superficially tested, graded, and then discarded. This… Expand
Highly Cited
1999
Highly Cited
1999
TOY is the concrete implementation of CRWL, a wide theoretical framework for declarative programming whose basis is a constructor… Expand
1999
1999
We show how periodized wavelet packet transforms and periodized wavelet transforms can be implemented on a quantum computer… Expand
1998
1998
This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a… Expand
1997
1997
In earlier work, the authors presented some preliminary empirical scalability results for a constraint-based program plan… Expand
1991
1991
GEdit is a prototype graphical editor that permits you to create and manipulate three simple types of objects using shorthand and… Expand
Highly Cited
1989
Highly Cited
1989
From the Book:
PREFACE: Mathematica was officially announced in June of 1988. Since then it has found many uses in very diverse… Expand