检索结果-内蒙古大学图书馆

INTERNATIONAL SYMP ON LOGIC programming

作者： NAKAYAMA, H Ricoh Co Ltd Tokyo Japan

ISBN: (纸本)0262691477

The principle of proof as program is based on the fact that a constructive proof of 'there exists xF(x)' can be viewed as a program calculating the value for x such that F(x) holds. In this paper we propose a program transformation method under the principle of proof as program. The method is intended to decrease the number of mathematical inductions in a constructive proof. This amounts to the elimination of the recursive calls of ordinary programming languages. Compared to traditional program transformation methods, such as the fold/unfold method, our method has the following notable features. First, by analyzing the proof it is easily determined whether our method is effectively applicable or not. Secondly, the transformation proceeds very efficiently. The transformed proof is immediately obtained by our method whereas by the fold/unfold method the transformation proceeds step by step.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Intensionality, extensionality, and proof irrelevance in modal type theory

Intensionality, extensionality, and proof irrelevance in mod...

引用

16th Annual IEEE Symposium on Logic in Computer Science

作者： Pfenning, F Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)076951281X

We develop a uniform type theory that integrates intensionality, extensionality, and proof irrelevance as judgmental concepts. Any object may be treated intensionally (subject only to alpha -conversion), extensionally (subject also to beta eta -conversion), or as irrelevant (equal to any other object at the same type), depending on where it occurs. Modal restrictions developed in prior work for simple types are generalized and employed to guarantee consistency between these views of objects. Potential applications are in logical frameworks, functional programming, and the foundations of first-order modal logics. Our type theory contrasts with previous approaches that a priori distinguish propositions (whose proofs are all identified-only their existence is important) from specifications (whose implementations are subject to some definitional equalities).

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Universal Framework for Parametric Constrained Coding

Universal Framework for Parametric Constrained Coding

引用

IEEE International Symposium on Information theory (ISIT)

作者： Kobovich, Adir Leitersdorf, Orian Bar-Lev, Daniella Yaakobi, Eitan Technion Israel Inst Technol Fac Elect & Comp Engn IL-3200003 Haifa Israel Technion Israel Inst Technol Fac Comp Sci IL-3200003 Haifa Israel

ISBN: (纸本)9798350382853;9798350382846

Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While fixed constraints (e.g., a fixed set of substrings may not appear in transmitted messages) have a general optimal solution, there is increasing demand for supporting parametric constraints that are dependent on the message length and portray some property that the substrings must satisfy (e.g., no log(n) consecutive zeros). Several works have tackled such parametric constraints through iterative algorithms following the sequence-replacement approach, yet this approach requires complex constraint-specific properties to guarantee convergence through monotonic progression. In this paper, we propose a universal framework for tackling any parametric constraint problem with far fewer requirements, through a simple iterative algorithm. By reducing an execution of this iterative algorithm to an acyclic graph traversal, we prove a surprising result that guarantees convergence with efficient average time complexity even without requiring any monotonic progression. We demonstrate how to apply this algorithm to the run-length-limited, minimal Hamming weight, local almost-balanced Hamming weight constraints, as well as repeat-free and secondary-structure constraints. Overall, this framework enables state-of-the-art results with minimal effort.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

A Mixed-Method Review of Cash Transfers and Intimate Partner Violence in Low- and Middle-Income Countries

引用

WORLD BANK RESEARCH OBSERVER 2018年第2期33卷 218-258页

作者： Buller, Ana Maria Peterman, Amber Ranganathan, Meghna Bleile, Alexandra Hidrobo, Melissa Heise, Lori London Sch Hyg & Trop Med Dept Global Hlth & Dev 15-17 Tavistock Pl London WC1H 9SH England UNICEF Off Res Innocenti Social & Econ Policy Unit Piazza SS Annunziata 12 I-50122 Florence FI Italy Int Food PolicyResearch Inst Poverty Hlth & Nutr Div Dakar Senegal Johns Hopkins Bloomberg Sch Publ Hlth Dept Populat Family & Sexual & Reprod Hlth 615 N Wolfe St Baltimore MD 21205 USA

There is increasing evidence that cash transfer (CT) programs decrease intimate partner violence (IPV). However, little is known about how CTs achieve this impact. We conducted a mixed-method review of studies in low-and middle-income countries (LMICs). Fourteen quantitative and eight qualitative studies met our inclusion criteria, of which eleven and five, respectively, demonstrated evidence that CTs decrease IPV. We found little support for increases in IPV, with only two studies showing overall mixed or adverse impacts. Drawing on these studies, as well as related bodies of evidence, we developed a program theory proposing three pathways through which CT could impact IPV: (a) economic security and emotional well-being, (b) intra-household conflict, and (c) women's empowerment. The economic security and well-being pathway hypothesizes decreases in IPV, while the other two pathways have ambiguous effects depending on program design features and behavioral responses to program components. Future studies should improve IPV measurement, empirical analysis of program mechanisms, and fill regional gaps. Program framing and complementary activities, including those with the ability to shift intra-household power relations are likely to be important design features for understanding how to maximize and leverage the impact of CTs for reducing IPV, and mitigating potential adverse impacts. Intimate partner violence. Domestic violence. Cash transfers. Women's empowerment.

关键词： design features adverse impacts Intimate Partner Violence Rahmen programming theory middle income country infectious pustular vulvovaginitis

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC PROGRAM GENERATION USING SEQUENT CALCULUS 92

AUTOMATIC PROGRAM GENERATION USING SEQUENT CALCULUS

引用

20TH ANNUAL COMPUTER SCIENCE SYMP

作者： MAGHRABI, T GOLSHANI, F Department of Computer Science and Engineering Arizona State University Tempe Arizona Bull Worldwide Information Systems Phoenix Arizona

ISBN: (纸本)0897914724

Program development can be made amenable to formal methods by using a logical framework. A logic specification, whose operational semantics is based on proof theory, provides an abstract and “implementation independent” definition of the problem, the data domains and the associated *** many of the current efforts in this area that use resolution, our approach is based on natural deduction, more specifically, sequent calculus. Following the methodology proposed by Manna and Waldinger, we propose the synthesis tableau technique by which we construct a proof for the well formed formula representing the specification. The desired program is obtained as a side effect of the proof process.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Parallel program control based on hierarchically detected consistent global states

Parallel program control based on hierarchically detected co...

引用

4th International Conference on Parallel Computing in Electrical Engineering (PARELECT 2004)

作者： Borkowski, J Polish Japanese Inst Informat Technol Warsaw Poland

ISBN: (纸本)0769520804

Consistent Global States (CGS) detection is a costly process. If CGS are constructed using real-time timestamps, then their hierarchical detection is possible. In a hierarchical detection scheme the load of a single central monitor is distributed among a number of monitors. We show, that hierarchical CGS detection has advantages over centralized detection: it allows for online monitoring of larger systems and for a more effective application control based on observed CGS. Hierarchical CGS detection can be coupled with a hierarchical application control scheme for better results. Further improvement is obtained if a timeout mechanism allows unterminated local states to be used for CGS construction. Relevant algorithms and simulation results are presented and discussed.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Evolving structure - Optimising content

Evolving structure - Optimising content

引用

Congress on Evolutionary Computation (CEC 2001)

作者： Whigham, PA Keukelaar, J Univ Otago Dept Informat Sci Dunedin New Zealand

ISBN: (纸本)0780366573

This paper describes the initial results of a new form of evolutionary system specifically designed for time series modeling. The system combines a grammatically-based Genetic programming system with various optimisation techniques. The system uses the evolutionary system to construct the structure of equations and optimisation techniques to essentially fill in the details. Three forms of optimisation are described: optimisation of constants in an equation;the optimisation of both the constants and variables in an equation;and the use of a hill-climbing mutation to further tune the evolved and optimised equations. Preliminary results indicate that this combination of techniques produces significant improvements in convergence based on the training data, and produces equivalent generalisation on unseen data, for a given number of population member evaluations.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

THE CATEGORY OF CONSTRAINT SYSTEMS IS CARTESIAN-CLOSED

THE CATEGORY OF CONSTRAINT SYSTEMS IS CARTESIAN-CLOSED

引用

7TH ANNUAL SYMP ON LOGIC IN COMPUTER SCIENCE ( LICS 92 )

作者： SARASWAT, V Xerox PARC Palo Alto CA USA

ISBN: (纸本)0818627352

A general definition of constraint systems utilizing Gentzen-style sequents is given. Constraint systems can be regarded as enriching the propositional Scott information systems with minimal first-order structure: the notion of variables, existential quantification, and substitution. Approximate maps that are generic in all but finitely many variables are taken as morphisms. It is shown that the resulting structure forms a category (called ConstSys). Furthermore, the structure of Scott information systems lifts smoothly to the first-order setting. In particular, it is shown that the category is Cartesian-closed, and other usual functors over Scott information systems (lifting, sums, Smyth power-domain) are also definable and recursive domain equations involving these functors can be solved.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Foundations for the implementation of higher-order subtyping 97

Foundations for the implementation of higher-order subtyping

引用

2nd ACM SIGPLAN International Conference on Functional programming (ICFP)

作者： Crary, K Department of Computer Science Cornell University

ISBN: (纸本)9780897919180

We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a polymorphic function is adjusted to take, as an additional argument, a proof that its type constructor argument has the desired kind. Such a proof is extracted from the derivation of a kinding judgement and may in turn require proof coercions, which are extracted from subkinding judgements. This technique is formalized as a type-directed translation from a calculus of higher-order subtyping to a subtyping-free calculus. This translation generalizes an existing result for second-order subtyping calculi (such as F-less than or equal to). We also discuss two interpretations of subtyping, one that views it as type inclusion and another that views it as the existence of a well-behaved coercion, and we show, by a type-theoretic construction, that our translation is the minimum consequence of shifting from the inclusion interpretation to the coercion-existence interpretation. This construction shows that the translation is the natural one, and it also provides a framework for extending the translation to richer type systems. Finally, we show how the two interpretations can be reconciled in a common semantics. It is then easy to show the coherence of the translation relative to that semantics.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

ON REDUCING SYNCHRONIZATION COSTS IN NESTED DOACROSS LOOPS

ON REDUCING SYNCHRONIZATION COSTS IN NESTED DOACROSS LOOPS

引用

1994 Annual International Conference of the IEEE Region-10 - Frontiers of Computer Technology

作者： KROTHAPALLI, VP SADAYAPPAN, P UNIV MANITOBA DEPT COMP SCIWINNIPEGMB R3T 5H3CANADA

ISBN: (纸本)0780318625

The iteration space dependence graph (ISDG) of a loop captures the synchronization requirements of the execution of the loop on parallel machines. Some of the edges in an ISDG may correspond to redundant synchronization statements. In this paper we investigate the removal of such edges in the ISDG of a triply nested loop with constant dependences. We identify a class of triply-nested loops with the property of uniform redundancy. In the case of a general triply-nested loop, we characterize points in the iteration space at which a dependence is redundant.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：