Sciweavers

1368 search results - page 101 / 274
» Recursive modules for programming
Sort
View
ICFP
2009
ACM
14 years 9 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
JLP
2007
114views more  JLP 2007»
13 years 9 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
DAM
2002
280views more  DAM 2002»
13 years 9 months ago
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be ...
Sandi Klavzar, Uros Milutinovic, Ciril Petr
DEBU
1999
85views more  DEBU 1999»
13 years 8 months ago
Specifying Database Transformations in WOL
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
Susan B. Davidson, Anthony Kosky
AGP
1994
IEEE
14 years 22 days ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...