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)

Related topics

Related topics

34 relations
Algebraic data typeCircular dependencyComputer scienceCooperative multitasking

Broader (1)

Theory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
HOL with Definitions: Semantics, Soundness, and a Verified Implementation
We present a mechanised semantics and soundness proof for the HOL Light kernel including its definitional principles, extending… 
2008
2008
A gentle introduction to mutual recursion
Recursion is an important topic in computer science curricula. It is related to the acquisition of competences regarding problem… 
2006
2006
Implicit Induction Methods and Decision Procedures ? ( Extended Version )
Decision procedures are widely used in automated reasoning tools in order to reason about data structures. Their scope is… 
2004
2004
The New Standard Tactics of the Inductive Theorem Prover Quodlibet the New Standard Tactics of the Inductive Theorem Prover Quodlibet
QUODLIBET is a tactic-based inductive theorem prover for the verification of algebraic specifications of algorithms in the style… 
2001
2001
Local CPS conversion in a direct-style compiler
Local CPS conversion is a compiler transformation for improving the code generated for nested loops by a direct-style compiler… 
1998
1998
Dependence analysis for recursive data
  • Yanhong A. Liu
  • Proceedings of the International Conference on…
  • 1998
  • Corpus ID: 564656
The paper describes a general and powerful method for dependence analysis in the presence of recursive data constructions. The… 
1997
1997
Programming with regions in the ML Kit
integer 32 bits, untagged. Unboxed (i.e., not region allocated). real 64 bits, untagged. Boxed (i.e., allocated in region) string… 
1993
1993
A Broader Class of Trees for Recursive Type Definitions for HOL
In this paper we describe the construction in Hol of the inductive type of arbitrarily branching labeled trees. Such a type is… 
1988
1988
An optimization strategy for recursive queries in logic databases
Considers the optimization of recursive database queries expressed in Datalog (function-free Horn clause programs). The authors… 
1988
1988
Recursive ascent: an LR analog to recursive descent
The usual implementation of a parser for an LL grammar is a recursive descent parser, a set of mutually recursive procedures, one… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)