ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming最新文献_第10页

Generic record combinators with static type checking 具有静态类型检查的通用记录组合子

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836108

W. Jeltsch

引用次数: 5

Equational axiomatization of call-by-name delimited control 按名称调用分隔控制的等式公理化

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836100

Yukiyoshi Kameyama, Asami Tanaka

引用次数: 3

Declarative modeling of finite mathematics 有限数学的声明式建模

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836107

Paul Tarau

引用次数: 22

Deriving predicate statistics in datalog 在数据表中导出谓词统计信息

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836095

Senlin Liang, M. Kifer

引用次数: 5

Optimality for dynamic patterns 动态模式的最佳性

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836119

Thibaut Balabonski

引用次数: 2

Type inference in intuitionistic linear logic 直觉线性逻辑中的类型推理

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836118

Patrick Baillot, M. Hofmann

{"title":"Type inference in intuitionistic linear logic","authors":"Patrick Baillot, M. Hofmann","doi":"10.1145/1836089.1836118","DOIUrl":"https://doi.org/10.1145/1836089.1836118","url":null,"abstract":"We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether there exists a corresponding typing derivation in linear logic (type checking) ii) provide a concise description of all possible corresponding linear logic typings (type inference).\u0000 We solve these problems using a novel algorithmic type system for linear logic whose typing rules carry arithmetic side conditions describing essentially the nesting depth of (proof-net) boxes. By understanding these side conditions as unknowns we then reduce type inference to solving a system of arithmetic constraints. We show that these constraint systems fall into a tractable class hence leading to an efficient (polynomial-time) solution.\u0000 There are two important restrictions: first, our source language is typed System F rather than untyped lambda calculus; this is necessary because type inference for System F is known to be undecidable. Second, we assume that sharing is made explicit in the input, thus we do not try to automatically infer opportunities for sharing identical subterms. Relieving the latter restriction is left as a challenge for future work.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121300623","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}

引用次数: 10

Two notions of sub-behaviour for session-based client/server systems 基于会话的客户机/服务器系统的两个子行为概念

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836109

F. Barbanera, Ugo de'Liguoro

引用次数: 46

Declarative workflows to efficiently manage flexible and advanced business processes 声明性工作流可以有效地管理灵活和高级的业务流程

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836116

R. Demeyer, M. V. Assche, Ludovic Langevine, Wim Vanhoof

{"title":"Declarative workflows to efficiently manage flexible and advanced business processes","authors":"R. Demeyer, M. V. Assche, Ludovic Langevine, Wim Vanhoof","doi":"10.1145/1836089.1836116","DOIUrl":"https://doi.org/10.1145/1836089.1836116","url":null,"abstract":"In this work, we present a new constraint-based workflow definition language called Saturn, which uses Linear-time Temporal Logic (LTL) to express workflow constraints. A declarative approach to model business processes has recently been advocated as a viable complement to, or even replacement of, more traditional imperative-style workflow definition languages. Such an approach offers multiple advantages especially in the context of so-called flexible business processes where the processes and the underlying workflow definitions tend to change over time.\u0000 One major innovation of the Saturn language is the way in which it deals with the task lifecycle. This concerns to what extent tasks are considered not as atomic entities, but as possibly overlapping processes that can be started, stopped or cancelled at a later time. Contrary to other approaches, the task lifecycle is fully incorporated in Saturn's semantics and must not be modelled explicitly in the workflow design. As a result, the power of the declarative formalism underlying the language is more fully exploited and we offer both an elegant and pragmatic solution to a known problem. Moreover, Saturn is extensible and allows to model the environment of the business process, i.e. the external elements that influence its execution. A preliminary experimental evaluation shows our implementation of Saturn to be competitive, and a first version of the system is currently being integrated in a commercial application under development.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126388382","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}

引用次数: 13

Typed and unambiguous pattern matching on strings using regular expressions 使用正则表达式对字符串进行类型化和明确的模式匹配

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-07-26 DOI: 10.1145/1836089.1836120

Claus Brabrand, Jakob G. Thomsen

引用次数: 13

A meta-programming approach to realizing dependently typed logic programming 实现依赖类型逻辑编程的元编程方法

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2010-05-24 DOI: 10.1145/1836089.1836113

Zachary Snow, David Baelde, G. Nadathur

{"title":"A meta-programming approach to realizing dependently typed logic programming","authors":"Zachary Snow, David Baelde, G. Nadathur","doi":"10.1145/1836089.1836113","DOIUrl":"https://doi.org/10.1145/1836089.1836113","url":null,"abstract":"Dependently typed λ-calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic programming interpretation: the Twelf system is based on such an interpretation of LF. We consider here whether a conventional logic programming language can provide the benefits of a Twelf-like system for encoding type and proof-and-formula dependencies. In particular, we present a simple mapping from LF specifications to a set of formulas in the higher-order hereditary Harrop (hohh) language, that relates derivations and proof-search between the two frameworks. We then show that this encoding can be improved by exploiting knowledge of the well-formedness of the original LF specifications to elide much redundant type-checking information. The resulting logic program has a structure that closely resembles the original specification, thereby allowing LF specifications to be viewed as hohh meta-programs. Using the Teyjus implementation of λ Prolog, we show that our translation provides an efficient means for executing LF specifications, complementing the ability that the Twelf system provides for reasoning about them.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126159326","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}

引用次数: 20