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

作者： John R. Brown Stephen G. Mitton Naval Postgraduate School

学位级别：硕士

relational programming is a methodology which combines the advantages o-f ^^untional programming with the relatively simple laws which govern relations. The goal is to give the programmer an environment which allows a higher level o-f programming abstraction than currently exists, an easier approach to proving programs correct, and a language which can support new parallel architectures. In this report, the design and implementation o-f a prototype interactive inter- preter -for a relational programming language is presented. The reasoning behind the decision to use LISP as the implementation language is presented followed by an in depth discussion o-f the design issues involved and the implementa- tion decisions made. How to use the interpreter and future research topics 3. rE; discussed. Also several appendices s. rs provided which include the grammar, the relational operators implemented, and the documented LISP code.

关键词： relational programming

来源：评论

学校读者我要写书评

暂无评论

A Unified Approach to Solving Seven programming Problems (Functional Pearl)

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2017年第ICFP期1卷 1-26页

作者： Byrd, William E. Ballantyne, Michael Rosenblatt, Gregory Might, Matthew Univ Utah Salt Lake City UT 84112 USA

We present seven programming challenges in Racket, and an elegant, unified approach to solving them using constraint logic programming in miniKanren.

关键词： relational programming program synthesis miniKanren Racket Scheme

来源：评论

学校读者我要写书评

暂无评论

Functional-Logic programming for Web Knowledge Representation, Sharing and Querying 19

Functional-Logic Programming for Web Knowledge Representatio...

引用

19th International Conference on Knowledge Engineering and Knowledge Management (EKAW)

作者： Nickles, Matthias Natl Univ Ireland Insight Ctr Data Analyt Galway Ireland Natl Univ Ireland Dept Informat Technol Galway Ireland

ISBN: (纸本)9783319137049;9783319137032

We propose a unified approach to semantically rich knowledge representation, querying and exchange for the Web, based on functional-logic programming. JavaScript- and JSON-based so-called information scripts serve as a unified knowledge representation and query format, with logical reasoning being a constraint solving or narrowing task. This way, our framework provides a highly versatile, easy to use and radically different alternative compared to conventional forms of knowledge representation and exchange for the Web.

关键词： Knowledge representation JSON-LD JSON JavaScript Functional-Logic programming relational programming Linked Data Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem

引用

SCIENCE OF COMPUTER programming 2000年第1-3期38卷 1-25页

作者： Berghammer, R Hoffmann, T Univ Kiel Inst Informat & Prakt Math D-24098 Kiel Germany

We combine relational algebra and program derivation methodology and reconstruct a proof of Richardson's theorem that every finite directed graph without circuits of odd length has a kernel as a relational program... 详细信息

关键词： relational algebra directed graphs kernels program derivation relational programming

来源：评论

学校读者我要写书评

暂无评论

SOFTWARE PROTOTYPING BY relational TECHNIQUES - EXPERIENCES WITH PROGRAM CONSTRUCTION SYSTEMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1988年第11期14卷 1597-1609页

作者： CERI, S CRESPIREGHIZZI, S DIMAIO, A LAVAZZA, LA UNIV MODENA DEPT MATEMAT PURE APPLI-41100 MODENAITALY POLITECN MILAN DIPARTIMENTO ELETTRI-20133 MILANITALY TXT SOFTWARE & TELEMAT SPA I-20122 MILANITALY

A method for designing and prototyping program construction systems using relational databases is presented. Relations are the only data structures used inside the systems and for interfaces; programs extensively use relational languages, in particular relational algebra. Two large projects are described. The Ada relational Translator (ART) is an experimental compiler-interpreter for Ada in which all subsystems, including the parser, semantic analyzer, interpreter, kernel, and debugger, use relations as their only data structure; the relational approach has been pushed to the utmost to achieve fast prototyping in a student environment. Multi-Micro Line (MML) is a tool set for constructing programs for multimicroprocessors' targets, in which relations are used for allocation and configuration control. Both experiences confirm the validity of the approach for managing teamwork in evolving projects, identify areas where this approach is appropriate, and raise critical issues. [ABSTRACT FROM AUTHOR]

关键词： Ada program construction environments rapid prototyping relational programming target computer description

来源：评论

学校读者我要写书评

暂无评论

Neural-Guided Inductive Synthesis of Functional Programs on List Manipulation by Offline Supervised Learning

引用

IEEE ACCESS 2021年 9卷 71521-71534页

作者： Wang, Yuhong Li, Xin East China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai 200062 Peoples R China

Synthesizing intended programs from user-specified input-output examples, also known as programming by Examples (PBE), is a challenging problem in program synthesis, and has been applied to a wide range of domains. A key challenge in PBE is to efficiently discover a user-intended program in the search space that can be exponentially large. In this work, we propose a method for automatic synthesis of functional programs on list manipulation, by using offline-trained Recurrent Neural Network (RNN) models to guide the program search. We adopt miniKanren, an embedded domain-specific language for flexible relational programming, as an underlying top-down deductive search engine of candidate programs that are consistent with input-output examples. Our approach targets an easy and effective integration of deep learning techniques in making better PBE systems and combines two technical ideas on generating diverse training dataset and designing rich feature embeddings of probable subproblems for synthesis generated by deductive search. The offline-learned model is then used in PBE to guide the top-down deductive search with specific strategies. To practically manipulate data structures of lists, our method synthesizes functional programs with popular higher-order combinators including map, foldl and foldr. We have implemented our method and evaluated it with challenging program synthesis tasks on list manipulation. The experiments show promising results on the performance of our method compared to related state-of-the-art inductive synthesizers.

关键词： Training Task analysis programming Supervised learning Reactive power Automobiles Search engines programming by examples functional programs miniKanren relational programming deep learning deductive search

来源：评论

学校读者我要写书评

暂无评论

Improving Refutational Completeness of relational Search via Divergence Test 18

Improving Refutational Completeness of Relational Search via...

引用

20th International Symposium on Principles and Practice of Declarative programming (PPDP)

作者： Rozplokhas, Dmitri Boulytchev, Dmitri St Petersburg Acad Univ St Petersburg Russia St Petersburg State Univ St Petersburg Russia

ISBN: (纸本)9781450364416

We describe a search optimization technique for implementation of relational programming language miniKanren which makes more queries converge. Specifically, we address the problem of conjunction non-commutativity. Our technique is based on a certain divergence criterion that we use to trigger a dynamic reordering of conjuncts. We present a formal semantics of a miniKanren-like language and prove that our optimization does not compromise already converging programs, thus, being a proper improvement. We also present the prototype implementation of the improved search and demonstrate its application for a number of realistic specifications.

关键词： relational programming refutational completeness divergence test

来源：评论

学校读者我要写书评

暂无评论

Declarative Rules and Rule-Based Systems 17th

Declarative Rules and Rule-Based Systems

引用

17th Conference on Artificial General Intelligence (AGI)

作者： Tarasov, Maxim Temple AGI Team Philadelphia PA 19122 USA

ISBN: (纸本)9783031655715;9783031655722

Starting with the premise that rule-based systems still have their place in AI toolkit, we explore different ways of implementing such systems. We find that some of the criticisms towards rule-based systems, namely their large number of rules and high maintenance cost can be addressed by using declarative style programming and a shift to a higher level of abstraction from rules to meta-rules, operating on the structure of data rather than its contents. We use OpenNARS 4 as example implementation to demonstrate advantages of this approach but the results are generally applicable to other rule-based systems.

关键词： Non-Axiomatic Logic AGI relational programming

来源：评论

学校读者我要写书评

暂无评论

Efficient Fair Conjunction for Structurally-Recursive Relations 2021

Efficient Fair Conjunction for Structurally-Recursive Relati...

引用

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM)

作者： Lozov, Peter Boulytchev, Dmitry St Petersburg State Univ JetBrains Res St Petersburg Russia

ISBN: (纸本)9781450383059

We present a new, fair, conjunction evaluation strategy for relational programming language MINIKANREN. Unlike the original left-biased conjunction, our approach controls the order of conjunct execution based on the intrinsic properties of relation definitions. We present both the formal study of conjunction fairness and practical evaluation, which demonstrates the essential improvement in terms of both performance and convergence.

关键词： relational programming miniKanren evaluation strategies operational semantics

来源：评论

学校读者我要写书评

暂无评论

Extensible Embedded Hardware Description Languages with Compilation, Simulation and Verification 23

Extensible Embedded Hardware Description Languages with Comp...

引用

13th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART)

作者： Tahir, Omar Luk, Wayne Wu, Nicolas Imperial Coll London Dept Comp London England

ISBN: (纸本)9798400700439

Typical hardware description languages, such as Verilog and VHDL, are low-level declarative languages with little room for flexibility. Extending, verifying, or reinterpreting programs in these languages is typically done with external tools and at great cost. This paper presents an implementation of a relational hardware description language, Ruby, in the programming language and proof assistant Agda. Using our system, an engineer can easily write, compile, simulate, and verify new designs. The language is modular, allowing for new constructs and libraries to be added easily, and supports formal reasoning about circuit transformations. Symbolic simulation and compilation to a netlist format are also provided. We demonstrate our tool by designing, compiling, and simulating a priority queue design, and showcase how equational reasoning can be used to prove properties of circuits.

关键词： hardware design relational programming functional programming formal reasoning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：