Workshop on Curry and Functional Logic Programming最新文献

筛选
英文 中文
A functional logic database library 一个功能逻辑数据库库
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085110
Sebastian Fischer
{"title":"A functional logic database library","authors":"Sebastian Fischer","doi":"10.1145/1085099.1085110","DOIUrl":"https://doi.org/10.1145/1085099.1085110","url":null,"abstract":"Programmers need mechanisms to store application specific data that persists multiple program runs. To accomplish this task, they usually have to deal with storage specific code to access files or relational databases. Functional logic programming provides a natural framework to transparent persistent storage through persistent predicates, i.e., predicates with externally stored facts.We describe a functional logic database library, based on persistent predicates, for Curry. Our library supports functional logic programming with databases in the background, i.e., the programmer can access a database without storage specific code employing functional logic programming techniques.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127882591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Translating curry to haskell system demo 将curry转换为haskell系统演示
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085112
Bernd Brassel, F. Huch
{"title":"Translating curry to haskell system demo","authors":"Bernd Brassel, F. Huch","doi":"10.1145/1085099.1085112","DOIUrl":"https://doi.org/10.1145/1085099.1085112","url":null,"abstract":"There exist several implementations of the functional logic language Curry: a transformation to Prolog and implementations of abstract machines for C and Java. We show that there are many advantages of a further implementation as a transformation to Haskell: increases in performance, availability of libraries and tools, and open access to the implementation. We present the basic ideas and a prototypical implementation of our transformation, which generates Haskell programs without use of impure features.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"75 2-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134391741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A generic analysis environment for declarative programs 用于声明性程序的通用分析环境
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085108
M. Hanus
{"title":"A generic analysis environment for declarative programs","authors":"M. Hanus","doi":"10.1145/1085099.1085108","DOIUrl":"https://doi.org/10.1145/1085099.1085108","url":null,"abstract":"In this paper we present CurryBrowser, a generic analysis environment for the declarative multi-paradigm language Curry. CurryBrowser supports browsing through the implementation of an application written in Curry, i.e., the main module and all directly or indirectly imported modules. Each module can be shown in different formats (e.g., source code, interface, intermediate code) and, inside each module, various properties of functions defined in this module can be analyzed. In order to support the integration of various program analyses, CurryBrowser has a generic interface to connect local and global analyses implemented in Curry. CurryBrowser is completely implemented in Curry using libraries for GUI programming and meta-programming.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134497500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An offline partial evaluator for curry programs curry程序的离线部分求值器
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085109
J. G. Ramos, Josep Silva, G. Vidal
{"title":"An offline partial evaluator for curry programs","authors":"J. G. Ramos, Josep Silva, G. Vidal","doi":"10.1145/1085099.1085109","DOIUrl":"https://doi.org/10.1145/1085099.1085109","url":null,"abstract":"Narrowing-driven partial evaluation is a powerful technique for the specialization of functional logic programs. In this paper, we describe the implementation of a narrowing-driven partial evaluator for Curry programs which follows the offline approach to ensuring termination. Although the new partial evaluator is less precise than previous (online) partial evaluators for Curry, it is much faster and, thus, allows the specialization of larger programs.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122541474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Constraint logic programming over sets of spatial objects 空间对象集合上的约束逻辑编程
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085106
J. Almendros-Jiménez
{"title":"Constraint logic programming over sets of spatial objects","authors":"J. Almendros-Jiménez","doi":"10.1145/1085099.1085106","DOIUrl":"https://doi.org/10.1145/1085099.1085106","url":null,"abstract":"Constraint Logic Programming (CLP) is a framework integrating Constraint Programming (CP) and Logic Programming (LP). CLP is described as a general schema of combination of logic-based languages and constraint solvers. Recently, a constraint system for the handling of constraints over sets of spatial objects has been presented. In this paper we study how to consider a CLP instance for this kind of constraints. In particular, we study the fixed-point and operational semantics of such instance. With respect to the operational semantics it is described how the constraint solver interacts with the mechanism of resolution, in particular how to detect failure branches by means of a consistence constraint checker and how to achieve constraint propagation and compute solved forms.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125820223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Designing an efficient computation strategy in CFLP(FD) using definitional trees 利用定义树设计一种高效的CFLP(FD)计算策略
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085105
Sonia Estévez Martín, Rafael del Vado Vírseda
{"title":"Designing an efficient computation strategy in CFLP(FD) using definitional trees","authors":"Sonia Estévez Martín, Rafael del Vado Vírseda","doi":"10.1145/1085099.1085105","DOIUrl":"https://doi.org/10.1145/1085099.1085105","url":null,"abstract":"This paper proposes the integration of <i>finite domain (FD)</i> constraints into a general purpose lazy <i>functional logic programming</i> language by means of a concrete instance of the generic scheme <i>CFLP</i>(<i>D</i>), proposed in [19] for lazy <i>Constraint Functional Logic Programming</i> over a parametrically given constraint domain <i>D</i>. We sketch in this <i>CFLP</i>(<i>FD</i>) language the basis of an efficient computation strategy for solving goals for programs by using <i>definitional trees</i> [1] in order to efficiently control the computation and maintain the good properties shown for <i>needed</i> and <i>demand-driven narrowing strategies</i> [4, 15, 25] in functional logic programming. This convenient computation mechanism is obtained as an optimization of the generic <i>Constrained Lazy Narrowing Calculus</i> <i>CLNC</i>(<i>D</i>) presented in [20], which has been proved sound and strongly complete w.r.t. a suitable <i>CFLP</i>(<i>D</i>) semantics, and provides a formal foundation for efficient implementations in existing systems such as <i>Curry</i> [11] and <i>TOY</i> [17]. Finally, we describe the execution of an example implemented in the <i>CFLP</i>(<i>FD</i>) system called <i>TOY</i>(<i>FD</i>) [9], which is based on the theoretical ideas introduced in this paper, following our computation strategy.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125518768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
An overview of the Sloth2005 curry system: system description Sloth2005咖喱系统概述:系统描述
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085113
E. J. G. Arias, Julio Mariño-Carballo
{"title":"An overview of the Sloth2005 curry system: system description","authors":"E. J. G. Arias, Julio Mariño-Carballo","doi":"10.1145/1085099.1085113","DOIUrl":"https://doi.org/10.1145/1085099.1085113","url":null,"abstract":"We present the current state and immediate future developments of Sloth [7], a Curry [2] to Prolog translator. Currently it implements almost all the features required the Curry Report [5] -- no encapsulated search at the moment -- and there is support for some extensions like, for instance, type classes and constraint programming over rationals.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115134738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Lightweight program specialization via dynamic slicing 通过动态切片实现轻量级程序专门化
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085101
C. Ochoa, Josep Silva, G. Vidal
{"title":"Lightweight program specialization via dynamic slicing","authors":"C. Ochoa, Josep Silva, G. Vidal","doi":"10.1145/1085099.1085101","DOIUrl":"https://doi.org/10.1145/1085099.1085101","url":null,"abstract":"Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any input data, dynamic slices are computed from a particular program execution. Thus, dynamic slicers are usually easier to design and implement.In this work, we present a program specialization technique for lazy functional logic programming which is based on dynamic slicing. Our method exploits the code size reduction capabilities of slicing in order to produce a version of the original program specialized w.r.t. a given criterion. We also introduce some simple, post-processing transformations that allow us to further simplify the specialized program. The kind of specialization performed by our approach cannot be achieved with other related techniques like partial evaluation.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129162879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
A declarative debugger of incorrect answers for constraint functional-logic programs 约束函数逻辑程序的错误答案的声明式调试器
Workshop on Curry and Functional Logic Programming Pub Date : 2005-09-29 DOI: 10.1145/1085099.1085102
R. Caballero
{"title":"A declarative debugger of incorrect answers for constraint functional-logic programs","authors":"R. Caballero","doi":"10.1145/1085099.1085102","DOIUrl":"https://doi.org/10.1145/1085099.1085102","url":null,"abstract":"Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution often are not suitable for debugging declarative programming languages. We present here a graphical debugging environment for constraint lazy functional-logic programs based on declarative debugging. The debugger displays the computation tree associated with a computation which has produced an incorrect answer, and navigates it with the assistance of the user until the error, an incorrect program rule, is found out. The debugger supports programs including equality and disequality constraints.","PeriodicalId":443046,"journal":{"name":"Workshop on Curry and Functional Logic Programming","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129905557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 59
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书