Relevant bibliographies by topics / Recursive programming

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Recursive programming'

Author: Grafiati
Published: 4 June 2021
Last updated: 31 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Recursive programming.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Recursive programming"

1

Chiang, David, Colin McDonald, and Chung-chieh Shan. "Exact Recursive Probabilistic Programming." Proceedings of the ACM on Programming Languages 7, OOPSLA1 (April 6, 2023): 665–95. http://dx.doi.org/10.1145/3586050.

Full text
Abstract:
Recursive calls over recursive data are useful for generating probability distributions, and probabilistic programming allows computations over these distributions to be expressed in a modular and intuitive way. Exact inference is also useful, but unfortunately, existing probabilistic programming languages do not perform exact inference on recursive calls over recursive data, forcing programmers to code many applications manually. We introduce a probabilistic language in which a wide variety of recursion can be expressed naturally, and inference carried out exactly. For instance, probabilistic pushdown automata and their generalizations are easy to express, and polynomial-time parsing algorithms for them are derived automatically. We eliminate recursive data types using program transformations related to defunctionalization and refunctionalization. These transformations are assured correct by a linear type system, and a successful choice of transformations, if there is one, is guaranteed to be found by a greedy algorithm.
APA, Harvard, Vancouver, ISO, and other styles
2

Zdor, Dmitrii Valer'evich, and Tat'yana Nikolaevna Gornostaeva. "Analysis of the methods for competing recursion in recursive riles in the logic programming language Prolog." Программные системы и вычислительные методы, no. 4 (April 2021): 68–76. http://dx.doi.org/10.7256/2454-0714.2021.4.35383.

Full text
Abstract:
One of the developing trends in programming is the logic programming associated with the implementation of tools for creating artificial intelligence. One of such programming languages is the nonprocedural declarative logic programming language Prolog. This article is dedicated to the use of recursive rules in Prolog software. The goal of this work lies in analysis of the methods for completing recursive calls in recursive rules, as well as in explication of the use of such methods on the examples of programs with recursion. The author explores the specialized literature on the topic, generalized and systematizes the data, as well as tested the programs and the progress of their implementation. Recursive rule in the Prolog software sets an infinite cycle of repetition of predicates. For completing the recursive cycle, it is necessary to set a condition within the program that would end the cycle. The article examines the variants of organizing recursions with the completion of infinite cycle. The examples used in the article allows using them as the basis for programming in language Prolog for solving similar tasks. The acquired results are valuable for further development of the use of recursive predicates in logic programming languages.
APA, Harvard, Vancouver, ISO, and other styles
3

Nakata, Keiko, and Jacques Garrigue. "Recursive modules for programming." ACM SIGPLAN Notices 41, no. 9 (September 16, 2006): 74–86. http://dx.doi.org/10.1145/1160074.1159813.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Parigot, Michel. "Recursive programming with proofs." Theoretical Computer Science 94, no. 2 (March 1992): 335–56. http://dx.doi.org/10.1016/0304-3975(92)90042-e.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

BOVE, ANA, and VENANZIO CAPRETTA. "Modelling general recursion in type theory." Mathematical Structures in Computer Science 15, no. 4 (July 15, 2005): 671–708. http://dx.doi.org/10.1017/s0960129505004822.

Full text
Abstract:
Constructive type theory is an expressive programming language in which both algorithms and proofs can be represented. A limitation of constructive type theory as a programming language is that only terminating programs can be defined in it. Hence, general recursive algorithms have no direct formalisation in type theory since they contain recursive calls that satisfy no syntactic condition guaranteeing termination. In this work, we present a method to formalise general recursive algorithms in type theory. Given a general recursive algorithm, our method is to define an inductive special-purpose accessibility predicate that characterises the inputs on which the algorithm terminates. The type-theoretic version of the algorithm is then defined by structural recursion on the proof that the input values satisfy this predicate. The method separates the computational and logical parts of the definitions and thus the resulting type-theoretic algorithms are clear, compact and easy to understand. They are as simple as their equivalents in a functional programming language, where there is no restriction on recursive calls. Here, we give a formal definition of the method and discuss its power and its limitations.
APA, Harvard, Vancouver, ISO, and other styles
6

De Nivelle, Hans. "A Recursive Inclusion Checker for Recursively Defined Subtypes." Modeling and Analysis of Information Systems 28, no. 4 (December 18, 2021): 414–33. http://dx.doi.org/10.18255/1818-1015-2021-4-414-433.

Full text
Abstract:
We present a tableaux procedure that checks logical relations between recursively defined subtypes of recursively defined types and apply this procedure to the problem of resolving ambiguous names in a programming language. This work is part of a project to design a new programming language suitable for efficient implementation of logic. Logical formulas are tree-like structures with many constructors having different arities and argument types. Algorithms that use these structures must perform case analysis on the constructors, and access subtrees whose type and existence depend on the constructor used. In many programming languages, case analysis is handled by matching, but we want to take a different approach, based on recursively defined subtypes. Instead of matching a tree against different constructors, we will classify it by using a set of disjoint subtypes. Subtypes are more general than structural forms based on constructors, we expect that they can be implemented more efficiently, and in addition can be used in static type checking. This makes it possible to use recursively defined subtypes as preconditions or postconditions of functions. We define the types and the subtypes (which we will call adjectives), define their semantics, and give a tableaux-based inclusion checker for adjectives. We show how to use this inclusion checker for resolving ambiguous field references in declarations of adjectives. The same procedure can be used for resolving ambiguous function calls.
APA, Harvard, Vancouver, ISO, and other styles
7

BOUDOL, GÉRARD. "The recursive record semantics of objects revisited." Journal of Functional Programming 14, no. 3 (April 14, 2004): 263–315. http://dx.doi.org/10.1017/s0956796803004775.

Full text
Abstract:
In a call-by-value language, representing objects as recursive records requires using an unsafe fixpoint. We design, for a core language including extensible records, a type system which rules out unsafe recursion and still supports the construction of a principal type for each typable term. We illustrate the expressive power of this language with respect to object-oriented programming by introducing a sub-language for “mixin-based” programming.
APA, Harvard, Vancouver, ISO, and other styles
8

Goncharov, S. S., and D. I. Sviridenko. "Recursive Terms in Semantic Programming." Siberian Mathematical Journal 59, no. 6 (November 2018): 1014–23. http://dx.doi.org/10.1134/s0037446618060058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Seitman, David T. "Recursive programming—A valuable technique." International Journal of Clinical Monitoring and Computing 8, no. 2 (June 1991): 121–24. http://dx.doi.org/10.1007/bf02915546.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Schmid, U., and B. Kaup. "Analogical learning in recursive programming." Kognitionswissenschaft 5, no. 1 (1995): 31. http://dx.doi.org/10.1007/s001970050018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Recursive programming"

1

Diehl, Larry. "Fully Generic Programming Over Closed Universes of Inductive-Recursive Types." PDXScholar, 2017. https://pdxscholar.library.pdx.edu/open_access_etds/3647.

Full text
Abstract:
Dependently typed programming languages allow the type system to express arbitrary propositions of intuitionistic logic, thanks to the Curry-Howard isomorphism. Taking full advantage of this type system requires defining more types than usual, in order to encode logical correctness criteria into the definitions of datatypes. While an abundance of specialized types helps ensure correctness, it comes at the cost of needing to redefine common functions for each specialized type. This dissertation makes an effort to attack the problem of code reuse in dependently typed languages. Our solution is to write generic functions, which can be applied to any datatype. Such a generic function can be applied to datatypes that are defined at the time the generic function was written, but they can also be applied to any datatype that is defined in the future. Our solution builds upon previous work on generic programming within dependently typed programming. Type theory supports generic programming using a construction known as a universe. A universe can be considered the model of a programming language, such that writing functions over it models writing generic programs in the programming language. Historically, there has been a trade-off between the expressive power of the modeled programming language, and the kinds of generic functions that can be written in it. Our dissertation shows that no such trade-off is necessary, and that we can write future-proof generic functions in a model of a dependently typed programming language with a rich collection of types.
APA, Harvard, Vancouver, ISO, and other styles
2

Lin, Chungping. "The RMT (Recursive multi-threaded) tool: A computer aided software engineeering tool for monitoring and predicting software development progress." CSUSB ScholarWorks, 1998. https://scholarworks.lib.csusb.edu/etd-project/1787.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Simon, Scott James. "The recursive multi-threaded software life-cycle." CSUSB ScholarWorks, 1997. https://scholarworks.lib.csusb.edu/etd-project/1306.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

ABDALLA, TALAL ALMUTAZ ALMANSI. "Recursive Algorithms for Set-Membership Estimation." Doctoral thesis, Politecnico di Torino, 2022. https://hdl.handle.net/11583/2972788.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xia, Shujiang. "An improved software process management tool: ReMoTe (recursively estimating multi-threaded observation tool enterprise)." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2871.

Full text
Abstract:
The principal purpose of the project is to enable ReMoTe support for multi-databases. ReMoTe stands for the Recursively Estimating Multi-Threaded Observation Technology Enterprise, which is a web-based computer aided software engineering tool for monitoring software development process. Development of ReMoTe is based on the RMT (Recursive Multi-Threaded) software life cycle developed by Scott Simon, a CSUSB alum, in his master's thesis in 1997. ReMoTe enables the monitoring of projects that use different databases in various locations. Central management can view the progress information of each project using a web browser no matter where the database or project team is located. In this project, three database software were supported, namely MySQL, Oracle, and Microsoft Access, and employed contemporary technologies such as JavaScript, PHP, and Open Database Connectivity (ODBC). Source codes are included.
APA, Harvard, Vancouver, ISO, and other styles
6

Kantipudi, Kalyana R. "Minimizing N-detect tests for combinational circuits." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Spring%20Theses/KANTIPUDI_KALYANA_27.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wallace, Michael T. "Motivational factors in farm family decision making : a multiple goal, recursive strategic programming analysis." Thesis, Queen's University Belfast, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263578.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Saito, Chieri. "A design and theory of strongly typed object-oriented programming languages for extensible recursive classes." 京都大学 (Kyoto University), 2010. http://hdl.handle.net/2433/120371.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kuo, Yi-Chiun. "Multi-database support in the recursive multi-threaded software process management tool." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2266.

Full text
Abstract:
The Recursive Multi-Threaded (RMT) software process management tool gives software developers the following capabilities: break a large project into a sequence of prototypes (or threads) track these threads individually, and estimate the progress and completion date of the project from these individual threads. The goal of this project is to provide the RMT Tool with an ability to support multi-database for collaborative software development. As a demonstration, actual data is used from several previous algorithma projects.
APA, Harvard, Vancouver, ISO, and other styles
10

DeMelo, Darrion Todd. "ReMoTe: A complete tool to support software process management." CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3104.

Full text
Abstract:
The purpose of the project is to provide the Department of Computer Science at California State University, San Bernardino with a software project management tool that will help companies in their software development. ReMoTe (Recursively Estimating Multi-Threaded Observation Technology Enterprise) will assist software engineering teams with defining their scheduled delivery dates, life-cycle definitions, team hierarchy, and communication. Using the object-oriented approach, ReMoTe can support any software life cycle model. ReMoTe can help manage and control the software process over the Web. It also allows people to manage software artifacts using database systems such as mySQL, Microsoft Access, or Oracle.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Recursive programming"

1

Nakata, Keiko. Recursive modules for programming. Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hansen, Lars Peter. Recursive linear models of dynamic economies. Cambridge, MA: National Bureau of Economic Research, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

H, Smith Carl. A recursive introduction to the theory of computation. New York: Springer, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kaplan, Simon M. Verification of recursive programs: A temporal proof approach. Urbana, Ill. (1304 W. Springfield Ave., Urbana 61801): Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sheremet, I. A. Recursive multisets and their applications. Berlin: [European Academy of Natural Sciences], 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Irigoyen, Claudio. Solutions manual for Recursive methods in economic dynamics. Cambridge, Mass: Harvard University Press, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gajić, Zoran. Singularly perturbed and weakly coupled linear control systems: A recursive approach. Berlin: Springer-Verlag, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bagus, Erich. Computergestützte Zeitreihenprognose mit linear-rekursiven Modellen. Idstein: Schulz-Kirchner Verlag, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

A, Gabriele Gary, and United States. National Aeronautics and Space Administration., eds. An investigation of new methods for estimating parameter sensitivities. Troy, N.Y: Dept. of Mechanical Engineering, Aeronautical Engineering & Mechanics, Rensselaer Polytechnic Institute, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

A, Gabriele Gary, and United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., eds. An investigation of new methods for estimating parameter sensitivities. [Washington, D.C.?]: National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Division, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Recursive programming"

1

Dijkstra, E. W. "Recursive Programming." In Edsger Wybe Dijkstra, 291–300. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3544585.3544601.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pearce, Jon. "Recursive Domains." In Programming and Meta-Programming in Scheme, 209–56. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-1682-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lu, Yung-Hsiang, and George K. Thiruvathukal. "Recursive C Functions." In Intermediate C Programming, 150–64. 2nd ed. Boca Raton: CRC Press, 2023. http://dx.doi.org/10.1201/9781003257981-14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hehner, Eric C. R. "Recursive Definition." In A Practical Theory of Programming, 91–101. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4419-8596-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Etessami, Kousha, and Mihalis Yannakakis. "Recursive Markov Decision Processes and Recursive Stochastic Games." In Automata, Languages and Programming, 891–903. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11523468_72.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lathrop, James I., and Jack H. Lutz. "Recursive computational depth." In Automata, Languages and Programming, 132–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63165-8_171.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Royer, James S., and John Case. "Limiting-Recursive Succinctness Progressions." In Subrecursive Programming Systems, 162–90. Boston, MA: Birkhäuser Boston, 1994. http://dx.doi.org/10.1007/978-1-4612-0249-3_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shen, Alexander. "Recursive and nonrecursive programs." In Algorithms and Programming, 114–23. Boston, MA: Birkhäuser Boston, 1997. http://dx.doi.org/10.1007/978-0-8176-4761-2_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ogihara, Mitsunori. "Online and Recursive Algorithms." In Fundamentals of Java Programming, 485–505. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89491-1_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Etessami, Kousha, and Mihalis Yannakakis. "Recursive Concurrent Stochastic Games." In Automata, Languages and Programming, 324–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11787006_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Recursive programming"

1

Nakata, Keiko, and Jacques Garrigue. "Recursive modules for programming." In the eleventh ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1159803.1159813.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Manchester, Zachary R., and Mason A. Peck. "Recursive Inertia Estimation with Semidefinite Programming." In AIAA Guidance, Navigation, and Control Conference. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2017. http://dx.doi.org/10.2514/6.2017-1902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pierce, Benjamin C., and David N. Turner. "Object-oriented programming without recursive types." In the 20th ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/158511.158653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rubio-Sánchez, Manuel. "Tail recursive programming by applying generalization." In the fifteenth annual conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1822090.1822119.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kneuss, Etienne, Ivan Kuraj, Viktor Kuncak, and Philippe Suter. "Synthesis modulo recursive functions." In SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2509136.2509555.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lifflander, Jonathan, and Sriram Krishnamoorthy. "Cache locality optimization for recursive programs." In PLDI '17: ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3062341.3062385.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Yanjun, Jinwei Liu, Dalin Zhang, and Xiaokang Qiu. "Reasoning about recursive tree traversals." In PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3437801.3441617.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

O'Bagy, J., and R. E. Griswold. "A recursive interpreter for the Icon programming language." In Papers of the Symposium. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/29650.29665.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Moraglio, Alberto, and Krzysztof Krawiec. "Geometric semantic genetic programming for recursive boolean programs." In GECCO '17: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3071178.3071266.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Edward Y. H., and Dennis L. Bricker. "Implementing the recursive APL code for dynamic programming." In Conference proceedings. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/97808.97852.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Recursive programming"

1

Diehl, Larry. Fully Generic Programming Over Closed Universes of Inductive-Recursive Types. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.5531.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ahn, Ki Yung. The Nax Language: Unifying Functional Programming and Logical Reasoning in a Language based on Mendler-style Recursion Schemes and Term-indexed Types. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.2086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Recursive programming' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography