Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming最新文献_第2页

Semantically linear programming languages 语义线性编程语言

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389462

Luca Paolini, M. Piccolo

引用次数: 14

Comprehending finite maps for algorithmic debugging of higher-order functional programs 理解用于高阶函数程序算法调试的有限映射

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389475

O. Chitil, T. Davie

{"title":"Comprehending finite maps for algorithmic debugging of higher-order functional programs","authors":"O. Chitil, T. Davie","doi":"10.1145/1389449.1389475","DOIUrl":"https://doi.org/10.1145/1389449.1389475","url":null,"abstract":"Algorithmic debuggers for higher-order functional languages have to display functional values. Originally functional values had been represented as partial applications of function and constructor symbols, but a recent approach represents functional values as finite maps. The two representations require the computation tree that is central to algorithmic debugging to be structured rather differently. In this paper we present a unifying framework that formally defines algorithmic debugging for both representations in an implementation-independent way for both strict and non-strict functional languages. On this basis we prove the soundness of algorithmic debugging with finite maps. Our framework shows how a single implementation can support both forms of algorithmic debugging. The proof exposed that algorithmic debugging with finite maps does not handle arbitrary functional programs, but in current practice the problematic ones are excluded by the type system. Both framework and proof suggest variations of algorithmic debugging with finite maps and thus are tools for further improvement of this form of debugging","PeriodicalId":248980,"journal":{"name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127696212","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

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming 第十届国际ACM SIGPLAN声明性编程的原则和实践会议论文集

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449

S. Antoy, E. Albert

{"title":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","authors":"S. Antoy, E. Albert","doi":"10.1145/1389449","DOIUrl":"https://doi.org/10.1145/1389449","url":null,"abstract":"This volume contains the papers presented at PPDP 2008, the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, held July 15-17, 2008, in Valencia, Spain. \u0000 \u0000The Symposium is a forum for researchers in the declarative programming communities, including those working in the logic, constraint, and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages, and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, and to stimulate cross-fertilization by including work from one community that could be of particular interest and relevance to the others \u0000 \u0000This year's PPDP was co-located with the 15th International Static Analysis Symposium (SAS 2008), the 18th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2008), and the 4th International Workshop on Programming Language Interference and Dependence (PLID 2008). \u0000 \u0000Out of 51 initial submissions, 48 papers were reviewed by four referees and 24 were selected for presentation. The program committee used the EasyChair conference management system for handling electronic submissions, for allocating reviewing duties, and for filing reviews. In addition to regular paper sessions, the symposium hosted an invited talk by Michael Leuschel of the University of Dusseldorf, Germany.","PeriodicalId":248980,"journal":{"name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133084052","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

Dynamic variable elimination during propagation solving 传播求解过程中的动态变量消除

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389480

Christian Schulte, Peter James Stuckey

引用次数: 2

Order-sorted dependency pairs 顺序排序的依赖对

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389463

Salvador Lucas, J. Meseguer

引用次数: 19

Similarity-based reasoning in qualified logic programming 限定逻辑规划中基于相似性的推理

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389472

R. Caballero, M. Rodríguez-Artalejo, Carlos A. Romero-Díaz

引用次数: 23

Inferring precise polymorphic type dependencies in logic programs 推断逻辑程序中精确的多态类型依赖关系

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389467

Lunjin Lu

引用次数: 0

Declarative Ajax and client side evaluation of workflows using iTasks 使用任务对工作流进行声明式Ajax和客户端评估

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389457

M. J. Plasmeijer, J. M. Jansen, P. Koopman, P. Achten

{"title":"Declarative Ajax and client side evaluation of workflows using iTasks","authors":"M. J. Plasmeijer, J. M. Jansen, P. Koopman, P. Achten","doi":"10.1145/1389449.1389457","DOIUrl":"https://doi.org/10.1145/1389449.1389457","url":null,"abstract":"Workflow systems coordinate tasks of humans and computers. The iTask system is a recently developed toolkit with which workflows can be defined declaratively on a very high level of abstraction. It offers functionality which cannot be found in commercial workflow systems: workflows are constructed dynamically depending on the outcome of earlier work, workflows are strongly typed, and they can be of higher order. From the specification, a web-based multi-user workflow system is generated. Up until now we could only generate thin clients. All information produced by a worker triggers a round trip to the server. For real world workflows this is unsatisfactory. Modern Ajax web technology to update part of a web page is required, as well as the ability to execute tasks on clients. The architecture of any system that supports such features is complex: it manages distributed computing on clients and server which generally involves the collaboration of applications written in different programming languages. The contribution of this paper is that we integrate partial updates of web pages and client side task evaluation within the iTask system, while retaining its approach of a single language and declarative nature. The workflow designer uses light-weight annotations to control the run-time behavior of work. The iTask implementation takes care of all the hard work under the hood. Arbitrary tasks (functional programs) can be evaluated at web clients. When such a task cannot be evaluated on the client for some reason, the system switches to server side evaluation. All communication and synchronization issues are handled by the extended iTask system","PeriodicalId":248980,"journal":{"name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115995298","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

Characterizations of polynomial complexity classes with a better intensionality 具有较好强度的多项式复杂度类的表征

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389460

J. Marion, Romain Péchoux

引用次数: 14

Parallel execution of multi-set constraint rewrite rules 并行执行多集约束重写规则

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389453

Martin Sulzmann, E. Lam

引用次数: 22