Relevant bibliographies by topics / Programming theory

Contents

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

Academic literature on the topic 'Programming theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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 'Programming theory.'

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 "Programming theory"

1

Naur, Peter. "Programming as theory building." Microprocessing and Microprogramming 15, no. 5 (May 1985): 253–61. http://dx.doi.org/10.1016/0165-6074(85)90032-8.

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

Smith, David K., Michel Minoux, and Steven Vajda. "Mathematical Programming: Theory and Algorithms." Journal of the Operational Research Society 38, no. 7 (July 1987): 666. http://dx.doi.org/10.2307/2582404.

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

Osorio, Mauricio, Bharat Jayaraman, and David A. Plaisted. "Theory of partial-order programming." Science of Computer Programming 34, no. 3 (July 1999): 207–38. http://dx.doi.org/10.1016/s0167-6423(98)00018-5.

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

Smith, David K. "Mathematical Programming: Theory and Algorithms." Journal of the Operational Research Society 38, no. 7 (July 1987): 666. http://dx.doi.org/10.1057/jors.1987.110.

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

Murty, Katta G. "Nonlinear Programming Theory and Algorithms." Technometrics 49, no. 1 (February 2007): 105. http://dx.doi.org/10.1198/tech.2007.s458.

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

Shanmugam, Ramalingam. "Mathematical programming and game theory." Journal of Statistical Computation and Simulation 90, no. 3 (June 12, 2019): 570. http://dx.doi.org/10.1080/00949655.2019.1628891.

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

de Queiroz, Ruy J. G. B., and Thomas S. E. Maibaum. "Proof theory and computer programming." Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 36, no. 5 (1990): 389–414. http://dx.doi.org/10.1002/malq.19900360505.

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

Singh, C., and M. A. Hanson. "Multiobjective fractional programming duality theory." Naval Research Logistics (NRL) 38, no. 6 (December 1991): 925–33. http://dx.doi.org/10.1002/nav.3800380610.

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

Scarf, Herbert E. "Mathematical Programming and Economic Theory." Operations Research 38, no. 3 (June 1990): 377–85. http://dx.doi.org/10.1287/opre.38.3.377.

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

Lavrischeva, K. M. "Compositional programming: theory and practice." Cybernetics and Systems Analysis 45, no. 6 (November 2009): 845–53. http://dx.doi.org/10.1007/s10559-009-9154-9.

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

Dissertations / Theses on the topic "Programming theory"

1

Hancock, P. G. "Proof theory and programming." Thesis, University of Edinburgh, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.652060.

Full text
Abstract:
The work reported in this thesis arises from the old idea, going back to the origins of constructive logic, that a proof is fundamentally a kind of program. If proofs can be considered as programs, then one might expect that proof theory should have much to contribute to the theory of programming. This has indeed turned out to be the case. Various technologies developed in proof theory are now widely used in computer science for formulating and investigating programming languages and logics connected with them. Yet there is a vigorous and venerable part of proof theory which has so far had little impact in computer science, namely ordinal-theoretic proof theory. This focuses on proofs of well-foundedness, usually expressed in the form of a schema of transfinite induction with respect to a representation of an initial segment of the countable ordinals. Proof theory of this kind is concerned with what it is that limits the capacity of a proof system to 'see into the transfinite'. If proofs can be considered as programs, what kind of program is a proof of well-foundedness? My hypothesis is that the limitations of a formal system for writing proofs of well-foundedness reflect its limitations as a system in which to program strategies for defeating ones opponent in a certain kind of game. In recent computer science, games have proved invaluable as models for describing patterns of interaction between a system and its environment. I cannot claim to have substantiated this hypothesis, but only to have taken a few steps in that direction. The work reported in the thesis lies in three areas. First, I present a framework for dependently typed programming in the style advocated by Martin-Löf. The novelties here are connected with bringing the type-theoretic approach to programming that comes from the Curry-Howard correspondence closer to the calculational approach in the categorical tradition that comes from Lambek and Lawvere. A particular challenge is to find a smooth and practical way of encoding inductive definitions. Second, I have investigated a number of ways of modeling interactive systems and transition systems in a constructive context. The focus here is on models with a direct computational interpretation, that can actually be used in programming. The approach is inspired by a construction due to Petersson and Synek. It is shown how one may represent game-theoretic strategies of various kinds using these models. Finally, I give a construction of provable ordinals within a Martin-Löf style type theory that has a type of natural numbers, and an external sequence of universes closed under general Cartesian products. The locus of the ideas for this construction lie more in conventional proof theory, and were the basis for a conjecture made by me almost thirty years ago in the work that I then abandoned. What is new here is the concept of a ‘lens’. This is a predicate transformer that has been implicit in the construction of proofs of well-foundedness since Gentzen. I hope this may be of some use in an algebraic, systematic approach to setting lower bounds on the proof-theoretic strength of more extensive type theories.
APA, Harvard, Vancouver, ISO, and other styles
2

Spjøtvold, Jørgen. "Parametric Programming in Control Theory." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-2198.

Full text
Abstract:

The main contributions in this thesis are advances in parametric programming. The thesis is divided into three parts; theoretical advances, application areas and constrained control allocation. The first part deals with continuity properties and the structure of solutions to convex parametric quadratic and linear programs. The second part focuses on applications of parametric quadratic and linear programming in control theory. The third part deals with constrained control allocation and how parametric programming can be used to obtain explicit solutions to this problem.

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

Huang, Zhengwen. "Schema theory for gene expression programming." Thesis, Brunel University, 2014. http://bura.brunel.ac.uk/handle/2438/8539.

Full text
Abstract:
This thesis studied a new variant of Evolutionary Algorithms called Gene Expression Programming. The evolution process of Gene Expression Programming was investigated from the practice to the theory. As a practice level, the original version of Gene Expression Programming was applied to a classification problem and an enhanced version of the algorithm was consequently developed. This allowed the development of a general understanding of each component of the genotype and phenotype separated representation system of the solution employed by the algorithm. Based on such an understanding, a version of the schema theory was developed for Gene Expression Programming. The genetic modifications provided by each genetic operator employed by this algorithm were analysed and a set of theorems predicting the propagation of the schema from one generation to another was developed. Also a set of experiments were performed to test the validity of the developed schema theory obtaining good agreement between the experimental results and the theoretical predictions.
APA, Harvard, Vancouver, ISO, and other styles
4

Taha, Walid. "Multi-Stage Programming : Its Theory and Applications." Doctoral thesis, Oregon Graduate Institute of Science and Technology, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-15052.

Full text
Abstract:
MetaML is a statically typed functional programming language with special support for programgeneration. In addition to providing the standard features of contemporary programminglanguages such as Standard ML, MetaML provides three staging annotations. These staging annotationsallow the construction, combination, and execution of object-programs.Our thesis is that MetaML's three staging annotations provide a useful, theoretically soundbasis for building program generators. This dissertation reports on our study of MetaML's stagingconstructs, their use, their implementation, and their formal semantics. Our results include anextended example of where MetaML allows us to produce ecient programs, an explanation ofwhy implementing these constructs in traditional ways can be challenging, two formulations ofMetaML's semantics, a type system for MetaML, and a proposal for extending MetaML with atype construct for closedness.The dissertation consolidates a number of previous publications by the author, includingMetaML's type systems and big-step semantics. The presentation is new. The proposed solutionto an implementation problem and the reduction semantics for MetaML's three staging constructsare also new.
APA, Harvard, Vancouver, ISO, and other styles
5

Qiwen, Xu. "A theory of state-based parallel programming." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306838.

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

Luo, Xiaodong. "Continuous linear programming : theory, algorithms and applications." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/10591.

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

Gammon, Shauna C. A. "Notions of category theory in functional programming." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/31756.

Full text
Abstract:
We present a detailed examination of applications of category theory to functional programming languages, with a primary focus on monads in Haskell. First, we explore E. Moggi's work in categorical semantics, which provides the theoretical foundation for employing monads in functional languages. In particular, we examine his use of Kleisli triples to model notions of computation. We then study P. Wadler's implementation of Moggi's ideas as a means to mimic side-effects in the purely functional language Haskell. We explicitly demonstrate the connections between Kleisli triples, categorytheoretic monads, and Haskell monads. It is our principal aim to provide a coherent translation between the abstracted concept of monads that exists in category theory, and the formulation of monads as type-constructors that is implemented in Haskell.
Science, Faculty of
Mathematics, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
8

Andrews, James H. "Logic programming : operational semantics and proof theory." Thesis, University of Edinburgh, 1991. http://hdl.handle.net/1842/13484.

Full text
Abstract:
Logic programming systems which use parallel strategies for computing 'and' and 'or' are theoretically elegant, but systems which use sequential strategies are far more widely used and do not fit well into the traditional theory of logic programming. This thesis presents operational and proof-theoreticcharacterisations for systems having each of the possible combinations of parallel or sequential 'and' and parallel or sequential 'or'. The operational semantics are in the form of an abstract machine. The four control strategies emerge as simple variants of this machine with varying degrees of determinism; some of these variants have equivalent, compositional operational semantics, which are given. The proof-theoretic characterisations consist of a single central sequent calculus, LKE (similar to Gentzen's sequent calculus for classical first order logic), and sets of axioms which capture the success or failure of queries in the four control strategies in a highly compositional, logical way. These proof-theoretic characterisations can be seen as logical semantics of the logic programming languages. The proof systems can also be used in practice to prove more general properties of logic programs, although it is shown that they are unavoidably incomplete for this purpose. One aspect of this incompleteness is that it is not possible to derive all valid sequents having free variables; however, induction rules are given which can help to prove many useful sequents of this kind.
APA, Harvard, Vancouver, ISO, and other styles
9

Hagino, Tatsuya. "A categorical programming language." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/13976.

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

Kirby, Graham N. C. "Reflection and hyper-programming in persistent programming systems." Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/1673.

Full text
Abstract:
In an orthogonally persistent programming system, data is treated in a manner independent of its persistence. This gives simpler semantics, allows the programmer to ignore details of long-term data storage and enables type checking protection mechanisms to operate over the entire lifetime of the data. The ultimate goal of persistent programming language research is to reduce the costs of producing software. The work presented in this thesis seeks to improve programmer productivity in the following ways: • by reducing the amount of code that has to be written to construct an application; • by increasing the reliability of the code written; and • by improving the programmer’s understanding of the persistent environment in which applications are constructed. Two programming techniques that may be used to pursue these goals in a persistent environment are type-safe linguistic reflection and hyper-programming. The first provides a mechanism by which the programmer can write generators that, when executed, produce new program representations. This allows the specification of programs that are highly generic yet depend in non-trivial ways on the types of the data on which they operate. Genericity promotes software reuse which in turn reduces the amount of new code that has to be written. Hyper-programming allows a source program to contain links to data items in the persistent store. This improves program reliability by allowing certain program checking to be performed earlier than is otherwise possible. It also reduces the amount of code written by permitting direct links to data in the place of textual descriptions. Both techniques contribute to the understanding of the persistent environment through supporting the implementation of store browsing tools and allowing source representations to be associated with all executable programs in the persistent store. This thesis describes in detail the structure of type-safe linguistic reflection and hyper-programming, their benefits in the persistent context, and a suite of programming tools that support reflective programming and hyper-programming. These tools may be used in conjunction to allow reflection over hyper-program representations. The implementation of the tools is described.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Programming theory"

1

Bazaraa, Mokhtar S. Nonlinear programming: Theory andalgorithms. 2nd ed. New York: Wiley, 1993.

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

Theory of linear optimization. Utrecht: VSP, 2002.

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

Shankar, A. Udaya. Distributed Programming: Theory and Practice. New York, NY: Springer New York, 2013.

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

Functional programming: Practice and theory. Reading, Mass: Addison-Wesley, 1989.

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

MacLennan, Bruce J. Functional programming: Practice and theory. Reading, Mass: Addison-Wesley, 1990.

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

Mathematical programming: Theory and algorithms. Chichester [W. Sussex]: Wiley, 1986.

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

1952-, Sherali Hanif D., and Shetty C. M. 1929-, eds. Nonlinear programming: Theory and algorithms. 3rd ed. Hoboken, NJ: J. Wiley & Sons, 2006.

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

Hehner, Eric C. R. A practical theory of programming. New York: Springer-Verlag, 1993.

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

Bazaraa, M. S. Nonlinear programming: Theory and algorithms. 3rd ed. Hoboken, NJ: Wiley-Interscience, 2006.

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

1952-, Sherali Hanif D., and Shetty C. M. 1929-, eds. Nonlinear programming: Theory and algorithms. 2nd ed. New York: Wiley, 1993.

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

Book chapters on the topic "Programming theory"

1

Liu, Baoding. "Uncertain Programming." In Uncertainty Theory, 105–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44354-5_4.

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

Liu, Baoding. "Uncertain Programming." In Uncertainty Theory, 81–113. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13959-8_2.

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

Li, Xiang. "Credibility Theory." In Credibilistic Programming, 1–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36376-4_1.

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

Zabczyk, Jerzy. "Dynamic programming." In Mathematical Control Theory, 127–41. Boston, MA: Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4733-9_9.

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

Ma, Zhongjing, and Suli Zou. "Dynamic Programming." In Optimal Control Theory, 219–47. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-33-6292-5_5.

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

Parson, Rupert, Khalid Khan, and Stephen Muggleton. "Theory Recovery." In Inductive Logic Programming, 257–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48751-4_24.

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

Rinehart, Martin. "Inheritance Theory." In JavaScript Object Programming, 25–35. Berkeley, CA: Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1787-0_3.

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

Morris, Peter. "Linear Programming." In Introduction to Game Theory, 65–97. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-4316-8_3.

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

Florenzano, Monique, and Cuong Le Van. "Linear Programming." In Studies in Economic Theory, 51–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56522-9_4.

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

Owen, Guillermo. "Linear Programming." In Theory and Decision Library, 27–112. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-4991-8_2.

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

Conference papers on the topic "Programming theory"

1

Poli, Riccardo. "Genetic programming theory." In the 2008 GECCO conference companion. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1388969.1389068.

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

Poli, Riccardo. "Genetic programming theory." In the 12th annual conference comp. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1830761.1830905.

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

Poli, Riccardo, and William B. Langdon. "Genetic programming theory." In the 2007 GECCO conference companion. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1274000.1274124.

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

Teague, Donna M. "Programming and neo-piagetian theory." In the ninth annual international conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2361276.2361313.

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

Angiuli, Carlo, Edward Morehouse, Daniel R. Licata, and Robert Harper. "Homotopical patch theory." In ICFP'14: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2628136.2628158.

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

Pfenning, Frank. "Proof theory and its role in programming language research." In the Programming Languages Mentoring Workshop. New York, New York, USA: ACM Press, 2015. http://dx.doi.org/10.1145/2792434.2792438.

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

Slodicak, Viliam. "How to combine stochastic programming and mathematical theory of programming." In 2008 6th International Symposium on Applied Machine Intelligence and Informatics (SAMI '08). IEEE, 2008. http://dx.doi.org/10.1109/sami.2008.4469181.

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

Meseguer, José. "A logical theory of concurrent objects." In the European conference on object-oriented programming. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/97945.97958.

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

Bernardy, Jean-Philippe, and Moulin Guilhem. "Type-theory in color." In ICFP'13: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2500365.2500577.

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

Delaware, Benjamin, Steven Keuchel, Tom Schrijvers, and Bruno C. d. S. Oliveira. "Modular monadic meta-theory." In ICFP'13: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2500365.2500587.

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

Reports on the topic "Programming theory"

1

Keane, Michael K., and David W. Jensen. Computer Programming and Group Theory. Fort Belvoir, VA: Defense Technical Information Center, May 1990. http://dx.doi.org/10.21236/ada225155.

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

Prokopyev, Oleg A. New Theory and Methods in Stochastic Mixed Integer Programming. Fort Belvoir, VA: Defense Technical Information Center, July 2014. http://dx.doi.org/10.21236/ada610045.

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

Watson, Layne T. Theory and Application of Homotopy Techniques in Nonlinear Programming and Control Systems. Fort Belvoir, VA: Defense Technical Information Center, April 1995. http://dx.doi.org/10.21236/ada294934.

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

El-Bakry, A. S., Richard A. Tapia, Y. Zhang, and T. Tsuchiya. On the Formulation and Theory of the Newton Interior-Point Method for Nonlinear Programming. Fort Belvoir, VA: Defense Technical Information Center, April 1995. http://dx.doi.org/10.21236/ada453865.

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

Price, Roz. Inclusion of Marginalised Groups in Sensitive Programming in Pakistan. Institute of Development Studies (IDS), April 2021. http://dx.doi.org/10.19088/k4d.2021.090.

Full text
Abstract:
This rapid review focuses on the different variations of discrimination against marginalized groups, with a focus on the effect of intersecting and overlapping inequalities and the different experiences and outcomes they have on the varied groups. It highlights how marginalized groups have been included in interventions addressing issues of discrimination in Pakistan. The review also looks into different change interventions that deliver inclusive outcomes for women, girls and persons with disabilities with a focus on preventing violence against those groups. The review notes that intersecting inequalities have led to different experiences and outcomes relating to discrimination. It states that there is a need to address the different groups facing discrimination in a way that addresses their specified experiences because the effects of discrimination are not the same for every person. The review states that in addressing discrimination for the different groups, programmes should pursue multiple entry points to promote non-discrimination, they should work in multiple sites within and across countries and they should work with multiple partners who play different roles in communities.
APA, Harvard, Vancouver, ISO, and other styles
6

Greer, Earl D. Joint Staff Organization: Is there a Planning and Programming Function Split. Fort Belvoir, VA: Defense Technical Information Center, March 1989. http://dx.doi.org/10.21236/ada208040.

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

Haider, Huma. Mainstreaming Institutional Resilience and Systems Strengthening in Donor Policies and Programming. Institute of Development Studies (IDS), June 2021. http://dx.doi.org/10.19088/k4d.2021.101.

Full text
Abstract:
This rapid review synthesises evidence on key aspects of mainstreaming institutional resilience and systems strengthening in donor policies and programming in FCAS (Fragile and Conflict-affect States) contexts, particularly in nutrition (food security), health, WASH and the economic sector. Institutional resilience is the ability of a social system (society, community, organisation) to absorb and recover from external shocks, while positively adapting and transforming to address long-term changes and uncertainty. Investing in strong, well-functioning and adaptable social systems, such as health, education and social protection systems, can build resilience, as this help to cushion the negative economic and social effects of crises. While development actors have established guidance on how institutions can be made more effective, inclusive and accountable, there is much less literature on institutional resilience and how development actors can help to foster it. Much of the literature notes a lack of systematic evidence on applying the concept of resilience. These gaps extend to a dearth of guidance on how development actors can mainstream institutional resilience and systems strengthening into their policies and programmes. This rapid review draws on common factors discussed in the literature that are considered important to the strengthening of resilience and particular systems. These may, in turn, provide an indication of ways in which to mainstream institutional resilience and systems strengthening into development policy and programming
APA, Harvard, Vancouver, ISO, and other styles
8

Bolton, Laura. Lessons for FCDO Climate Change Programming in East Africa. Institute of Development Studies (IDS), May 2021. http://dx.doi.org/10.19088/k4d.2021.085.

Full text
Abstract:
This rapid review synthesises evidence on FCDO climate projects across the East African region in the following countries; Kenya, Rwanda, Uganda and Tanzania. This review established that sector stakeholders in countries like Rwanda lacked climate impact information. This highlights the need of providing the right information in the right form to meet the end users need. The above case studies have shown the need for consistent and harmonised future climate projections that are country specific. According to a study undertaken in Tanzania and Malawi, understanding the likely future characteristics of climate risk is a key component of adaptation and climate-resilient planning, but given future uncertainty it is important to design approaches that are strongly informed by local considerations and robust to uncertainty. According to the findings from the research, policy incoherence, over-reliance on donor funding, change in leadership roles is a barrier to adaptation. There is also an urgent need for mechanisms for sharing experience and learning from methodologies, technologies, and challenges. Further, Stakeholder dialogue and iterative climate service processes need to be facilitated. This review also explores approaches to communicating climatic uncertainties with decision-makers. Particularly, presentation of data using slide-sets, and stories about possible futures.
APA, Harvard, Vancouver, ISO, and other styles
9

Allouche, Jeremy, Harriet Hoffler, and Jeremy Lind. Humanitarianism and Religious Inequalities: Addressing a Blind Spot. Institute of Development Studies (IDS), October 2020. http://dx.doi.org/10.19088/creid.2020.002.

Full text
Abstract:
Religious identity is critically important to consider in assessing patterns of displacement and the dynamics of conflict and peace-building, as well as programmatic and policy responses to humanitarian crises. Conflicts are frequently driven by discrimination and generate massive numbers of refugees and internally displaced persons (IDPs) as they flee from persecution and violence, whilst individuals or groups may be targeted for their identity or face insecurity during community activities. As a result, the relationship between diversity, inclusivity, and interdependence is key to developing approaches that address intersecting forms of insecurity experienced by religious minorities. This paper reviews current thinking and policy directions in understanding religious inequalities in humanitarian contexts and asks the following questions: 1) What are the implications of programming that is blind to religious inequalities? 2) How can humanitarian actors incorporate sensitivity to religious difference and persecution in their programming, and what are the challenges of doing so?
APA, Harvard, Vancouver, ISO, and other styles
10

McCormack, Caitilin, Steve Jennings, and Linda Kenni. Gender and LGBTQI+ Policy and Programming in Vanuatu: Opportunities, challenges, capacity, and tools for change. Oxfam, September 2020. http://dx.doi.org/10.21201/2020.6508.

Full text
Abstract:
In 2016 the government of Vanuatu introduced a National Gender Equality Policy. A second phase of the policy will be implemented in 2020–2024. Insights from key informants working on gender in Vanuatu reveal that there have been some positive developments in the first policy phase. A number of challenges remain, however, including limited capacity in a number of key institutions, and resistance to progress caused by prevailing conservative and patriarchal values and beliefs in Vanuatu. In the absence of other legal instruments for LGBTQI+/SOGI equality, perspectives vary on whether this aspect of gender equality should be included in the revised policy.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Programming theory' 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