On the conversion of indirect to direct recursion

Kaser, Owen; Ramakrishnan, C. R.; Pawagi, Shaunak

doi:10.1145/176454.176510

Cited by 16 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While having our own personal answers to these questions (squarely in favor of OOP), we hope the brief discussion above-including the illustrating analogy with natural languagessheds some light on why we believe these questions to be more philosophical and controversial questions and lesser technical and scientific ones. 8,9 5 Ideas to Incorporate Later…”

Section: Oop Versus Fpmentioning

confidence: 99%

“…Due to our belief in the strong interconnectedness of the real-world and given that not all mutual recursion (also called indirect recursion) can be translated to direct recursion [8,15], in affirmation to Penrose's opinion we believe that mutual recursion is one of the computability ideas that may be a key idea in physical theory, and, accordingly, that more use of mutual recursion (and of mutually recursive proofs, i.e., object-oriented proofs) in mathematical physics needs to be made. 10 6 Implementation/Proof of Concept…”

Section: ] Penrose Writesmentioning

confidence: 99%

See 1 more Smart Citation

Object-Oriented Theorem Proving (OOTP): First Thoughts

AbdelGawad¹

2017

Preprint

View full text Add to dashboard Cite

Automatic (i.e., computer-assisted) theorem proving (ATP) can come in many flavors. This document presents early steps in our effort towards defining object-oriented theorem proving (OOTP) as a new style of ATP.Traditional theorem proving (TTP) is the only well-known flavor of ATP so far. OOTP is a generalization of TTP. While TTP is strongly based on functional programming (FP), OOTP is strongly based on objectoriented programming (OOP) instead. We believe OOTP is a style of theorem proving that is no less powerful and no less natural than TTP and thus likely will be no less practically useful than TTP.In the document we also discuss, very briefly, a related notion of OO software verification (OOSV) based on OOTP. To clarify the relation between OOTP and TTP, we also touch on the relation between OOP and FP.

show abstract

Section: Oop Versus Fpmentioning

confidence: 99%

Section: ] Penrose Writesmentioning

confidence: 99%

Object-Oriented Theorem Proving (OOTP): First Thoughts

AbdelGawad¹

2017

Preprint

View full text Add to dashboard Cite

show abstract

“…Another method performs procedure inlining to convert mutual recursion to direct recursion [20]. This allows use of optimization techniques that are most easily applied to directly recursive procedures.…”

Section: Related Workmentioning

confidence: 99%

Recursive function data allocation to scratch-pad memory

Domínguez

Nguyen

Barua

2007

Proceedings of the 2007 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems

View full text Add to dashboard Cite

This paper presents the first automatic scheme to allocate local (stack) data in recursive functions to scratch-pad memory (SPM) in embedded systems. A scratch-pad is a fast directly addressed compiler-managed SRAM memory that replaces the hardware-managed cache. It is motivated by its significantly lower access time, energy consumption, real-time bounds, area and overall runtime. Existing compiler methods for allocating data to scratch-pad are able to place only code, global, heap and non-recursive stack data in scratch-pad memory; stack data for recursive functions is allocated entirely in DRAM, resulting in poor performance.In this paper we present a dynamic yet compiler-directed allocation method for recursive function stack data that for the first time, is able to place a portion of recursive stack data in scratch-pad. It has almost no software-caching overhead, and is able to move recursive function data back and forth between scratchpad and DRAM to better track the program's locality characteristics. With our method, all code, global, stack and heap variables can share the same scratch-pad. When compared to placing all recursive function data in DRAM and all other variables in scratch-pad, our results show that our method reduces the average runtime of our benchmarks by 29.3%, and the average power consumption by 31.1%, for the same size of scratch-pad fixed at 5% of total data size. Furthermore, significant savings were observed when comparing our method against cache-based alternatives for SPM allocation. Finally, we show results that analyze the effects of profile variation on our allocation approach and present a modified version of our method which minimizes variation for profile-based allocations.

show abstract

“…The gain in execution speed may be due to direct eects, such as the reduction in the number of call and return instructions executed or due to indirect eects, such as cache and virtual memory behavior and in-context optimizations permitted on the inlined code [8±10]. Inlining has also been used to convert as much indirect recursion to direct recursion as possible [11], and to minimize the control stack usage when the program is run with a given input [12].…”

Section: Introductionmentioning

confidence: 99%

Evaluating inlining techniques

Kaser

Ramakrishnan

1998

Computer Languages

Self Cite

View full text Add to dashboard Cite

For eciency and ease of implementation, many compilers implicitly impose an``inlining policy'' to restrict the conditions under which a procedure may be inlined. An inlining technique consists of an inlining policy and a strategy for choosing a sequence of inlining operations that is consistent with the policy. The eectiveness of an inlining technique is aected by the restrictiveness of the inlining policy as well as the eectiveness of the (heuristic) inlining strategy. The focus of this paper is on the comparison of inlining policies and techniques, and the notions of power and¯exibility are introduced. As a major case study, we identify and compare policies based on the version of the inlined procedure that is used.

show abstract

On the conversion of indirect to direct recursion

Cited by 16 publications

References 8 publications

Object-Oriented Theorem Proving (OOTP): First Thoughts

Object-Oriented Theorem Proving (OOTP): First Thoughts

Recursive function data allocation to scratch-pad memory

Evaluating inlining techniques

Contact Info

Product

Resources

About