Skip to search formSkip to main contentSkip to account menu

Mutual recursion

Known as: Mutually recursive 
The most important basic example of a data type that can be defined by mutual recursion is a tree, which can be defined mutually recursively in terms… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Decision procedures are widely used in automated reasoning tools in order to reason about data structures. Their scope is… 
2004
2004
QUODLIBET is a tactic-based inductive theorem prover for the verification of algebraic specifications of algorithms in the style… 
1999
1999
Join calculus, usually presented as a process calculus, is suitable as a foundation of both sequential and concurrent programming… 
1998
1998
This report is one part of a series of documents describing the fully veri ed speci cation, construction and implementation of a… 
1996
1996
We present a continuous speech recognition architecture with a tightly coupled language model that tries to improve the dwindling… 
1995
1995
An SPMD parallel implementation schema for divide-and-conquer specifications is proposed and derived by formal refinement… 
1992
1992
  • S. Tung
  • 1992
  • Corpus ID: 2116008
This paper presents a module system and a programming environment designed to support interactive program development in Scheme… 
1988
1988
Considers the optimization of recursive database queries expressed in Datalog (function-free Horn clause programs). The authors… 
1984
1984
In this paper we describe a simple semantic model for synchronous systems of processes, suitable for high level functional…