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

39th Annual acm SIGPLAN-SIGACT symposium on Principles of programming.Languages

作者： Koeksal, Ali Sinan Kuncak, Viktor Suter, Philippe Swiss Fed Inst Technol EPFL Sch Comp & Commun Sci I&C Lausanne Switzerland

ISBN: (纸本)9781450310833

We present an extension of Scala that supports constraint programming.over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming.while preserving the existing features of Scala. Kaplan integrates constraint and imperative programming.by using constraints as an advanced control structure;the developers use the monadic 'for' construct to iterate over the solutions of constraints or branch on the existence of a solution. The constructs we introduce have simple semantics that can be understood as explicit enumeration of values, but are implemented more efficiently using symbolic reasoning. Kaplan programs can manipulate constraints at run-time, with the combined benefits of type-safe syntax trees and first-class functions. The language of constraints is a functional subset of Scala, supporting arbitrary recursive function definitions over algebraic data types, sets, maps, and integers. Our implementation runs on a platform combining a constraint solver with a standard virtual machine. For constraint solving we use an algorithm that handles recursive function definitions through fair function unrolling and builds upon the state-of-the art SMT solver Z3. We evaluate Kaplan on examples ranging from enumeration of data structures to execution of declarative specifications. We found Kaplan promising because it is expressive, supporting a range of problem domains, while enabling full-speed execution of programs that do not rely on constraint programming.

关键词： Constraint programming Satisfiability Modulo Theories Executable Specifications Scala Embedded Domain-Specific Languages Non-determinism

来源：评论

学校读者我要写书评

暂无评论

functional un|unparsing

引用

Higher-Order and Symbolic Computation 2011年第4期24卷 311-340页

作者： Asai, Kenichi Kiselyov, Oleg Shan, Chung-Chieh Ochanomizu University Tokyo Japan Indiana University Bloomington IN United States

Danvy's functional unparsing problem (Danvy in J. Funct. Program. 8(6), 621- 625, 1998) is to implement a type-safe 'printf' function, which converts a sequence of heterogeneous arguments to a string according to a given format. The dual problem is to implement a type-safe 'scanf' function, which extracts a sequence of heterogeneous arguments from a string by interpreting (Friedman and Wand in LFP, pp. 348-355, 1984 and in Essentials of programming.Languages, MIT Press, 2008) the same format as an equally heterogeneous sequence of patterns that binds zero or more variables. We derive multiple solutions to both problems (Wand in J. acm 27(1), 164-180, 1980) from their formal specifications (Wand in Theor. Comput. Sci. 20(1), 3-32, 1982). On one hand, our solutions show how the Hindley-Milner type system, unextended, permits accessing heterogeneous sequences with the static assurance of type safety. On the other hand, our solutions demonstrate the use of control operators (Felleisen et al. in Proceedings of the 1988 acmconference on lisp and functional programming. pp. 52-62, acmPress, New York, 1988;Wand in POPL 85: conference record of the Annual acm symposium on Principles of programming.Languages, vol. 16, acmPress, New York, 1985;Meyer and Wand in Logics of Programs, Lecture Notes in Computer Science, vol. 193, pp. 219-224, Springer, Berlin, 1985) to communicate with formats as coroutines (Wand in Proceedings of the 1980 acm conference on lisp and functional programming. vol. 12, pp. 285-299, acm Press, New York, 1980 and Haynes et al. in LFP, pp. 293-298, 1984). © Springer Science+Business Media, LLC 2012.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Multivariate Amortized Resource Analysis 11

Multivariate Amortized Resource Analysis

引用

38th symposium on Principles of programming.Languages

作者： Hoffmann, Jan Aehlig, Klaus Hofmann, Martin Univ Munich D-80539 Munich Germany

ISBN: (纸本)9781450304900

We study the problem of automatically analyzing the worst-case resource usage a procedures with several arguments. Existing automatic analyses based or. amortization, or sized types bound the resource usage or result site of such a procedure by a sum of unary functions of the sizes of the arguments. In this paper we generalize this to arbitrary multivariate polynomial functions thus allowing bounds of the form inn which had to be grossly overestimated t y m(2) + n(2) before. Our framework even encompasses bounds like Sigma(i,j <= n) m(i)m(j) where the m(i) are the sizes of the entries of a list of length n. This allows us for the first time to derive useful resource bounds for operations on matrices that are represented as lists of lists and to considerably improve founds on other super-linear operations on lists such as longest common subsequence and removal of duplicates from lists of lists. Furthermore, resource bounds are now closed under composition which improves accuracy of the analysis of composed programs which some or all of the components exhibit super-linear resource or she behavior. The analysis is based or, a novel multivariate amortized resource analysis. We present it in form of a type system for a simple first-order functional language with lists and trees, prove soundness, and describe automatic type inference based on linear programming. We have experimentally validated the automatic analysis on a wide range of examples from functional programming.with lists and trees. The obtained bounds were compared with actual resource consumption. All bounds were asymptotically tight, and the constants were close or even identical to the optimal ones.

关键词： functional programming Static Analysis Amortized Analysis Resource Consumption Quantitative Analysis

来源：评论

学校读者我要写书评

暂无评论

Manticore: A heterogeneous parallel language

Manticore: A heterogeneous parallel language

引用

DAMP 2007: Workshop on Declarative Aspects of Multicore programming

作者： Fluet, Matthew Rainey, Mike Reppy, John Shaw, Adam Xiao, Yingqi Toyota Technological Institute Chicago Japan University of Chicago United States

ISBN: (纸本)1595936904

The Manticore project is an effort to design and implement a new functional language for parallel programming. Unlike many earlier parallel languages, Manticore is a heterogeneous language that supports parallelism at multiple levels. Specifically, we combine CML-style explicit concurrency with NESL/Nepal-style data-parallelism. In this paper, we describe and motivate the design of the Manticore language. We also describe a flexible runtime model that supports multiple scheduling disciplines (e.g., for both fine-grain and course-grain parallelism) in a uniform framework. Work on a prototype implementation is ongoing and we give a status report. Copyright 2007 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Unified computation model for functional and logic programming

Unified computation model for functional and logic programmi...

引用

The 1997 24th acm SIGPLAN-SIGACT symposium on Principles of programming.Languages, POPL'97

作者： Hanus, Michael RWTH Aachen Aachen Germany

We propose a new computation model which combines the operational principles of functional languages (reduction), logic languages (non-deterministic search for solutions), and integrated functional logic languages (residuation and narrowing). This computation model combines efficient evaluation principles of functional languages with the problem-solving capabilities of logic programming. Since the model allows the delay of function calls which are not sufficiently instantiated, it also supports a concurrent style of programming. We provide soundness and completeness results and show that known evaluation principles of functional logic languages are particular instances of this model. Thus, our model is a suitable basis for future declarative programming.languages.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Semantics of future and its use in program optimization

Semantics of future and its use in program optimization

引用

22nd acm SIGPLAN-SIGACT symposium on Principles of programming.Languages, POPL'95

作者： Flanagan, Cormac Felleisen, Matthias Rice Univ Houston TX United States

The future annotations of Multilisp provide a simple method for taming the implicit parallelism of functional programs. Past research concerning futures has focused on implementation issues. In this paper, we present a series of operational semantics for an idealized functional language with futures with varying degrees of intensionality. We develop a set-based analysis algorithm from the most intensional semantics, and use that algorithm to perform touch optimization on programs. Experiments with the Gambit compiler indicates that this optimization substantially reduces program execution times.

关键词： lisp (programming.language)

来源：评论

学校读者我要写书评

暂无评论

Building interpreters by composing monads 94

Building interpreters by composing monads

引用

21st Annual acm symposium on Principles of programming.Languages, POPL'94

作者： Steele, Guy L. Thinking Machines Corp Cambridge MA United States

ISBN: (纸本)0897916360

We exhibit a set of functions coded in Haskell that can be used as building blocks to construct a variety of interpreters for lisp-like languages. The building blocks are joined merely through functional composition. Each building block contributes code to support a specific feature, such as numbers, continuations, functions calls, or nondeterminism. The result of composing some number of building blocks is a parser, an interpreter, and a printer that support exactly the expression forms and data types needed for the combined set of features, and no more.

关键词： Computer programming.languages

来源：评论

学校读者我要写书评

暂无评论

Needed narrowing strategy

Needed narrowing strategy

引用

21st Annual acm symposium on Principles of programming.Languages, POPL'94

作者： Antoy, Sergio Echahed, Rachid Hanus, Michael Portland State Univ Portland OR United States

ISBN: (纸本)0897916360

Narrowing is the operational principle of languages that integrate functional and logic programming. We propose a notion of a needed narrowing step that, for inductively sequential rewrite systems, extends the Huet and Levy notion of a needed reduction step. We define a strategy, based on this notion, that computes only needed narrowing steps. Our strategy is sound and complete for a large class of rewrite systems, is optimal w.r.t. the cost measure that counts the number of distinct steps of a derivation, computes only independent unifiers, and is efficiently implemented by pattern matching.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Sort inference algorithm for the polyadic π-calculus

Sort inference algorithm for the polyadic π-calculus

引用

20th Annual acm SIGPLAN-SIGACT symposium on Principles of programming.Languages, POPL'93

作者： Gay, Simon J. Imperial Coll of Science Technology and Medicine London United Kingdom

ISBN: (纸本)0897915607

In Milner's polyadic π-calculus there is a notion of sorts which is analogous to the notion of types in functional programming. As a well-typed program applies functions to arguments in a consistent way, a well-sorted process uses communication channels in a consistent way. An open problem is whether there is an algorithm to infer sorts in the π-calculus in the same way that types can be inferred in functional programming. Here we solve the problem by presenting an algorithm which infers the most general sorting for a process in the first-order calculus, and proving its correctness. The algorithm is similar in style to those used for Hindley-Milner type inference in functional languages.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

conference record of the Sixteenth Annual acm symposium on Principles of programming.Languages

Conference Record of the Sixteenth Annual ACM Symposium on P...

引用

conference record of the Sixteenth Annual acm symposium on Principles of programming.Languages

This conference proceedings contains 30 papers. The topics covered are: program dependence graphs;types;semantics;concurrent processes;logic programming.communicating systems;program transformation;functional language... 详细信息

ISBN: (纸本)0897912942

关键词： Computer programming.Languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：